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