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