%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP200-1 : TPTP v8.1.0. Released v2.2.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 : n027.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:05:26 EDT 2022 % Result : Unsatisfiable 2.20s 0.69s % Output : CNFRefutation 2.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : GRP200-1 : TPTP v8.1.0. Released v2.2.0. % 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n027.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jun 14 07:11:03 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.14/0.39 # and selection function SelectNewComplexAHP. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 10 Number of unprocessed: 10 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 10 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 10 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 0 extension rule candidate clauses % 0.14/0.39 # 10 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Creating equality axioms % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 19 tableaux to operate on % 2.20/0.69 # There were 1 total branch saturation attempts. % 2.20/0.69 # There were 0 of these attempts blocked. % 2.20/0.69 # There were 0 deferred branch saturation attempts. % 2.20/0.69 # There were 0 free duplicated saturations. % 2.20/0.69 # There were 1 total successful branch saturations. % 2.20/0.69 # There were 0 successful branch saturations in interreduction. % 2.20/0.69 # There were 0 successful branch saturations on the branch. % 2.20/0.69 # There were 1 successful branch saturations after the branch. % 2.20/0.69 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.20/0.69 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.20/0.69 # Begin clausification derivation % 2.20/0.69 % 2.20/0.69 # End clausification derivation % 2.20/0.69 # Begin listing active clauses obtained from FOF to CNF conversion % 2.20/0.69 cnf(i_0_12, plain, (multiply(X1,identity)=X1)). % 2.20/0.69 cnf(i_0_11, plain, (multiply(identity,X1)=X1)). % 2.20/0.69 cnf(i_0_17, plain, (multiply(X1,right_inverse(X1))=identity)). % 2.20/0.69 cnf(i_0_18, plain, (multiply(left_inverse(X1),X1)=identity)). % 2.20/0.69 cnf(i_0_13, plain, (multiply(X1,left_division(X1,X2))=X2)). % 2.20/0.69 cnf(i_0_14, plain, (left_division(X1,multiply(X1,X2))=X2)). % 2.20/0.69 cnf(i_0_15, plain, (multiply(right_division(X1,X2),X2)=X1)). % 2.20/0.69 cnf(i_0_16, plain, (right_division(multiply(X1,X2),X2)=X1)). % 2.20/0.69 cnf(i_0_19, plain, (multiply(multiply(X1,multiply(X2,X3)),X1)=multiply(multiply(X1,X2),multiply(X3,X1)))). % 2.20/0.69 cnf(i_0_20, negated_conjecture, (multiply(multiply(multiply(a,b),c),b)!=multiply(a,multiply(b,multiply(c,b))))). % 2.20/0.69 cnf(i_0_22, plain, (X4=X4)). % 2.20/0.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.20/0.69 # Begin printing tableau % 2.20/0.69 # Found 6 steps % 2.20/0.69 cnf(i_0_12, plain, (multiply(X7,identity)=X7), inference(start_rule)). % 2.20/0.69 cnf(i_0_31, plain, (multiply(X7,identity)=X7), inference(extension_rule, [i_0_26])). % 2.20/0.69 cnf(i_0_51, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_12])). % 2.20/0.69 cnf(i_0_49, plain, (multiply(multiply(X7,identity),multiply(identity,identity))=multiply(X7,identity)), inference(extension_rule, [i_0_25])). % 2.20/0.69 cnf(i_0_68, plain, (multiply(X7,identity)!=X7), inference(closure_rule, [i_0_12])). % 2.20/0.69 cnf(i_0_66, plain, (multiply(multiply(X7,identity),multiply(identity,identity))=X7), inference(etableau_closure_rule, [i_0_66, ...])). % 2.20/0.69 # End printing tableau % 2.20/0.69 # SZS output end % 2.20/0.69 # Branches closed with saturation will be marked with an "s" % 2.20/0.69 # Child (2760) has found a proof. % 2.20/0.69 % 2.20/0.69 # Proof search is over... % 2.20/0.69 # Freeing feature tree %------------------------------------------------------------------------------