TSTP Solution File: MGT048-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT048-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:37:14 EDT 2023
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 37 ( 5 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_10_35,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',assumption_10_35) ).
cnf(lemma_5_37,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',lemma_5_37) ).
cnf(assumption_5_33,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/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',assumption_5_33) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',definition_smaller_or_equal_3) ).
cnf(assumption_12_36,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',assumption_12_36) ).
cnf(lemma_5_38,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',lemma_5_38) ).
cnf(lemma_5_39,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p',lemma_5_39) ).
cnf(c_0_7,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
assumption_10_35 ).
cnf(c_0_8,negated_conjecture,
organization(sk1),
lemma_5_37 ).
cnf(c_0_9,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_33 ).
cnf(c_0_10,negated_conjecture,
stock_of_knowledge(sk1,X1) = stock_of_knowledge(sk1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
definition_smaller_or_equal_3 ).
cnf(c_0_12,negated_conjecture,
( smaller(capability(sk1,X1),capability(sk1,X2))
| ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,X3),stock_of_knowledge(sk1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).
cnf(c_0_13,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_14,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
assumption_12_36 ).
cnf(c_0_15,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
lemma_5_38 ).
cnf(c_0_16,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
lemma_5_39 ).
cnf(c_0_17,negated_conjecture,
( smaller(capability(sk1,X1),capability(sk1,X2))
| ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,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_14,c_0_15]),c_0_8])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT048-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 00:43:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.50 Running first-order model finding
% 0.19/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.sTa1zV0uZ9/E---3.1_22929.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # sh5l with pid 23032 completed with status 0
% 0.19/0.52 # Result found by sh5l
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.52 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 23036 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.52 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 19
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 19
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 19
% 0.19/0.52 # Processed clauses : 128
% 0.19/0.52 # ...of these trivial : 0
% 0.19/0.52 # ...subsumed : 43
% 0.19/0.52 # ...remaining for further processing : 85
% 0.19/0.52 # Other redundant clauses eliminated : 2
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 3
% 0.19/0.52 # Backward-rewritten : 0
% 0.19/0.52 # Generated clauses : 162
% 0.19/0.52 # ...of the previous two non-redundant : 148
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 2
% 0.19/0.52 # Paramodulations : 157
% 0.19/0.52 # Factorizations : 2
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 3
% 0.19/0.52 # Total rewrite steps : 27
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 61
% 0.19/0.52 # Positive orientable unit clauses : 5
% 0.19/0.52 # Positive unorientable unit clauses: 1
% 0.19/0.52 # Negative unit clauses : 6
% 0.19/0.52 # Non-unit-clauses : 49
% 0.19/0.52 # Current number of unprocessed clauses: 53
% 0.19/0.52 # ...number of literals in the above : 224
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 22
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 1173
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 789
% 0.19/0.52 # Non-unit clause-clause subsumptions : 26
% 0.19/0.52 # Unit Clause-clause subsumption calls : 4
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 0
% 0.19/0.52 # BW rewrite match successes : 0
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 3018
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.006 s
% 0.19/0.52 # System time : 0.004 s
% 0.19/0.52 # Total time : 0.010 s
% 0.19/0.52 # Maximum resident set size: 1616 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.006 s
% 0.19/0.52 # System time : 0.007 s
% 0.19/0.52 # Total time : 0.013 s
% 0.19/0.52 # Maximum resident set size: 1684 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------