%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP655-13 : TPTP v8.1.0. Released v8.1.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 : n022.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:44 EDT 2022 % Result : Unsatisfiable 235.51s 30.09s % Output : CNFRefutation 235.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP655-13 : TPTP v8.1.0. Released v8.1.0. % 0.07/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 : n022.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 : Mon Jun 13 13:59:18 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 6 Number of unprocessed: 6 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 6 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 6 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 6 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 13 tableaux to operate on % 235.51/30.09 # There were 1 total branch saturation attempts. % 235.51/30.09 # There were 0 of these attempts blocked. % 235.51/30.09 # There were 0 deferred branch saturation attempts. % 235.51/30.09 # There were 0 free duplicated saturations. % 235.51/30.09 # There were 1 total successful branch saturations. % 235.51/30.09 # There were 0 successful branch saturations in interreduction. % 235.51/30.09 # There were 0 successful branch saturations on the branch. % 235.51/30.09 # There were 1 successful branch saturations after the branch. % 235.51/30.09 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 235.51/30.09 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 235.51/30.09 # Begin clausification derivation % 235.51/30.09 % 235.51/30.09 # End clausification derivation % 235.51/30.09 # Begin listing active clauses obtained from FOF to CNF conversion % 235.51/30.09 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)). % 235.51/30.09 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)). % 235.51/30.09 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)). % 235.51/30.09 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)). % 235.51/30.09 cnf(i_0_12, negated_conjecture, (mult(x0,ld(x1,x1))!=x0)). % 235.51/30.09 cnf(i_0_11, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2))))). % 235.51/30.09 cnf(i_0_14, plain, (X4=X4)). % 235.51/30.09 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 235.51/30.09 # Begin printing tableau % 235.51/30.09 # Found 6 steps % 235.51/30.09 cnf(i_0_8, plain, (ld(X11,mult(X11,x0))=x0), inference(start_rule)). % 235.51/30.09 cnf(i_0_21, plain, (ld(X11,mult(X11,x0))=x0), inference(extension_rule, [i_0_17])). % 235.51/30.09 cnf(i_0_32, plain, (mult(x0,ld(x1,x1))=x0), inference(closure_rule, [i_0_12])). % 235.51/30.09 cnf(i_0_33, plain, (mult(x0,ld(x1,x1))!=ld(X11,mult(X11,x0))), inference(extension_rule, [i_0_17])). % 235.51/30.09 cnf(i_0_49, plain, (mult(x0,ld(x1,x1))!=ld(X1,mult(X1,mult(x0,ld(x1,x1))))), inference(closure_rule, [i_0_8])). % 235.51/30.09 cnf(i_0_50, plain, (ld(X1,mult(X1,mult(x0,ld(x1,x1))))!=ld(X11,mult(X11,x0))), inference(etableau_closure_rule, [i_0_50, ...])). % 235.51/30.09 # End printing tableau % 235.51/30.09 # SZS output end % 235.51/30.09 # Branches closed with saturation will be marked with an "s" % 236.09/30.17 # Child (21555) has found a proof. % 236.09/30.17 % 236.09/30.17 # Proof search is over... % 236.09/30.17 # Freeing feature tree %------------------------------------------------------------------------------