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