%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP715+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 : n019.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:11 EDT 2022 % Result : Theorem 4.06s 0.88s % Output : CNFRefutation 4.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n019.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jun 13 11:05:09 EDT 2022 % 0.12/0.34 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.18/0.36 # and selection function SelectNewComplexAHP. % 0.18/0.36 # % 0.18/0.36 # Number of axioms: 12 Number of unprocessed: 12 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 12 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 11 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 1 extension rule candidate clauses % 0.18/0.36 # 11 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 19 tableaux to operate on % 4.06/0.88 # There were 1 total branch saturation attempts. % 4.06/0.88 # There were 0 of these attempts blocked. % 4.06/0.88 # There were 0 deferred branch saturation attempts. % 4.06/0.88 # There were 0 free duplicated saturations. % 4.06/0.88 # There were 1 total successful branch saturations. % 4.06/0.88 # There were 0 successful branch saturations in interreduction. % 4.06/0.88 # There were 0 successful branch saturations on the branch. % 4.06/0.88 # There were 1 successful branch saturations after the branch. % 4.06/0.88 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.06/0.88 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.06/0.88 # Begin clausification derivation % 4.06/0.88 % 4.06/0.88 # End clausification derivation % 4.06/0.88 # Begin listing active clauses obtained from FOF to CNF conversion % 4.06/0.88 cnf(i_0_10, plain, (mult(op_a,op_b)=unit)). % 4.06/0.88 cnf(i_0_11, plain, (mult(op_b,op_a)=unit)). % 4.06/0.88 cnf(i_0_3, plain, (plus(X1,op_0)=X1)). % 4.06/0.88 cnf(i_0_8, plain, (mult(X1,unit)=X1)). % 4.06/0.88 cnf(i_0_9, plain, (mult(unit,X1)=X1)). % 4.06/0.88 cnf(i_0_4, plain, (plus(X1,minus(X1))=op_0)). % 4.06/0.88 cnf(i_0_2, plain, (plus(X1,X2)=plus(X2,X1))). % 4.06/0.88 cnf(i_0_7, plain, (mult(mult(X1,X2),X2)=mult(X1,mult(X2,X2)))). % 4.06/0.88 cnf(i_0_1, plain, (plus(plus(X1,X2),X3)=plus(X1,plus(X2,X3)))). % 4.06/0.88 cnf(i_0_12, negated_conjecture, (mult(mult(esk1_0,op_a),op_b)!=esk1_0|mult(mult(esk1_0,op_b),op_a)!=esk1_0)). % 4.06/0.88 cnf(i_0_5, plain, (plus(mult(X1,X2),mult(X1,X3))=mult(X1,plus(X2,X3)))). % 4.06/0.88 cnf(i_0_6, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))). % 4.06/0.88 cnf(i_0_19, plain, (X23=X23)). % 4.06/0.88 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.06/0.88 # Begin printing tableau % 4.06/0.88 # Found 6 steps % 4.06/0.88 cnf(i_0_10, plain, (mult(op_a,op_b)=unit), inference(start_rule)). % 4.06/0.88 cnf(i_0_26, plain, (mult(op_a,op_b)=unit), inference(extension_rule, [i_0_22])). % 4.06/0.88 cnf(i_0_48, plain, (mult(op_a,op_b)!=unit), inference(closure_rule, [i_0_10])). % 4.06/0.88 cnf(i_0_46, plain, (mult(op_a,op_b)=mult(op_a,op_b)), inference(extension_rule, [i_0_23])). % 4.06/0.88 cnf(i_0_134, plain, (mult(op_a,op_b)!=unit), inference(closure_rule, [i_0_10])). % 4.06/0.88 cnf(i_0_132, plain, (plus(mult(op_a,op_b),mult(op_a,op_b))=plus(mult(op_a,op_b),unit)), inference(etableau_closure_rule, [i_0_132, ...])). % 4.06/0.88 # End printing tableau % 4.06/0.88 # SZS output end % 4.06/0.88 # Branches closed with saturation will be marked with an "s" % 4.06/0.89 # Child (10256) has found a proof. % 4.06/0.89 % 4.06/0.89 # Proof search is over... % 4.06/0.89 # Freeing feature tree %------------------------------------------------------------------------------