TSTP Solution File: MGT009-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT009-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:58 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 28 unt; 0 nHn; 43 RR)
% Number of literals : 117 ( 0 equ; 76 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a5_FOL_4,hypothesis,
( greater(X9,X8)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X4)
| ~ size(X1,X6,X2)
| ~ size(X3,X7,X4)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X4)
| ~ greater(X7,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',a5_FOL_4) ).
cnf(t9_FOL_14,negated_conjecture,
size(sk3,sk8,sk10),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_14) ).
cnf(t9_FOL_6,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_6) ).
cnf(t9_FOL_15,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_15) ).
cnf(t9_FOL_13,negated_conjecture,
size(sk2,sk7,sk9),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_13) ).
cnf(t9_FOL_5,negated_conjecture,
organization(sk2,sk9),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_5) ).
cnf(t9_FOL_10,negated_conjecture,
class(sk3,sk4,sk10),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_10) ).
cnf(t9_FOL_9,negated_conjecture,
class(sk2,sk4,sk9),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_9) ).
cnf(mp5_1,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',mp5_1) ).
cnf(a3_FOL_3,hypothesis,
( greater(X6,X5)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reproducibility(X3,X6,X4)
| ~ inertia(X1,X7,X2)
| ~ inertia(X3,X8,X4)
| ~ greater(X8,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',a3_FOL_3) ).
cnf(t9_FOL_12,negated_conjecture,
reproducibility(sk3,sk6,sk10),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_12) ).
cnf(t9_FOL_8,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_8) ).
cnf(t9_FOL_7,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_7) ).
cnf(t9_FOL_11,negated_conjecture,
reproducibility(sk2,sk5,sk9),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_11) ).
cnf(t9_FOL_16,negated_conjecture,
~ greater(sk6,sk5),
file('/export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p',t9_FOL_16) ).
cnf(c_0_15,hypothesis,
( greater(X9,X8)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X4)
| ~ size(X1,X6,X2)
| ~ size(X3,X7,X4)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X4)
| ~ greater(X7,X6) ),
a5_FOL_4 ).
cnf(c_0_16,negated_conjecture,
size(sk3,sk8,sk10),
t9_FOL_14 ).
cnf(c_0_17,negated_conjecture,
organization(sk3,sk10),
t9_FOL_6 ).
cnf(c_0_18,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(sk3,X6,sk10)
| ~ class(X3,X6,X5)
| ~ greater(sk8,X4)
| ~ inertia(sk3,X1,sk10)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_19,negated_conjecture,
greater(sk8,sk7),
t9_FOL_15 ).
cnf(c_0_20,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,sk7,X4)
| ~ class(sk3,X5,sk10)
| ~ class(X3,X5,X4)
| ~ inertia(sk3,X1,sk10)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
size(sk2,sk7,sk9),
t9_FOL_13 ).
cnf(c_0_22,negated_conjecture,
organization(sk2,sk9),
t9_FOL_5 ).
cnf(c_0_23,negated_conjecture,
( greater(X1,X2)
| ~ class(sk3,X3,sk10)
| ~ class(sk2,X3,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ inertia(sk2,X2,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_24,negated_conjecture,
class(sk3,sk4,sk10),
t9_FOL_10 ).
cnf(c_0_25,negated_conjecture,
class(sk2,sk4,sk9),
t9_FOL_9 ).
cnf(c_0_26,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp5_1 ).
cnf(c_0_27,hypothesis,
( greater(X6,X5)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reproducibility(X3,X6,X4)
| ~ inertia(X1,X7,X2)
| ~ inertia(X3,X8,X4)
| ~ greater(X8,X7) ),
a3_FOL_3 ).
cnf(c_0_28,negated_conjecture,
reproducibility(sk3,sk6,sk10),
t9_FOL_12 ).
cnf(c_0_29,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
t9_FOL_8 ).
cnf(c_0_30,negated_conjecture,
( greater(X1,X2)
| ~ inertia(sk3,X1,sk10)
| ~ inertia(sk2,X2,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
inertia(sk3,sk1(sk10,sk3),sk10),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( greater(sk6,X1)
| ~ greater(X2,X3)
| ~ reproducibility(X4,X1,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(sk3,X2,sk10)
| ~ inertia(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_17])]) ).
cnf(c_0_33,negated_conjecture,
( greater(sk1(sk10,sk3),X1)
| ~ inertia(sk2,X1,sk9) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
inertia(sk2,sk1(sk9,sk2),sk9),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( greater(sk6,X1)
| ~ greater(sk1(sk10,sk3),X2)
| ~ reproducibility(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
greater(sk1(sk10,sk3),sk1(sk9,sk2)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( greater(sk6,X1)
| ~ reproducibility(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,sk1(sk9,sk2),X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
t9_FOL_7 ).
cnf(c_0_39,negated_conjecture,
( greater(sk6,X1)
| ~ reproducibility(sk2,X1,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_38]),c_0_22])]) ).
cnf(c_0_40,negated_conjecture,
reproducibility(sk2,sk5,sk9),
t9_FOL_11 ).
cnf(c_0_41,negated_conjecture,
~ greater(sk6,sk5),
t9_FOL_16 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT009-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 00:25:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.uT0pn8qQAS/E---3.1_5885.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6007 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FHUNF-FFSM22-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--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6012 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FHUNF-FFSM22-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--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (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 : 16
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 16
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 16
% 0.21/0.50 # Processed clauses : 48
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 48
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 1
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 18
% 0.21/0.50 # ...of the previous two non-redundant : 17
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 18
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 14
% 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 : 31
% 0.21/0.50 # Positive orientable unit clauses : 14
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 16
% 0.21/0.50 # Current number of unprocessed clauses: 1
% 0.21/0.50 # ...number of literals in the above : 8
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 17
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 170
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 5
% 0.21/0.50 # Non-unit clause-clause subsumptions : 1
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1109
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1660 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.028 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.032 s
% 0.21/0.50 # Maximum resident set size: 1688 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------