%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM861+1 : 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 : n018.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:17 EDT 2022 % Result : Theorem 6.18s 1.12s % Output : CNFRefutation 6.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : NUM861+1 : TPTP v8.1.0. Released v4.1.0. % 0.11/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.32 % Computer : n018.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Thu Jul 7 23:20:25 EDT 2022 % 0.11/0.32 % CPUTime : % 0.17/0.33 # No SInE strategy applied % 0.17/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN % 0.17/0.33 # and selection function SelectComplexExceptUniqMaxHorn. % 0.17/0.33 # % 0.17/0.33 # Presaturation interreduction done % 0.17/0.33 # Number of axioms: 28 Number of unprocessed: 28 % 0.17/0.33 # Tableaux proof search. % 0.17/0.33 # APR header successfully linked. % 0.17/0.33 # Hello from C++ % 0.17/0.33 # The folding up rule is enabled... % 0.17/0.33 # Local unification is enabled... % 0.17/0.33 # Any saturation attempts will use folding labels... % 0.17/0.33 # 28 beginning clauses after preprocessing and clausification % 0.17/0.33 # Creating start rules for all 2 conjectures. % 0.17/0.33 # There are 2 start rule candidates: % 0.17/0.33 # Found 1 unit axioms. % 0.17/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.17/0.33 # 2 start rule tableaux created. % 0.17/0.33 # 27 extension rule candidate clauses % 0.17/0.33 # 1 unit axiom clauses % 0.17/0.33 % 0.17/0.33 # Requested 8, 32 cores available to the main process. % 0.17/0.33 # There are not enough tableaux to fork, creating more from the initial 2 % 0.17/0.33 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.17/0.33 # We now have 8 tableaux to operate on % 6.18/1.12 # There were 3 total branch saturation attempts. % 6.18/1.12 # There were 0 of these attempts blocked. % 6.18/1.12 # There were 0 deferred branch saturation attempts. % 6.18/1.12 # There were 0 free duplicated saturations. % 6.18/1.12 # There were 3 total successful branch saturations. % 6.18/1.12 # There were 0 successful branch saturations in interreduction. % 6.18/1.12 # There were 0 successful branch saturations on the branch. % 6.18/1.12 # There were 3 successful branch saturations after the branch. % 6.18/1.12 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.18/1.12 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.18/1.12 # Begin clausification derivation % 6.18/1.12 % 6.18/1.12 # End clausification derivation % 6.18/1.12 # Begin listing active clauses obtained from FOF to CNF conversion % 6.18/1.12 cnf(i_0_1, plain, (lesseq(X1,X1))). % 6.18/1.12 cnf(i_0_28, negated_conjecture, (~minsol_model_ub(esk4_0,esk5_0,esk6_0)|~minsol_model_max(esk4_0,esk5_0,esk6_0))). % 6.18/1.12 cnf(i_0_27, negated_conjecture, (minsol_model_ub(esk4_0,esk5_0,esk6_0)|minsol_model_max(esk4_0,esk5_0,esk6_0))). % 6.18/1.12 cnf(i_0_12, plain, (lesseq(X1,X2)|~ub(X3,X1,X2))). % 6.18/1.12 cnf(i_0_13, plain, (lesseq(X1,X2)|~ub(X1,X3,X2))). % 6.18/1.12 cnf(i_0_4, plain, (lesseq(X1,X2)|lesseq(X2,X1))). % 6.18/1.12 cnf(i_0_10, plain, (max(X1,X2)=X2|~lesseq(X1,X2))). % 6.18/1.12 cnf(i_0_22, plain, (model_max(X1,X2,X3)|~minsol_model_max(X1,X2,X3))). % 6.18/1.12 cnf(i_0_26, plain, (model_ub(X1,X2,X3)|~minsol_model_ub(X1,X2,X3))). % 6.18/1.12 cnf(i_0_3, plain, (X1=X2|~lesseq(X2,X1)|~lesseq(X1,X2))). % 6.18/1.12 cnf(i_0_7, plain, (lesseq(X1,X2)|~lesseq(summation(X1),summation(X2)))). % 6.18/1.12 cnf(i_0_9, plain, (max(X1,X2)=X1|~lesseq(X2,X1))). % 6.18/1.12 cnf(i_0_8, plain, (lesseq(summation(X1),summation(X2))|~lesseq(X1,X2))). % 6.18/1.12 cnf(i_0_5, plain, (lesseq(X1,X2)|~lesseq(sum(X3,X1),sum(X3,X2)))). % 6.18/1.12 cnf(i_0_11, plain, (ub(X1,X2,X3)|~lesseq(X2,X3)|~lesseq(X1,X3))). % 6.18/1.12 cnf(i_0_2, plain, (lesseq(X1,X2)|~lesseq(X3,X2)|~lesseq(X1,X3))). % 6.18/1.12 cnf(i_0_6, plain, (lesseq(sum(X1,X2),sum(X1,X3))|~lesseq(X2,X3))). % 6.18/1.12 cnf(i_0_15, plain, (lesseq(sum(c,max(X1,X2)),X3)|~model_max(X1,X2,X3))). % 6.18/1.12 cnf(i_0_14, plain, (model_max(X1,X2,X3)|~lesseq(sum(c,max(X1,X2)),X3))). % 6.18/1.12 cnf(i_0_21, plain, (lesseq(X1,X2)|~minsol_model_max(X3,X4,X1)|~model_max(X3,X4,X2))). % 6.18/1.12 cnf(i_0_25, plain, (lesseq(X1,X2)|~minsol_model_ub(X3,X4,X1)|~model_ub(X3,X4,X2))). % 6.18/1.12 cnf(i_0_19, plain, (minsol_model_max(X1,X2,X3)|~model_max(X1,X2,X3)|~lesseq(X3,esk2_3(X1,X2,X3)))). % 6.18/1.12 cnf(i_0_18, plain, (ub(X1,X2,esk1_3(X1,X2,X3))|~model_ub(X1,X2,X3))). % 6.18/1.12 cnf(i_0_23, plain, (minsol_model_ub(X1,X2,X3)|~model_ub(X1,X2,X3)|~lesseq(X3,esk3_3(X1,X2,X3)))). % 6.18/1.12 cnf(i_0_17, plain, (lesseq(sum(c,esk1_3(X1,X2,X3)),X3)|~model_ub(X1,X2,X3))). % 6.18/1.12 cnf(i_0_16, plain, (model_ub(X1,X2,X3)|~ub(X1,X2,X4)|~lesseq(sum(c,X4),X3))). % 6.18/1.12 cnf(i_0_20, plain, (minsol_model_max(X1,X2,X3)|model_max(X1,X2,esk2_3(X1,X2,X3))|~model_max(X1,X2,X3))). % 6.18/1.12 cnf(i_0_24, plain, (minsol_model_ub(X1,X2,X3)|model_ub(X1,X2,esk3_3(X1,X2,X3))|~model_ub(X1,X2,X3))). % 6.18/1.12 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.18/1.12 # Begin printing tableau % 6.18/1.12 # Found 6 steps % 6.18/1.12 cnf(i_0_28, negated_conjecture, (~minsol_model_ub(esk4_0,esk5_0,esk6_0)|~minsol_model_max(esk4_0,esk5_0,esk6_0)), inference(start_rule)). % 6.18/1.12 cnf(i_0_32, plain, (~minsol_model_max(esk4_0,esk5_0,esk6_0)), inference(extension_rule, [i_0_20])). % 6.18/1.12 cnf(i_0_280, plain, (model_max(esk4_0,esk5_0,esk2_3(esk4_0,esk5_0,esk6_0))), inference(extension_rule, [i_0_15])). % 6.18/1.12 cnf(i_0_31, plain, (~minsol_model_ub(esk4_0,esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_31, ...])). % 6.18/1.12 cnf(i_0_281, plain, (~model_max(esk4_0,esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_281, ...])). % 6.18/1.12 cnf(i_0_320, plain, (lesseq(sum(c,max(esk4_0,esk5_0)),esk2_3(esk4_0,esk5_0,esk6_0))), inference(etableau_closure_rule, [i_0_320, ...])). % 6.18/1.12 # End printing tableau % 6.18/1.12 # SZS output end % 6.18/1.12 # Branches closed with saturation will be marked with an "s" % 6.18/1.13 # Child (25401) has found a proof. % 6.18/1.13 % 6.18/1.13 # Proof search is over... % 6.18/1.13 # Freeing feature tree %------------------------------------------------------------------------------