%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP660-10 : TPTP v8.1.0. Released v8.1.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 : n010.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:07:48 EDT 2022 % Result : Unsatisfiable 4.15s 0.89s % Output : CNFRefutation 4.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : GRP660-10 : TPTP v8.1.0. Released v8.1.0. % 0.11/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.35 % Computer : n010.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue Jun 14 05:31:24 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.14/0.38 # and selection function SelectNewComplexAHP. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 6 Number of unprocessed: 6 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 6 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 1 conjectures. % 0.14/0.38 # There are 1 start rule candidates: % 0.14/0.38 # Found 6 unit axioms. % 0.14/0.38 # 1 start rule tableaux created. % 0.14/0.38 # 0 extension rule candidate clauses % 0.14/0.38 # 6 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.38 # Creating equality axioms % 0.14/0.38 # Ran out of tableaux, making start rules for all clauses % 0.14/0.38 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 17 tableaux to operate on % 4.15/0.89 # There were 1 total branch saturation attempts. % 4.15/0.89 # There were 0 of these attempts blocked. % 4.15/0.89 # There were 0 deferred branch saturation attempts. % 4.15/0.89 # There were 0 free duplicated saturations. % 4.15/0.89 # There were 1 total successful branch saturations. % 4.15/0.89 # There were 0 successful branch saturations in interreduction. % 4.15/0.89 # There were 0 successful branch saturations on the branch. % 4.15/0.89 # There were 1 successful branch saturations after the branch. % 4.15/0.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.15/0.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.15/0.89 # Begin clausification derivation % 4.15/0.89 % 4.15/0.89 # End clausification derivation % 4.15/0.89 # Begin listing active clauses obtained from FOF to CNF conversion % 4.15/0.89 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)). % 4.15/0.89 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)). % 4.15/0.89 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)). % 4.15/0.89 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)). % 4.15/0.89 cnf(i_0_11, plain, (mult(mult(mult(X1,X2),X3),X1)=mult(X1,mult(X2,mult(X3,X1))))). % 4.15/0.89 cnf(i_0_12, negated_conjecture, (tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1))!=tuple(x1(X1),x1_2(X1)))). % 4.15/0.89 cnf(i_0_14, plain, (X4=X4)). % 4.15/0.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.15/0.89 # Begin printing tableau % 4.15/0.89 # Found 6 steps % 4.15/0.89 cnf(i_0_8, plain, (ld(X13,mult(X13,X6))=X6), inference(start_rule)). % 4.15/0.89 cnf(i_0_24, plain, (ld(X13,mult(X13,X6))=X6), inference(extension_rule, [i_0_20])). % 4.15/0.89 cnf(i_0_45, plain, (ld(X1,mult(X1,X4))!=X4), inference(closure_rule, [i_0_8])). % 4.15/0.89 cnf(i_0_44, plain, (rd(ld(X1,mult(X1,X4)),ld(X13,mult(X13,X6)))=rd(X4,X6)), inference(extension_rule, [i_0_17])). % 4.15/0.89 cnf(i_0_60, plain, (rd(X4,X6)!=ld(X1,mult(X1,rd(X4,X6)))), inference(closure_rule, [i_0_8])). % 4.15/0.89 cnf(i_0_58, plain, (rd(ld(X1,mult(X1,X4)),ld(X13,mult(X13,X6)))=ld(X1,mult(X1,rd(X4,X6)))), inference(etableau_closure_rule, [i_0_58, ...])). % 4.15/0.89 # End printing tableau % 4.15/0.89 # SZS output end % 4.15/0.89 # Branches closed with saturation will be marked with an "s" % 4.15/0.89 # There were 1 total branch saturation attempts. % 4.15/0.89 # There were 0 of these attempts blocked. % 4.15/0.89 # There were 0 deferred branch saturation attempts. % 4.15/0.89 # There were 0 free duplicated saturations. % 4.15/0.89 # There were 1 total successful branch saturations. % 4.15/0.89 # There were 0 successful branch saturations in interreduction. % 4.15/0.89 # There were 0 successful branch saturations on the branch. % 4.15/0.89 # There were 1 successful branch saturations after the branch. % 4.15/0.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.15/0.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.15/0.89 # Begin clausification derivation % 4.15/0.89 % 4.15/0.89 # End clausification derivation % 4.15/0.89 # Begin listing active clauses obtained from FOF to CNF conversion % 4.15/0.89 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)). % 4.15/0.89 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)). % 4.15/0.89 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)). % 4.15/0.89 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)). % 4.15/0.89 cnf(i_0_11, plain, (mult(mult(mult(X1,X2),X3),X1)=mult(X1,mult(X2,mult(X3,X1))))). % 4.15/0.89 cnf(i_0_12, negated_conjecture, (tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1))!=tuple(x1(X1),x1_2(X1)))). % 4.15/0.89 cnf(i_0_14, plain, (X4=X4)). % 4.15/0.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.15/0.89 # Begin printing tableau % 4.15/0.89 # Found 5 steps % 4.15/0.89 cnf(i_0_8, plain, (ld(X5,mult(X5,X4))=X4), inference(start_rule)). % 4.15/0.89 cnf(i_0_24, plain, (ld(X5,mult(X5,X4))=X4), inference(extension_rule, [i_0_21])). % 4.15/0.89 cnf(i_0_47, plain, (x1(ld(X5,mult(X5,X4)))=x1(X4)), inference(extension_rule, [i_0_17])). % 4.15/0.89 cnf(i_0_60, plain, (x1(X4)!=ld(X1,mult(X1,x1(X4)))), inference(closure_rule, [i_0_8])). % 4.15/0.89 cnf(i_0_58, plain, (x1(ld(X5,mult(X5,X4)))=ld(X1,mult(X1,x1(X4)))), inference(etableau_closure_rule, [i_0_58, ...])). % 4.15/0.89 # End printing tableau % 4.15/0.89 # SZS output end % 4.15/0.89 # Branches closed with saturation will be marked with an "s" % 4.15/0.90 # Child (15031) has found a proof. % 4.15/0.90 % 4.15/0.90 # Proof search is over... % 4.15/0.90 # Freeing feature tree %------------------------------------------------------------------------------