%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM843+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 : n020.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:05 EDT 2022 % Result : Theorem 0.20s 0.42s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0. % 0.10/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 : n020.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 : Thu Jul 7 07:41:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.13/0.38 # and selection function SelectCQIPrecW. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 53 Number of unprocessed: 45 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.20/0.42 # The folding up rule is enabled... % 0.20/0.42 # Local unification is enabled... % 0.20/0.42 # Any saturation attempts will use folding labels... % 0.20/0.42 # 45 beginning clauses after preprocessing and clausification % 0.20/0.42 # Creating start rules for all 1 conjectures. % 0.20/0.42 # There are 1 start rule candidates: % 0.20/0.42 # Found 16 unit axioms. % 0.20/0.42 # 1 start rule tableaux created. % 0.20/0.42 # 29 extension rule candidate clauses % 0.20/0.42 # 16 unit axiom clauses % 0.20/0.42 % 0.20/0.42 # Requested 8, 32 cores available to the main process. % 0.20/0.42 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_5, plain, (geq(X1,v1))). % 0.20/0.42 cnf(i_0_23, plain, (leq(X1,X1))). % 0.20/0.42 cnf(i_0_26, plain, (geq(X1,X1))). % 0.20/0.42 cnf(i_0_16, plain, (greater(vplus(X1,X2),X1))). % 0.20/0.42 cnf(i_0_3, plain, (less(vd390,vplus(v1,vd391)))). % 0.20/0.42 cnf(i_0_35, plain, (less(X1,vplus(X1,X2)))). % 0.20/0.42 cnf(i_0_48, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))). % 0.20/0.42 cnf(i_0_45, plain, (vplus(X1,X2)=vplus(X2,X1))). % 0.20/0.42 cnf(i_0_1, negated_conjecture, (~greater(vd390,vd391))). % 0.20/0.42 cnf(i_0_2, plain, (~leq(vd390,vd391))). % 0.20/0.42 cnf(i_0_34, plain, (~greater(X1,X1))). % 0.20/0.42 cnf(i_0_55, plain, (vplus(X1,v1)!=v1)). % 0.20/0.42 cnf(i_0_44, plain, (vplus(X1,X2)!=X2)). % 0.20/0.42 cnf(i_0_52, plain, (vplus(X1,v1)!=X1)). % 0.20/0.42 cnf(i_0_32, plain, (~less(X1,X1))). % 0.20/0.42 cnf(i_0_40, plain, (vplus(X1,X2)!=X1)). % 0.20/0.42 cnf(i_0_33, plain, (~less(X1,X2)|~greater(X1,X2))). % 0.20/0.42 cnf(i_0_29, plain, (greater(X1,X2)|~less(X2,X1))). % 0.20/0.42 cnf(i_0_21, plain, (geq(X1,X2)|~leq(X2,X1))). % 0.20/0.42 cnf(i_0_30, plain, (less(X1,X2)|~greater(X2,X1))). % 0.20/0.42 cnf(i_0_27, plain, (geq(X1,X2)|~greater(X1,X2))). % 0.20/0.42 cnf(i_0_22, plain, (leq(X1,X2)|~geq(X2,X1))). % 0.20/0.42 cnf(i_0_24, plain, (leq(X1,X2)|~less(X1,X2))). % 0.20/0.42 cnf(i_0_11, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))). % 0.20/0.42 cnf(i_0_43, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))). % 0.20/0.42 cnf(i_0_28, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))). % 0.20/0.42 cnf(i_0_51, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)). % 0.20/0.42 cnf(i_0_31, plain, (X1=X2|less(X1,X2)|greater(X1,X2))). % 0.20/0.42 cnf(i_0_25, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.20/0.42 cnf(i_0_4, plain, (geq(X1,vplus(X2,v1))|~greater(X1,X2))). % 0.20/0.42 cnf(i_0_12, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))). % 0.20/0.42 cnf(i_0_38, plain, (vplus(X1,esk2_2(X1,X2))=X2|~greater(X2,X1))). % 0.20/0.42 cnf(i_0_10, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))). % 0.20/0.42 cnf(i_0_36, plain, (vplus(X1,esk1_2(X2,X1))=X2|~less(X1,X2))). % 0.20/0.42 cnf(i_0_17, plain, (leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2))). % 0.20/0.42 cnf(i_0_19, plain, (less(X1,X2)|~less(X3,X2)|~leq(X1,X3))). % 0.20/0.42 cnf(i_0_18, plain, (less(X1,X2)|~less(X1,X3)|~leq(X3,X2))). % 0.20/0.42 cnf(i_0_20, plain, (less(X1,X2)|~less(X1,X3)|~less(X3,X2))). % 0.20/0.42 cnf(i_0_15, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))). % 0.20/0.42 cnf(i_0_9, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~greater(X1,X3)|~greater(X2,X4))). % 0.20/0.42 cnf(i_0_13, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))). % 0.20/0.42 cnf(i_0_7, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X2,X4)|~greater(X1,X3))). % 0.20/0.42 cnf(i_0_8, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X1,X3)|~greater(X2,X4))). % 0.20/0.42 cnf(i_0_6, plain, (geq(vplus(X1,X2),vplus(X3,X4))|~geq(X1,X3)|~geq(X2,X4))). % 0.20/0.42 cnf(i_0_39, plain, (vplus(X1,esk3_2(X2,X1))=X2|vplus(X2,esk4_2(X2,X1))=X1|X2=X1)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 4 steps % 0.20/0.42 cnf(i_0_1, negated_conjecture, (~greater(vd390,vd391)), inference(start_rule)). % 0.20/0.42 cnf(i_0_65, plain, (~greater(vd390,vd391)), inference(extension_rule, [i_0_12])). % 0.20/0.42 cnf(i_0_98, plain, (~greater(vplus(vd390,X5),vplus(vd391,X5))), inference(extension_rule, [i_0_29])). % 0.20/0.42 cnf(i_0_139, plain, (~less(vplus(vd391,X5),vplus(vd390,X5))), inference(etableau_closure_rule, [i_0_139, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.20/0.42 # We now have 4 tableaux to operate on % 0.20/0.42 # Found closed tableau during pool population. % 0.20/0.42 # Proof search is over... % 0.20/0.42 # Freeing feature tree %------------------------------------------------------------------------------