TSTP Solution File: MGT047-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT047-1 : TPTP v8.1.0. Released v2.4.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 : n022.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 : Sun Jul 17 22:10:38 EDT 2022
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : MGT047-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 11:37:19 EDT 2022
% 0.13/0.35 % 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_S5PRR_S2m
% 0.13/0.38 # and selection function SelectCQArNTNpEqFirst.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 37 Number of unprocessed: 37
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 37 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 7 conjectures.
% 0.13/0.38 # There are 7 start rule candidates:
% 0.13/0.38 # Found 8 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 7 start rule tableaux created.
% 0.13/0.38 # 29 extension rule candidate clauses
% 0.13/0.38 # 8 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 7
% 0.13/0.38 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 16 tableaux to operate on
% 0.20/0.53 # There were 3 total branch saturation attempts.
% 0.20/0.53 # There were 0 of these attempts blocked.
% 0.20/0.53 # There were 0 deferred branch saturation attempts.
% 0.20/0.53 # There were 0 free duplicated saturations.
% 0.20/0.53 # There were 3 total successful branch saturations.
% 0.20/0.53 # There were 0 successful branch saturations in interreduction.
% 0.20/0.53 # There were 0 successful branch saturations on the branch.
% 0.20/0.53 # There were 3 successful branch saturations after the branch.
% 0.20/0.53 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 # Begin clausification derivation
% 0.20/0.53
% 0.20/0.53 # End clausification derivation
% 0.20/0.53 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.53 cnf(i_0_71, negated_conjecture, (has_endowment(sk2))).
% 0.20/0.53 cnf(i_0_70, negated_conjecture, (organization(sk2))).
% 0.20/0.53 cnf(i_0_73, negated_conjecture, (smaller_or_equal(age(sk2,sk4),eta))).
% 0.20/0.53 cnf(i_0_74, negated_conjecture, (greater(age(sk2,sk5),eta))).
% 0.20/0.53 cnf(i_0_72, negated_conjecture, (smaller_or_equal(age(sk2,sk3),age(sk2,sk4)))).
% 0.20/0.53 cnf(i_0_75, negated_conjecture, (greater(age(sk2,sk6),age(sk2,sk5)))).
% 0.20/0.53 cnf(i_0_41, plain, (smaller_or_equal(X1,X1))).
% 0.20/0.53 cnf(i_0_44, plain, (greater_or_equal(X1,X1))).
% 0.20/0.53 cnf(i_0_50, plain, (organization(X1)|~has_endowment(X1))).
% 0.20/0.53 cnf(i_0_47, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.20/0.53 cnf(i_0_40, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 0.20/0.53 cnf(i_0_45, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 0.20/0.53 cnf(i_0_76, negated_conjecture, (hazard_of_mortality(sk2,sk3)!=hazard_of_mortality(sk2,sk4)|~greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6))|~greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4)))).
% 0.20/0.53 cnf(i_0_52, plain, (~has_immunity(X1,X2)|~has_endowment(X1)|~greater(age(X1,X2),eta))).
% 0.20/0.53 cnf(i_0_49, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 0.20/0.53 cnf(i_0_46, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 0.20/0.53 cnf(i_0_43, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.20/0.53 cnf(i_0_42, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.20/0.53 cnf(i_0_51, plain, (has_immunity(X1,X2)|~has_endowment(X1)|~smaller_or_equal(age(X1,X2),eta))).
% 0.20/0.53 cnf(i_0_39, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 0.20/0.53 cnf(i_0_69, plain, (internal_friction(X1,X2)=internal_friction(X1,X3)|~organization(X1))).
% 0.20/0.53 cnf(i_0_48, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.20/0.53 cnf(i_0_55, plain, (has_endowment(X1)|greater(age(X1,sk1(X1)),eta)|~has_immunity(X1,sk1(X1))|~organization(X1))).
% 0.20/0.53 cnf(i_0_53, plain, (has_endowment(X1)|greater(age(X1,sk1(X1)),eta)|smaller_or_equal(age(X1,sk1(X1)),eta)|~organization(X1))).
% 0.20/0.53 cnf(i_0_54, plain, (has_immunity(X1,sk1(X1))|has_endowment(X1)|smaller_or_equal(age(X1,sk1(X1)),eta)|~organization(X1))).
% 0.20/0.53 cnf(i_0_66, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))).
% 0.20/0.53 cnf(i_0_58, plain, (has_immunity(X1,X2)|greater(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~has_immunity(X1,X3)|~organization(X1))).
% 0.20/0.53 cnf(i_0_65, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))).
% 0.20/0.53 cnf(i_0_57, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|~has_immunity(X1,X3)|~has_immunity(X1,X2)|~organization(X1))).
% 0.20/0.53 cnf(i_0_67, plain, (greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))).
% 0.20/0.53 cnf(i_0_68, plain, (greater(external_ties(X1,X2),external_ties(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))).
% 0.20/0.53 cnf(i_0_64, plain, (capability(X1,X2)=capability(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|~organization(X1))).
% 0.20/0.53 cnf(i_0_62, 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)))).
% 0.20/0.53 cnf(i_0_63, 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)))).
% 0.20/0.53 cnf(i_0_61, 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))).
% 0.20/0.53 cnf(i_0_60, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~organization(X1)|~greater(position(X1,X3),position(X1,X2))|~greater_or_equal(capability(X1,X3),capability(X1,X2)))).
% 0.20/0.53 cnf(i_0_59, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~organization(X1)|~greater(capability(X1,X3),capability(X1,X2))|~greater_or_equal(position(X1,X3),position(X1,X2)))).
% 0.20/0.53 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.53 # Begin printing tableau
% 0.20/0.53 # Found 11 steps
% 0.20/0.53 cnf(i_0_76, negated_conjecture, (hazard_of_mortality(sk2,sk3)!=hazard_of_mortality(sk2,sk4)|~greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6))|~greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4))), inference(start_rule)).
% 0.20/0.53 cnf(i_0_80, plain, (~greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6))), inference(extension_rule, [i_0_58])).
% 0.20/0.53 cnf(i_0_234, plain, (~organization(sk2)), inference(closure_rule, [i_0_70])).
% 0.20/0.53 cnf(i_0_231, plain, (has_immunity(sk2,sk5)), inference(extension_rule, [i_0_52])).
% 0.20/0.53 cnf(i_0_289, plain, (~has_endowment(sk2)), inference(closure_rule, [i_0_71])).
% 0.20/0.53 cnf(i_0_290, plain, (~greater(age(sk2,sk5),eta)), inference(closure_rule, [i_0_74])).
% 0.20/0.53 cnf(i_0_233, plain, (~has_immunity(sk2,sk6)), inference(extension_rule, [i_0_51])).
% 0.20/0.53 cnf(i_0_310, plain, (~has_endowment(sk2)), inference(closure_rule, [i_0_71])).
% 0.20/0.53 cnf(i_0_79, plain, (hazard_of_mortality(sk2,sk3)!=hazard_of_mortality(sk2,sk4)), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.20/0.53 cnf(i_0_81, plain, (~greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4))), inference(etableau_closure_rule, [i_0_81, ...])).
% 0.20/0.53 cnf(i_0_311, plain, (~smaller_or_equal(age(sk2,sk6),eta)), inference(etableau_closure_rule, [i_0_311, ...])).
% 0.20/0.53 # End printing tableau
% 0.20/0.53 # SZS output end
% 0.20/0.53 # Branches closed with saturation will be marked with an "s"
% 0.20/0.54 # Child (24171) has found a proof.
% 0.20/0.54
% 0.20/0.54 # Proof search is over...
% 0.20/0.54 # Freeing feature tree
%------------------------------------------------------------------------------