TSTP Solution File: MGT013-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:34:34 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 28 unt; 4 nHn; 49 RR)
% Number of literals : 115 ( 14 equ; 71 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 60 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t12_FOL_25,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t12_FOL_25) ).
cnf(t13_FOL_29,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_29) ).
cnf(t13_FOL_26,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_26) ).
cnf(mp17_22,axiom,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',mp17_22) ).
cnf(t13_FOL_28,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_28) ).
cnf(mp15_20,axiom,
( time(X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',mp15_20) ).
cnf(t13_FOL_27,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_27) ).
cnf(mp16_21,axiom,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',mp16_21) ).
cnf(t13_FOL_30,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_30) ).
cnf(t13_FOL_33,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_33) ).
cnf(t11_FOL_24,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t11_FOL_24) ).
cnf(t13_FOL_32,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_32) ).
cnf(t13_FOL_31,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_31) ).
cnf(t13_FOL_34,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',t13_FOL_34) ).
cnf(mp18_23,axiom,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| X2 != X3 ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',mp18_23) ).
cnf(mp6_1_18,axiom,
( ~ greater(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.72qpGNgdSp/E---3.1_1974.p',mp6_1_18) ).
cnf(c_0_16,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
t12_FOL_25 ).
cnf(c_0_17,negated_conjecture,
complexity(sk1,sk2,sk6),
t13_FOL_29 ).
cnf(c_0_18,negated_conjecture,
organization(sk1,sk6),
t13_FOL_26 ).
cnf(c_0_19,axiom,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
mp17_22 ).
cnf(c_0_20,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
t13_FOL_28 ).
cnf(c_0_21,axiom,
( time(X2)
| ~ organization(X1,X2) ),
mp15_20 ).
cnf(c_0_22,negated_conjecture,
organization(sk1,sk7),
t13_FOL_27 ).
cnf(c_0_23,negated_conjecture,
( ~ complexity(sk1,X1,X2)
| ~ reorganization_free(sk1,X2,sk6)
| ~ organization(sk1,X2)
| ~ greater(X1,sk2)
| ~ greater(sk6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
reorganization_free(sk1,sk7,sk6),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
mp16_21 ).
cnf(c_0_26,negated_conjecture,
time(sk7),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ complexity(sk1,X1,sk7)
| ~ greater(sk6,sk7)
| ~ greater(X1,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
complexity(sk1,sk3,sk7),
t13_FOL_30 ).
cnf(c_0_29,negated_conjecture,
greater(sk3,sk2),
t13_FOL_33 ).
cnf(c_0_30,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
t11_FOL_24 ).
cnf(c_0_31,negated_conjecture,
size(sk1,sk5,sk7),
t13_FOL_32 ).
cnf(c_0_32,negated_conjecture,
( X1 = sk7
| greater(X1,sk7)
| greater(sk7,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
time(sk6),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
~ greater(sk6,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
( ~ size(sk1,X1,X2)
| ~ reorganization_free(sk1,X2,sk7)
| ~ organization(sk1,X2)
| ~ greater(X1,sk5)
| ~ greater(sk7,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).
cnf(c_0_36,negated_conjecture,
size(sk1,sk4,sk6),
t13_FOL_31 ).
cnf(c_0_37,negated_conjecture,
greater(sk4,sk5),
t13_FOL_34 ).
cnf(c_0_38,axiom,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| X2 != X3 ),
mp18_23 ).
cnf(c_0_39,negated_conjecture,
( sk7 = sk6
| greater(sk7,sk6) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ greater(sk7,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]),c_0_18]),c_0_37])]) ).
cnf(c_0_41,plain,
( X1 = X2
| ~ complexity(X3,X2,X4)
| ~ complexity(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
sk7 = sk6,
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( X1 = sk2
| ~ complexity(sk1,X1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_17]),c_0_18])]) ).
cnf(c_0_44,negated_conjecture,
complexity(sk1,sk3,sk6),
inference(rw,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_45,axiom,
( ~ greater(X1,X2)
| X1 != X2 ),
mp6_1_18 ).
cnf(c_0_46,negated_conjecture,
sk3 = sk2,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 00:20:15 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/tmp/tmp.72qpGNgdSp/E---3.1_1974.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2052 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFSM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 2056 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFSM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 17
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 17
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 17
% 0.21/0.50 # Processed clauses : 62
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 4
% 0.21/0.50 # ...remaining for further processing : 58
% 0.21/0.50 # Other redundant clauses eliminated : 2
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 2
% 0.21/0.50 # Backward-rewritten : 15
% 0.21/0.50 # Generated clauses : 33
% 0.21/0.50 # ...of the previous two non-redundant : 42
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 30
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 2
% 0.21/0.50 # Total rewrite steps : 46
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 21
% 0.21/0.50 # Positive orientable unit clauses : 9
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 10
% 0.21/0.50 # Current number of unprocessed clauses: 13
% 0.21/0.50 # ...number of literals in the above : 42
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 35
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 145
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 54
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 30
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 2
% 0.21/0.50 # BW rewrite match successes : 2
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1002
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1632 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.024 s
% 0.21/0.50 # System time : 0.007 s
% 0.21/0.50 # Total time : 0.030 s
% 0.21/0.50 # Maximum resident set size: 1684 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------