%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM850+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 : n023.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:10 EDT 2022 % Result : Theorem 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM850+2 : TPTP v8.1.0. Released v4.1.0. % 0.11/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.32 % Computer : n023.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Wed Jul 6 00:14:57 EDT 2022 % 0.12/0.32 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.12/0.35 # and selection function SelectCQIPrecW. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 59 Number of unprocessed: 51 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 51 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 22 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 29 extension rule candidate clauses % 0.12/0.36 # 22 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.12/0.36 # There were 0 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 0 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 0 successful branch saturations after the branch. % 0.12/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_2, plain, (greater(vd470,vd471))). % 0.12/0.36 cnf(i_0_12, plain, (geq(X1,v1))). % 0.12/0.36 cnf(i_0_8, plain, (vmul(X1,v1)=X1)). % 0.12/0.36 cnf(i_0_7, plain, (vmul(v1,X1)=X1)). % 0.12/0.36 cnf(i_0_29, plain, (leq(X1,X1))). % 0.12/0.36 cnf(i_0_32, plain, (geq(X1,X1))). % 0.12/0.36 cnf(i_0_23, plain, (greater(vplus(X1,X2),X1))). % 0.12/0.36 cnf(i_0_54, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))). % 0.12/0.36 cnf(i_0_41, plain, (less(X1,vplus(X1,X2)))). % 0.12/0.36 cnf(i_0_3, plain, (vmul(vmul(X1,X2),X3)=vmul(X1,vmul(X2,X3)))). % 0.12/0.36 cnf(i_0_4, plain, (vplus(vmul(X1,X2),vmul(X1,X3))=vmul(X1,vplus(X2,X3)))). % 0.12/0.36 cnf(i_0_51, plain, (vplus(X1,X2)=vplus(X2,X1))). % 0.12/0.36 cnf(i_0_5, plain, (vmul(X1,X2)=vmul(X2,X1))). % 0.12/0.36 cnf(i_0_9, plain, (vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2)))). % 0.12/0.36 cnf(i_0_6, plain, (vmul(vplus(X1,v1),X2)=vplus(X2,vmul(X1,X2)))). % 0.12/0.36 cnf(i_0_1, negated_conjecture, (vplus(vd471,X1)!=vd470)). % 0.12/0.36 cnf(i_0_61, plain, (vplus(X1,v1)!=v1)). % 0.12/0.36 cnf(i_0_58, plain, (vplus(X1,v1)!=X1)). % 0.12/0.36 cnf(i_0_50, plain, (vplus(X1,X2)!=X2)). % 0.12/0.36 cnf(i_0_40, plain, (~greater(X1,X1))). % 0.12/0.36 cnf(i_0_38, plain, (~less(X1,X1))). % 0.12/0.36 cnf(i_0_46, plain, (vplus(X1,X2)!=X1)). % 0.12/0.36 cnf(i_0_39, plain, (~less(X1,X2)|~greater(X1,X2))). % 0.12/0.36 cnf(i_0_35, plain, (greater(X1,X2)|~less(X2,X1))). % 0.12/0.36 cnf(i_0_28, plain, (geq(X1,X2)|~leq(X2,X1))). % 0.12/0.36 cnf(i_0_18, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))). % 0.12/0.36 cnf(i_0_49, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))). % 0.12/0.36 cnf(i_0_36, plain, (less(X1,X2)|~greater(X2,X1))). % 0.12/0.36 cnf(i_0_30, plain, (leq(X1,X2)|~less(X1,X2))). % 0.12/0.36 cnf(i_0_33, plain, (geq(X1,X2)|~greater(X1,X2))). % 0.12/0.36 cnf(i_0_57, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)). % 0.12/0.36 cnf(i_0_10, plain, (leq(X1,X2)|~less(X1,vplus(X2,v1)))). % 0.12/0.36 cnf(i_0_34, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))). % 0.12/0.36 cnf(i_0_31, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.12/0.36 cnf(i_0_19, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))). % 0.12/0.36 cnf(i_0_17, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))). % 0.12/0.36 cnf(i_0_37, plain, (X1=X2|less(X1,X2)|greater(X1,X2))). % 0.12/0.36 cnf(i_0_11, plain, (geq(X1,vplus(X2,v1))|~greater(X1,X2))). % 0.12/0.36 cnf(i_0_27, plain, (less(X1,X2)|~less(X1,X3)|~less(X3,X2))). % 0.12/0.36 cnf(i_0_25, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.12/0.36 cnf(i_0_26, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.12/0.36 cnf(i_0_24, plain, (leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2))). % 0.12/0.36 cnf(i_0_42, plain, (vplus(X1,esk1_2(X2,X1))=X2|~less(X1,X2))). % 0.12/0.36 cnf(i_0_44, plain, (vplus(X1,esk2_2(X1,X2))=X2|~greater(X2,X1))). % 0.12/0.36 cnf(i_0_22, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))). % 0.12/0.36 cnf(i_0_20, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))). % 0.12/0.36 cnf(i_0_16, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~greater(X1,X3)|~greater(X2,X4))). % 0.12/0.36 cnf(i_0_14, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X2,X4)|~greater(X1,X3))). % 0.12/0.36 cnf(i_0_15, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X1,X3)|~greater(X2,X4))). % 0.12/0.36 cnf(i_0_13, plain, (geq(vplus(X1,X2),vplus(X3,X4))|~geq(X1,X3)|~geq(X2,X4))). % 0.12/0.36 cnf(i_0_45, plain, (vplus(X1,esk3_2(X2,X1))=X2|vplus(X2,esk4_2(X2,X1))=X1|X2=X1)). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 3 steps % 0.12/0.36 cnf(i_0_1, negated_conjecture, (vplus(vd471,esk2_2(vd471,vd470))!=vd470), inference(start_rule)). % 0.12/0.36 cnf(i_0_71, plain, (vplus(vd471,esk2_2(vd471,vd470))!=vd470), inference(extension_rule, [i_0_44])). % 0.12/0.36 cnf(i_0_122, plain, (~greater(vd470,vd471)), inference(closure_rule, [i_0_2])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 7 tableaux to operate on % 0.12/0.36 # Found closed tableau during pool population. % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------