TSTP Solution File: MGT050-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT050-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 300s
% DateTime : Tue May 21 00:39:45 EDT 2024
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 54 ( 17 unt; 7 nHn; 45 RR)
% Number of literals : 125 ( 19 equ; 64 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_5_46,axiom,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5_46) ).
cnf(assumption_10_50,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_10_50) ).
cnf(assumption_12_52,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_12_52) ).
cnf(theorem_3_55,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_3_55) ).
cnf(theorem_3_53,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_3_53) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(definition_smaller_7,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_7) ).
cnf(assumption_4_42,axiom,
( 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)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_4_42) ).
cnf(assumption_6_49,axiom,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1)
| external_ties(X1,X2) != external_ties(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_6_49) ).
cnf(assumption_11_51,axiom,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_11_51) ).
cnf(definition_greater_or_equal_6,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_greater_or_equal_6) ).
cnf(theorem_3_56,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_3_56) ).
cnf(assumption_1_41,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_1_41) ).
cnf(theorem_3_54,negated_conjecture,
~ has_endowment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_3_54) ).
cnf(c_0_14,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_5_46]) ).
cnf(c_0_15,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
inference(fof_simplification,[status(thm)],[assumption_10_50]) ).
cnf(c_0_16,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_12_52]) ).
cnf(c_0_17,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
c_0_14 ).
cnf(c_0_18,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
c_0_15 ).
cnf(c_0_19,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
theorem_3_55 ).
cnf(c_0_21,negated_conjecture,
organization(sk1),
theorem_3_53 ).
cnf(c_0_22,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_23,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,X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
c_0_22 ).
cnf(c_0_26,plain,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_7]) ).
cnf(c_0_27,negated_conjecture,
( smaller(capability(sk1,sk3),capability(sk1,sk2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_28,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_29,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)) ),
inference(fof_simplification,[status(thm)],[assumption_4_42]) ).
cnf(c_0_30,plain,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1)
| external_ties(X1,X2) != external_ties(X1,X3) ),
inference(fof_simplification,[status(thm)],[assumption_6_49]) ).
cnf(c_0_33,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
inference(fof_simplification,[status(thm)],[assumption_11_51]) ).
cnf(c_0_34,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)) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
greater(capability(sk1,sk2),capability(sk1,sk3)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1)
| external_ties(X1,X2) != external_ties(X1,X3) ),
c_0_32 ).
cnf(c_0_37,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
c_0_33 ).
cnf(c_0_38,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[definition_greater_or_equal_6]) ).
cnf(c_0_39,negated_conjecture,
( has_immunity(sk1,sk3)
| has_immunity(sk1,sk2)
| smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3))
| ~ greater_or_equal(position(sk1,sk2),position(sk1,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21])]) ).
cnf(c_0_40,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1) ),
inference(csr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
( has_immunity(sk1,sk2)
| has_immunity(sk1,sk3)
| smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3))
| ~ greater_or_equal(position(sk1,sk2),position(sk1,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_21])]) ).
cnf(c_0_43,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
inference(fof_simplification,[status(thm)],[theorem_3_56]) ).
cnf(c_0_45,plain,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_1_41]) ).
cnf(c_0_46,negated_conjecture,
( has_immunity(sk1,sk3)
| has_immunity(sk1,sk2)
| smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
~ has_endowment(sk1),
inference(fof_simplification,[status(thm)],[theorem_3_54]) ).
cnf(c_0_49,plain,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
( has_immunity(sk1,sk2)
| has_immunity(sk1,sk3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_46]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ has_endowment(sk1),
c_0_48 ).
cnf(c_0_52,negated_conjecture,
has_immunity(sk1,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_21])]),c_0_51]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_52]),c_0_21])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : MGT050-1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 00:00:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.37 Running first-order theorem proving
% 0.14/0.37 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1430 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGHSF-FFMF22-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 # Starting sh5l with 136s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1435 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGHSF-FFMF22-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 27
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 27
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 27
% 0.14/0.41 # Processed clauses : 320
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 114
% 0.14/0.41 # ...remaining for further processing : 206
% 0.14/0.41 # Other redundant clauses eliminated : 2
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 20
% 0.14/0.41 # Backward-rewritten : 2
% 0.14/0.41 # Generated clauses : 1823
% 0.14/0.41 # ...of the previous two non-redundant : 1534
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 3
% 0.14/0.41 # Paramodulations : 1803
% 0.14/0.41 # Factorizations : 16
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 4
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 324
% 0.14/0.41 # ...of those cached : 318
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 155
% 0.14/0.41 # Positive orientable unit clauses : 8
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 5
% 0.14/0.41 # Non-unit-clauses : 142
% 0.14/0.41 # Current number of unprocessed clauses: 1228
% 0.14/0.41 # ...number of literals in the above : 7802
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 49
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 10420
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 4719
% 0.14/0.41 # Non-unit clause-clause subsumptions : 133
% 0.14/0.41 # Unit Clause-clause subsumption calls : 2
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 2
% 0.14/0.41 # BW rewrite match successes : 2
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 39997
% 0.14/0.41 # Search garbage collected termcells : 80
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.032 s
% 0.14/0.41 # System time : 0.006 s
% 0.14/0.41 # Total time : 0.037 s
% 0.14/0.41 # Maximum resident set size: 1668 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.169 s
% 0.14/0.41 # System time : 0.008 s
% 0.14/0.41 # Total time : 0.177 s
% 0.14/0.41 # Maximum resident set size: 1720 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------