%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP751-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:19 EDT 2022 % Result : Unsatisfiable 53.70s 7.18s % Output : CNFRefutation 53.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP751-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 : n007.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:26:24 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 8 Number of unprocessed: 8 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/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 # 8 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 8 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 8 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 15 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 15 tableaux to operate on % 53.70/7.18 # There were 1 total branch saturation attempts. % 53.70/7.18 # There were 0 of these attempts blocked. % 53.70/7.18 # There were 0 deferred branch saturation attempts. % 53.70/7.18 # There were 0 free duplicated saturations. % 53.70/7.18 # There were 1 total successful branch saturations. % 53.70/7.18 # There were 0 successful branch saturations in interreduction. % 53.70/7.18 # There were 0 successful branch saturations on the branch. % 53.70/7.18 # There were 1 successful branch saturations after the branch. % 53.70/7.18 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 53.70/7.18 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 53.70/7.18 # Begin clausification derivation % 53.70/7.18 % 53.70/7.18 # End clausification derivation % 53.70/7.18 # Begin listing active clauses obtained from FOF to CNF conversion % 53.70/7.18 cnf(i_0_10, plain, (ld(X1,mult(X1,X2))=X2)). % 53.70/7.18 cnf(i_0_9, plain, (mult(X1,ld(X1,X2))=X2)). % 53.70/7.18 cnf(i_0_11, plain, (mult(rd(X1,X2),X2)=X1)). % 53.70/7.18 cnf(i_0_12, plain, (rd(mult(X1,X2),X2)=X1)). % 53.70/7.18 cnf(i_0_15, plain, (mult(mult(X1,X2),mult(X3,X3))=mult(mult(X1,X3),mult(X2,X3)))). % 53.70/7.18 cnf(i_0_14, plain, (mult(mult(X1,X1),mult(X2,X3))=mult(mult(X1,X2),mult(X1,X3)))). % 53.70/7.18 cnf(i_0_16, negated_conjecture, (mult(mult(rd(a,a),b),mult(a,c))!=mult(a,mult(b,c)))). % 53.70/7.18 cnf(i_0_13, plain, (mult(mult(X1,mult(X1,X1)),mult(X2,X3))=mult(mult(X1,X2),mult(mult(X1,X1),X3)))). % 53.70/7.18 cnf(i_0_18, plain, (X4=X4)). % 53.70/7.18 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 53.70/7.18 # Begin printing tableau % 53.70/7.18 # Found 6 steps % 53.70/7.18 cnf(i_0_9, plain, (mult(ld(X1,mult(X1,mult(rd(a,a),b))),ld(ld(X1,mult(X1,mult(rd(a,a),b))),mult(a,mult(b,c))))=mult(a,mult(b,c))), inference(start_rule)). % 53.70/7.18 cnf(i_0_26, plain, (mult(ld(X1,mult(X1,mult(rd(a,a),b))),ld(ld(X1,mult(X1,mult(rd(a,a),b))),mult(a,mult(b,c))))=mult(a,mult(b,c))), inference(extension_rule, [i_0_21])). % 53.70/7.18 cnf(i_0_54, plain, (mult(mult(rd(a,a),b),mult(a,c))=mult(a,mult(b,c))), inference(closure_rule, [i_0_16])). % 53.70/7.18 cnf(i_0_55, plain, (mult(mult(rd(a,a),b),mult(a,c))!=mult(ld(X1,mult(X1,mult(rd(a,a),b))),ld(ld(X1,mult(X1,mult(rd(a,a),b))),mult(a,mult(b,c))))), inference(extension_rule, [i_0_23])). % 53.70/7.18 cnf(i_0_65, plain, (mult(rd(a,a),b)!=ld(X1,mult(X1,mult(rd(a,a),b)))), inference(closure_rule, [i_0_10])). % 53.70/7.18 cnf(i_0_66, plain, (ld(ld(X1,mult(X1,mult(rd(a,a),b))),mult(a,mult(b,c)))!=mult(a,c)), inference(etableau_closure_rule, [i_0_66, ...])). % 53.70/7.18 # End printing tableau % 53.70/7.18 # SZS output end % 53.70/7.18 # Branches closed with saturation will be marked with an "s" % 53.70/7.20 # Child (11672) has found a proof. % 53.70/7.20 % 53.70/7.20 # Proof search is over... % 53.70/7.20 # Freeing feature tree %------------------------------------------------------------------------------