%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP655+2 : TPTP v8.1.0. Released v4.0.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 : n024.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:45 EDT 2022 % Result : Theorem 153.50s 19.76s % Output : CNFRefutation 153.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : GRP655+2 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n024.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue Jun 14 06:07:18 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 6 Number of unprocessed: 6 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 6 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 1 conjectures. % 0.13/0.39 # There are 1 start rule candidates: % 0.13/0.39 # Found 5 unit axioms. % 0.13/0.39 # 1 start rule tableaux created. % 0.13/0.39 # 1 extension rule candidate clauses % 0.13/0.39 # 5 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.39 # Creating equality axioms % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 13 tableaux to operate on % 153.50/19.76 # There were 1 total branch saturation attempts. % 153.50/19.76 # There were 0 of these attempts blocked. % 153.50/19.76 # There were 0 deferred branch saturation attempts. % 153.50/19.76 # There were 0 free duplicated saturations. % 153.50/19.76 # There were 1 total successful branch saturations. % 153.50/19.76 # There were 0 successful branch saturations in interreduction. % 153.50/19.76 # There were 0 successful branch saturations on the branch. % 153.50/19.76 # There were 1 successful branch saturations after the branch. % 153.50/19.76 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 153.50/19.76 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 153.50/19.76 # Begin clausification derivation % 153.50/19.76 % 153.50/19.76 # End clausification derivation % 153.50/19.76 # Begin listing active clauses obtained from FOF to CNF conversion % 153.50/19.76 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)). % 153.50/19.76 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=X1)). % 153.50/19.76 cnf(i_0_2, plain, (ld(X1,mult(X1,X2))=X2)). % 153.50/19.76 cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)). % 153.50/19.76 cnf(i_0_5, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2))))). % 153.50/19.76 cnf(i_0_6, negated_conjecture, (mult(esk1_0,rd(esk2_0,esk2_0))!=esk1_0|mult(rd(esk2_0,esk2_0),esk1_0)!=esk1_0)). % 153.50/19.76 cnf(i_0_13, plain, (X19=X19)). % 153.50/19.76 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 153.50/19.76 # Begin printing tableau % 153.50/19.76 # Found 6 steps % 153.50/19.76 cnf(i_0_3, plain, (mult(rd(X6,X9),X9)=X6), inference(start_rule)). % 153.50/19.76 cnf(i_0_20, plain, (mult(rd(X6,X9),X9)=X6), inference(extension_rule, [i_0_19])). % 153.50/19.76 cnf(i_0_44, plain, (mult(rd(X4,X2),X2)!=X4), inference(closure_rule, [i_0_3])). % 153.50/19.76 cnf(i_0_43, plain, (rd(mult(rd(X4,X2),X2),mult(rd(X6,X9),X9))=rd(X4,X6)), inference(extension_rule, [i_0_16])). % 153.50/19.76 cnf(i_0_54, plain, (rd(X4,X6)!=mult(rd(rd(X4,X6),X2),X2)), inference(closure_rule, [i_0_3])). % 153.50/19.76 cnf(i_0_52, plain, (rd(mult(rd(X4,X2),X2),mult(rd(X6,X9),X9))=mult(rd(rd(X4,X6),X2),X2)), inference(etableau_closure_rule, [i_0_52, ...])). % 153.50/19.76 # End printing tableau % 153.50/19.76 # SZS output end % 153.50/19.76 # Branches closed with saturation will be marked with an "s" % 154.62/19.84 # Child (18862) has found a proof. % 154.62/19.84 % 154.62/19.84 # Proof search is over... % 154.62/19.84 # Freeing feature tree %------------------------------------------------------------------------------