%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP388-1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n011.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sat Jul 16 09:06:15 EDT 2022 % Result : Unsatisfiable 3.14s 0.75s % Output : CNFRefutation 3.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : GRP388-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n011.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jun 14 04:28:19 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 37 Number of unprocessed: 37 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 37 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 34 conjectures. % 0.13/0.36 # There are 34 start rule candidates: % 0.13/0.36 # Found 4 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 34 start rule tableaux created. % 0.13/0.36 # 33 extension rule candidate clauses % 0.13/0.36 # 4 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.20/0.43 # Creating equality axioms % 0.20/0.43 # Ran out of tableaux, making start rules for all clauses % 0.20/0.45 # Creating equality axioms % 0.20/0.45 # Ran out of tableaux, making start rules for all clauses % 2.55/0.73 # Creating equality axioms % 2.55/0.73 # Ran out of tableaux, making start rules for all clauses % 2.55/0.73 # Creating equality axioms % 2.55/0.73 # Ran out of tableaux, making start rules for all clauses % 2.55/0.74 # Creating equality axioms % 2.55/0.74 # Ran out of tableaux, making start rules for all clauses % 2.55/0.74 # Creating equality axioms % 2.55/0.74 # Ran out of tableaux, making start rules for all clauses % 2.55/0.74 # Creating equality axioms % 2.55/0.74 # Ran out of tableaux, making start rules for all clauses % 2.55/0.74 # Creating equality axioms % 2.55/0.74 # Ran out of tableaux, making start rules for all clauses % 3.14/0.75 # There were 5 total branch saturation attempts. % 3.14/0.75 # There were 0 of these attempts blocked. % 3.14/0.75 # There were 0 deferred branch saturation attempts. % 3.14/0.75 # There were 0 free duplicated saturations. % 3.14/0.75 # There were 5 total successful branch saturations. % 3.14/0.75 # There were 0 successful branch saturations in interreduction. % 3.14/0.75 # There were 0 successful branch saturations on the branch. % 3.14/0.75 # There were 5 successful branch saturations after the branch. % 3.14/0.75 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.14/0.75 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.14/0.75 # Begin clausification derivation % 3.14/0.75 % 3.14/0.75 # End clausification derivation % 3.14/0.75 # Begin listing active clauses obtained from FOF to CNF conversion % 3.14/0.75 cnf(i_0_41, negated_conjecture, (inverse(sk_c10)=sk_c9)). % 3.14/0.75 cnf(i_0_38, plain, (multiply(identity,X1)=X1)). % 3.14/0.75 cnf(i_0_39, plain, (multiply(inverse(X1),X1)=identity)). % 3.14/0.75 cnf(i_0_40, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 3.14/0.75 cnf(i_0_68, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c3)=sk_c10)). % 3.14/0.75 cnf(i_0_70, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c5)=sk_c6)). % 3.14/0.75 cnf(i_0_72, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c7)=sk_c10)). % 3.14/0.75 cnf(i_0_52, negated_conjecture, (multiply(sk_c10,sk_c2)=sk_c9|inverse(sk_c3)=sk_c10)). % 3.14/0.75 cnf(i_0_44, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c3)=sk_c10)). % 3.14/0.75 cnf(i_0_60, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|inverse(sk_c3)=sk_c10)). % 3.14/0.75 cnf(i_0_54, negated_conjecture, (multiply(sk_c10,sk_c2)=sk_c9|inverse(sk_c5)=sk_c6)). % 3.14/0.75 cnf(i_0_46, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c5)=sk_c6)). % 3.14/0.75 cnf(i_0_62, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|inverse(sk_c5)=sk_c6)). % 3.14/0.75 cnf(i_0_56, negated_conjecture, (multiply(sk_c10,sk_c2)=sk_c9|inverse(sk_c7)=sk_c10)). % 3.14/0.75 cnf(i_0_48, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c7)=sk_c10)). % 3.14/0.75 cnf(i_0_64, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|inverse(sk_c7)=sk_c10)). % 3.14/0.75 cnf(i_0_66, negated_conjecture, (multiply(sk_c10,sk_c4)=sk_c9|inverse(sk_c1)=sk_c10)). % 3.14/0.75 cnf(i_0_67, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c4|inverse(sk_c1)=sk_c10)). % 3.14/0.75 cnf(i_0_69, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c8|inverse(sk_c1)=sk_c10)). % 3.14/0.75 cnf(i_0_71, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c8|inverse(sk_c1)=sk_c10)). % 3.14/0.75 cnf(i_0_73, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c10|inverse(sk_c1)=sk_c10)). % 3.14/0.75 cnf(i_0_50, negated_conjecture, (multiply(sk_c10,sk_c2)=sk_c9|multiply(sk_c10,sk_c4)=sk_c9)). % 3.14/0.75 cnf(i_0_42, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|multiply(sk_c10,sk_c4)=sk_c9)). % 3.14/0.75 cnf(i_0_58, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|multiply(sk_c10,sk_c4)=sk_c9)). % 3.14/0.75 cnf(i_0_51, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c4|multiply(sk_c10,sk_c2)=sk_c9)). % 3.14/0.75 cnf(i_0_53, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c8|multiply(sk_c10,sk_c2)=sk_c9)). % 3.14/0.75 cnf(i_0_55, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c8|multiply(sk_c10,sk_c2)=sk_c9)). % 3.14/0.75 cnf(i_0_57, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c10|multiply(sk_c10,sk_c2)=sk_c9)). % 3.14/0.75 cnf(i_0_43, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c4|multiply(sk_c8,sk_c9)=sk_c10)). % 3.14/0.75 cnf(i_0_45, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c8|multiply(sk_c8,sk_c9)=sk_c10)). % 3.14/0.75 cnf(i_0_47, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c8|multiply(sk_c8,sk_c9)=sk_c10)). % 3.14/0.75 cnf(i_0_49, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c10|multiply(sk_c8,sk_c9)=sk_c10)). % 3.14/0.75 cnf(i_0_59, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|multiply(sk_c3,sk_c10)=sk_c4)). % 3.14/0.75 cnf(i_0_61, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|multiply(sk_c5,sk_c6)=sk_c8)). % 3.14/0.75 cnf(i_0_63, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|multiply(sk_c6,sk_c9)=sk_c8)). % 3.14/0.75 cnf(i_0_65, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c2|multiply(sk_c7,sk_c8)=sk_c10)). % 3.14/0.75 cnf(i_0_74, negated_conjecture, (multiply(sk_c10,multiply(X1,sk_c10))!=sk_c9|multiply(sk_c10,multiply(X2,sk_c10))!=sk_c9|multiply(inverse(X3),sk_c9)!=sk_c8|multiply(sk_c8,sk_c9)!=sk_c10|multiply(X3,inverse(X3))!=sk_c8|multiply(X4,sk_c8)!=sk_c10|inverse(X4)!=sk_c10|inverse(X1)!=sk_c10|inverse(X2)!=sk_c10)). % 3.14/0.75 cnf(i_0_2643, plain, (X8=X8)). % 3.14/0.75 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.14/0.75 # Begin printing tableau % 3.14/0.75 # Found 7 steps % 3.14/0.75 cnf(i_0_2643, plain, (sk_c6=sk_c6), inference(start_rule)). % 3.14/0.75 cnf(i_0_2726, plain, (sk_c6=sk_c6), inference(extension_rule, [i_0_2647])). % 3.14/0.75 cnf(i_0_2809, plain, (inverse(sk_c10)!=sk_c9), inference(closure_rule, [i_0_41])). % 3.14/0.75 cnf(i_0_2807, plain, (multiply(sk_c6,inverse(sk_c10))=multiply(sk_c6,sk_c9)), inference(extension_rule, [i_0_2646])). % 3.14/0.75 cnf(i_0_2889, plain, (multiply(sk_c6,sk_c9)!=sk_c8), inference(extension_rule, [i_0_63])). % 3.14/0.75 cnf(i_0_2887, plain, (multiply(sk_c6,inverse(sk_c10))=sk_c8), inference(etableau_closure_rule, [i_0_2887, ...])). % 3.14/0.75 cnf(i_0_6373, plain, (multiply(sk_c1,sk_c10)=sk_c2), inference(etableau_closure_rule, [i_0_6373, ...])). % 3.14/0.75 # End printing tableau % 3.14/0.75 # SZS output end % 3.14/0.75 # Branches closed with saturation will be marked with an "s" % 3.14/0.75 # Child (23814) has found a proof. % 3.14/0.75 % 3.14/0.75 # Proof search is over... % 3.14/0.75 # Freeing feature tree %------------------------------------------------------------------------------