%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM840+2 : TPTP v8.1.0. Released v4.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 : n024.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 : Mon Jul 18 09:46:02 EDT 2022 % Result : Theorem 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n024.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jul 5 05:53:59 EDT 2022 % 0.14/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.20/0.37 # and selection function SelectCQIPrecW. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 27 Number of unprocessed: 22 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 22 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 10 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 12 extension rule candidate clauses % 0.20/0.37 # 10 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.40 # There were 2 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 2 total successful branch saturations. % 0.20/0.40 # There were 1 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_14, plain, (less(X1,vplus(X1,X2)))). % 0.20/0.40 cnf(i_0_2, plain, (less(vplus(vd328,vd330),vplus(vd330,vd329)))). % 0.20/0.40 cnf(i_0_16, plain, (greater(vplus(X1,X2),X1))). % 0.20/0.40 cnf(i_0_27, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))). % 0.20/0.40 cnf(i_0_24, plain, (vplus(X1,X2)=vplus(X2,X1))). % 0.20/0.40 cnf(i_0_1, negated_conjecture, (~less(vd328,vd329))). % 0.20/0.40 cnf(i_0_11, plain, (~less(X1,X1))). % 0.20/0.40 cnf(i_0_23, plain, (vplus(X1,X2)!=X2)). % 0.20/0.40 cnf(i_0_13, plain, (~greater(X1,X1))). % 0.20/0.40 cnf(i_0_19, plain, (vplus(X1,X2)!=X1)). % 0.20/0.40 cnf(i_0_9, plain, (less(X1,X2)|~greater(X2,X1))). % 0.20/0.40 cnf(i_0_12, plain, (~greater(X1,X2)|~less(X1,X2))). % 0.20/0.40 cnf(i_0_8, plain, (greater(X1,X2)|~less(X2,X1))). % 0.20/0.40 cnf(i_0_3, plain, (vd329=vd328|vplus(vd330,vd329)!=vplus(vd328,vd330))). % 0.20/0.40 cnf(i_0_22, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))). % 0.20/0.40 cnf(i_0_4, plain, (greater(vd328,vd329)|~greater(vplus(vd328,vd330),vplus(vd330,vd329)))). % 0.20/0.40 cnf(i_0_10, plain, (X1=X2|greater(X1,X2)|less(X1,X2))). % 0.20/0.40 cnf(i_0_15, plain, (vplus(X1,esk1_2(X2,X1))=X2|~less(X1,X2))). % 0.20/0.40 cnf(i_0_17, plain, (vplus(X1,esk2_2(X1,X2))=X2|~greater(X2,X1))). % 0.20/0.40 cnf(i_0_5, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))). % 0.20/0.40 cnf(i_0_7, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))). % 0.20/0.40 cnf(i_0_18, plain, (vplus(X1,esk3_2(X2,X1))=X2|vplus(X2,esk4_2(X2,X1))=X1|X2=X1)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_1, negated_conjecture, (~less(vd328,vd329)), inference(start_rule)). % 0.20/0.40 cnf(i_0_37, plain, (~less(vd328,vd329)), inference(extension_rule, [i_0_10])). % 0.20/0.40 cnf(i_0_51, plain, (greater(vd328,vd329)), inference(extension_rule, [i_0_9])). % 0.20/0.40 cnf(i_0_50, plain, (vd329=vd328), inference(etableau_closure_rule, [i_0_50, ...])). % 0.20/0.40 cnf(i_0_90, plain, (less(vd329,vd328)), inference(etableau_closure_rule, [i_0_90, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.20/0.40 # We now have 2 tableaux to operate on % 0.20/0.40 # Found closed tableau during pool population. % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------