TSTP Solution File: MGT050-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT050-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:49 EDT 2023
% Result : Unsatisfiable 0.22s 0.57s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 15 unt; 6 nHn; 35 RR)
% Number of literals : 94 ( 13 equ; 45 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 : 63 ( 15 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/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',assumption_5_46) ).
cnf(assumption_10_50,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.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/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',assumption_12_52) ).
cnf(theorem_3_55,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',theorem_3_55) ).
cnf(theorem_3_53,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',theorem_3_53) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',definition_smaller_or_equal_3) ).
cnf(definition_smaller_7,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',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/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.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/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',assumption_6_49) ).
cnf(assumption_11_51,axiom,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',assumption_11_51) ).
cnf(definition_greater_or_equal_6,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',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/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',theorem_3_56) ).
cnf(assumption_1_41,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',assumption_1_41) ).
cnf(theorem_3_54,negated_conjecture,
~ has_endowment(sk1),
file('/export/starexec/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p',theorem_3_54) ).
cnf(c_0_14,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)) ),
assumption_5_46 ).
cnf(c_0_15,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
assumption_10_50 ).
cnf(c_0_16,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
assumption_12_52 ).
cnf(c_0_17,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
theorem_3_55 ).
cnf(c_0_18,negated_conjecture,
organization(sk1),
theorem_3_53 ).
cnf(c_0_19,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_14,c_0_15]) ).
cnf(c_0_20,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_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
definition_smaller_or_equal_3 ).
cnf(c_0_22,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_19,c_0_20]),c_0_18])]) ).
cnf(c_0_23,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
definition_smaller_7 ).
cnf(c_0_25,negated_conjecture,
smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,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)) ),
assumption_4_42 ).
cnf(c_0_27,negated_conjecture,
greater(capability(sk1,sk2),capability(sk1,sk3)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1)
| external_ties(X1,X2) != external_ties(X1,X3) ),
assumption_6_49 ).
cnf(c_0_29,axiom,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
assumption_11_51 ).
cnf(c_0_30,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_26,c_0_27]),c_0_18])]) ).
cnf(c_0_31,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1) ),
inference(csr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
definition_greater_or_equal_6 ).
cnf(c_0_33,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_30,c_0_31]),c_0_18])]) ).
cnf(c_0_34,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_35,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_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
theorem_3_56 ).
cnf(c_0_37,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
assumption_1_41 ).
cnf(c_0_38,negated_conjecture,
( has_immunity(sk1,sk2)
| has_immunity(sk1,sk3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_35]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ has_endowment(sk1),
theorem_3_54 ).
cnf(c_0_40,negated_conjecture,
has_immunity(sk1,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18])]),c_0_39]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_18])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT050-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 00:35:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.zzAYaYE9vM/E---3.1_5949.p
% 0.22/0.57 # Version: 3.1pre001
% 0.22/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57 # Starting sh5l with 300s (1) cores
% 0.22/0.57 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6123 completed with status 0
% 0.22/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.57 # No SInE strategy applied
% 0.22/0.57 # Search class: FGHSF-FFMF22-SFFFFFNN
% 0.22/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.57 # Starting sh5l with 136s (1) cores
% 0.22/0.57 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6128 completed with status 0
% 0.22/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.57 # No SInE strategy applied
% 0.22/0.57 # Search class: FGHSF-FFMF22-SFFFFFNN
% 0.22/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.57 # Preprocessing time : 0.001 s
% 0.22/0.57 # Presaturation interreduction done
% 0.22/0.57
% 0.22/0.57 # Proof found!
% 0.22/0.57 # SZS status Unsatisfiable
% 0.22/0.57 # SZS output start CNFRefutation
% See solution above
% 0.22/0.57 # Parsed axioms : 27
% 0.22/0.57 # Removed by relevancy pruning/SinE : 0
% 0.22/0.57 # Initial clauses : 27
% 0.22/0.57 # Removed in clause preprocessing : 0
% 0.22/0.57 # Initial clauses in saturation : 27
% 0.22/0.57 # Processed clauses : 320
% 0.22/0.57 # ...of these trivial : 0
% 0.22/0.57 # ...subsumed : 114
% 0.22/0.57 # ...remaining for further processing : 206
% 0.22/0.57 # Other redundant clauses eliminated : 2
% 0.22/0.57 # Clauses deleted for lack of memory : 0
% 0.22/0.57 # Backward-subsumed : 20
% 0.22/0.57 # Backward-rewritten : 2
% 0.22/0.57 # Generated clauses : 1823
% 0.22/0.57 # ...of the previous two non-redundant : 1534
% 0.22/0.57 # ...aggressively subsumed : 0
% 0.22/0.57 # Contextual simplify-reflections : 3
% 0.22/0.57 # Paramodulations : 1803
% 0.22/0.57 # Factorizations : 16
% 0.22/0.57 # NegExts : 0
% 0.22/0.57 # Equation resolutions : 4
% 0.22/0.57 # Total rewrite steps : 324
% 0.22/0.57 # Propositional unsat checks : 0
% 0.22/0.57 # Propositional check models : 0
% 0.22/0.57 # Propositional check unsatisfiable : 0
% 0.22/0.57 # Propositional clauses : 0
% 0.22/0.57 # Propositional clauses after purity: 0
% 0.22/0.57 # Propositional unsat core size : 0
% 0.22/0.57 # Propositional preprocessing time : 0.000
% 0.22/0.57 # Propositional encoding time : 0.000
% 0.22/0.57 # Propositional solver time : 0.000
% 0.22/0.57 # Success case prop preproc time : 0.000
% 0.22/0.57 # Success case prop encoding time : 0.000
% 0.22/0.57 # Success case prop solver time : 0.000
% 0.22/0.57 # Current number of processed clauses : 155
% 0.22/0.57 # Positive orientable unit clauses : 8
% 0.22/0.57 # Positive unorientable unit clauses: 0
% 0.22/0.57 # Negative unit clauses : 5
% 0.22/0.57 # Non-unit-clauses : 142
% 0.22/0.57 # Current number of unprocessed clauses: 1228
% 0.22/0.57 # ...number of literals in the above : 7802
% 0.22/0.57 # Current number of archived formulas : 0
% 0.22/0.57 # Current number of archived clauses : 49
% 0.22/0.57 # Clause-clause subsumption calls (NU) : 10420
% 0.22/0.57 # Rec. Clause-clause subsumption calls : 4719
% 0.22/0.57 # Non-unit clause-clause subsumptions : 133
% 0.22/0.57 # Unit Clause-clause subsumption calls : 2
% 0.22/0.57 # Rewrite failures with RHS unbound : 0
% 0.22/0.57 # BW rewrite match attempts : 2
% 0.22/0.57 # BW rewrite match successes : 2
% 0.22/0.57 # Condensation attempts : 0
% 0.22/0.57 # Condensation successes : 0
% 0.22/0.57 # Termbank termtop insertions : 39793
% 0.22/0.57
% 0.22/0.57 # -------------------------------------------------
% 0.22/0.57 # User time : 0.058 s
% 0.22/0.57 # System time : 0.003 s
% 0.22/0.57 # Total time : 0.062 s
% 0.22/0.57 # Maximum resident set size: 1660 pages
% 0.22/0.57
% 0.22/0.57 # -------------------------------------------------
% 0.22/0.57 # User time : 0.297 s
% 0.22/0.57 # System time : 0.009 s
% 0.22/0.57 # Total time : 0.306 s
% 0.22/0.57 # Maximum resident set size: 1692 pages
% 0.22/0.57 % E---3.1 exiting
% 0.22/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------