0.00/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % 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 : n016.cluster.edu 0.11/0.32 Model : x86_64 x86_64 0.11/0.32 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 RAMPerCPU : 8042.1875MB 0.11/0.32 OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Tue Aug 9 02:30:27 EDT 2022 0.11/0.32 % CPUTime : 0.18/0.38 # No SInE strategy applied 0.18/0.38 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.18/0.38 # and selection function SelectComplexExceptUniqMaxHorn. 0.18/0.38 # 0.18/0.38 # Presaturation interreduction done 0.18/0.38 # Number of axioms: 38 Number of unprocessed: 27 0.18/0.38 # Tableaux proof search. 0.18/0.38 # APR header successfully linked. 0.18/0.38 # Hello from C++ 0.18/0.38 # The folding up rule is enabled... 0.18/0.38 # Local unification is enabled... 0.18/0.38 # Any saturation attempts will use folding labels... 0.18/0.38 # 27 beginning clauses after preprocessing and clausification 0.18/0.38 # Creating start rules for all 8 conjectures. 0.18/0.38 # There are 8 start rule candidates: 0.18/0.38 # Found 9 unit axioms. 0.18/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.18/0.38 # 8 start rule tableaux created. 0.18/0.38 # 18 extension rule candidate clauses 0.18/0.38 # 9 unit axiom clauses 0.18/0.38 0.18/0.38 # Requested 8, 32 cores available to the main process. 21.67/3.11 # There were 3 total branch saturation attempts. 21.67/3.11 # There were 0 of these attempts blocked. 21.67/3.11 # There were 0 deferred branch saturation attempts. 21.67/3.11 # There were 0 free duplicated saturations. 21.67/3.11 # There were 3 total successful branch saturations. 21.67/3.11 # There were 0 successful branch saturations in interreduction. 21.67/3.11 # There were 0 successful branch saturations on the branch. 21.67/3.11 # There were 3 successful branch saturations after the branch. 21.67/3.11 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 21.67/3.11 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 21.67/3.11 # Begin clausification derivation 21.67/3.11 21.67/3.11 # End clausification derivation 21.67/3.11 # Begin listing active clauses obtained from FOF to CNF conversion 21.67/3.11 cnf(i_0_31, negated_conjecture, (organization(esk1_0))). 21.67/3.11 cnf(i_0_20, negated_conjecture, (smaller_or_equal(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)))). 21.67/3.11 cnf(i_0_2, plain, (smaller_or_equal(X1,X1))). 21.67/3.11 cnf(i_0_8, plain, (greater_or_equal(X1,X1))). 21.67/3.11 cnf(i_0_30, negated_conjecture, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)))). 21.67/3.11 cnf(i_0_25, negated_conjecture, (greater_or_equal(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0)))). 21.67/3.11 cnf(i_0_32, negated_conjecture, (~has_immunity(esk1_0,esk2_0))). 21.67/3.11 cnf(i_0_33, negated_conjecture, (~has_immunity(esk1_0,esk3_0))). 21.67/3.11 cnf(i_0_15, negated_conjecture, (~smaller(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))). 21.67/3.11 cnf(i_0_6, plain, (~greater(X1,X2)|~greater(X2,X1))). 21.67/3.11 cnf(i_0_4, plain, (greater(X1,X2)|~smaller(X2,X1))). 21.67/3.11 cnf(i_0_5, plain, (smaller(X1,X2)|~greater(X2,X1))). 21.67/3.11 cnf(i_0_3, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). 21.67/3.11 cnf(i_0_9, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). 21.67/3.11 cnf(i_0_1, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). 21.67/3.11 cnf(i_0_7, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). 21.67/3.11 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). 21.67/3.11 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). 21.67/3.11 cnf(i_0_35, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))). 21.67/3.11 cnf(i_0_34, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))). 21.67/3.11 cnf(i_0_13, plain, (capability(X1,X2)=capability(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|~organization(X1))). 21.67/3.11 cnf(i_0_26, negated_conjecture, (greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)))). 21.67/3.11 cnf(i_0_12, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). 21.67/3.11 cnf(i_0_14, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). 21.67/3.11 cnf(i_0_38, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~organization(X1)|~greater_or_equal(position(X1,X2),position(X1,X3))|~greater(capability(X1,X2),capability(X1,X3)))). 21.67/3.11 cnf(i_0_36, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~organization(X1)|~greater_or_equal(capability(X1,X2),capability(X1,X3))|~greater(position(X1,X2),position(X1,X3)))). 21.67/3.11 cnf(i_0_37, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|has_immunity(X1,X2)|has_immunity(X1,X3)|capability(X1,X2)!=capability(X1,X3)|position(X1,X2)!=position(X1,X3)|~organization(X1))). 21.67/3.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 21.67/3.11 # Begin printing tableau 21.67/3.11 # Found 7 steps 21.67/3.11 cnf(i_0_30, negated_conjecture, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(start_rule)). 21.67/3.11 cnf(i_0_47, plain, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(extension_rule, [i_0_7])). 21.67/3.11 cnf(i_0_63, plain, (stock_of_knowledge(esk1_0,esk3_0)=stock_of_knowledge(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). 21.67/3.11 cnf(i_0_94, plain, (~organization(esk1_0)), inference(closure_rule, [i_0_31])). 21.67/3.11 cnf(i_0_64, plain, (greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_64, ...])). 21.67/3.11 cnf(i_0_91, plain, (capability(esk1_0,esk2_0)=capability(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_91, ...])). 21.67/3.11 cnf(i_0_92, plain, (internal_friction(esk1_0,esk2_0)!=internal_friction(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_92, ...])). 21.67/3.11 # End printing tableau 21.67/3.11 # SZS output end 21.67/3.11 # Branches closed with saturation will be marked with an "s" 21.92/3.12 # Child (14807) has found a proof. 21.92/3.12 21.92/3.12 # Proof search is over... 21.92/3.12 # Freeing feature tree 21.92/3.14 EOF