TSTP Solution File: MGT017-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT017-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:38:27 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 31 unt; 0 nHn; 49 RR)
% Number of literals : 161 ( 0 equ; 118 neg)
% Maximal clause size : 13 ( 3 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 : 97 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a5_FOL_2,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/benchmark/theBenchmark.p',a5_FOL_2) ).
cnf(t17_FOL_14,negated_conjecture,
size(sk3,sk7,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_14) ).
cnf(t17_FOL_5,negated_conjecture,
organization(sk3,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_5) ).
cnf(a13_FOL_3,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X2)
| ~ greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_FOL_3) ).
cnf(t17_FOL_15,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_15) ).
cnf(t17_FOL_12,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_12) ).
cnf(t17_FOL_13,negated_conjecture,
size(sk2,sk6,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_13) ).
cnf(t17_FOL_4,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_4) ).
cnf(t17_FOL_6,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_6) ).
cnf(t17_FOL_10,negated_conjecture,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_10) ).
cnf(t17_FOL_8,negated_conjecture,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_8) ).
cnf(t17_FOL_7,negated_conjecture,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_7) ).
cnf(t17_FOL_11,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_11) ).
cnf(t17_FOL_16,negated_conjecture,
~ greater(sk10,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_16) ).
cnf(t17_FOL_9,negated_conjecture,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_FOL_9) ).
cnf(mp5_1,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_1) ).
cnf(c_0_16,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) ),
inference(fof_simplification,[status(thm)],[a5_FOL_2]) ).
cnf(c_0_17,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) ),
c_0_16 ).
cnf(c_0_18,negated_conjecture,
size(sk3,sk7,sk8),
t17_FOL_14 ).
cnf(c_0_19,negated_conjecture,
organization(sk3,sk8),
t17_FOL_5 ).
cnf(c_0_20,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X2)
| ~ greater(X9,X8) ),
inference(fof_simplification,[status(thm)],[a13_FOL_3]) ).
cnf(c_0_21,negated_conjecture,
( greater(X1,X2)
| ~ greater(sk7,X3)
| ~ size(X4,X3,X5)
| ~ class(sk3,X6,sk8)
| ~ class(X4,X6,X5)
| ~ inertia(sk3,X1,sk8)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
greater(sk7,sk6),
t17_FOL_15 ).
cnf(c_0_23,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X2)
| ~ greater(X9,X8) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
t17_FOL_12 ).
cnf(c_0_25,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,sk6,X4)
| ~ class(sk3,X5,sk8)
| ~ class(X3,X5,X4)
| ~ inertia(sk3,X1,sk8)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
size(sk2,sk6,sk8),
t17_FOL_13 ).
cnf(c_0_27,negated_conjecture,
organization(sk2,sk8),
t17_FOL_4 ).
cnf(c_0_28,negated_conjecture,
( greater(X1,X2)
| ~ reorganization_type(X3,sk4,sk8)
| ~ reorganization(sk3,sk8,X1)
| ~ reorganization(X3,sk8,X2)
| ~ greater(X4,X5)
| ~ class(sk3,X6,sk8)
| ~ class(X3,X6,sk8)
| ~ inertia(sk3,X4,sk8)
| ~ inertia(X3,X5,sk8)
| ~ organization(sk3,X1)
| ~ organization(X3,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19])]) ).
cnf(c_0_29,negated_conjecture,
organization(sk3,sk10),
t17_FOL_6 ).
cnf(c_0_30,negated_conjecture,
reorganization(sk3,sk8,sk10),
t17_FOL_10 ).
cnf(c_0_31,negated_conjecture,
( greater(X1,X2)
| ~ class(sk3,X3,sk8)
| ~ class(sk2,X3,sk8)
| ~ inertia(sk3,X1,sk8)
| ~ inertia(sk2,X2,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
class(sk3,sk5,sk8),
t17_FOL_8 ).
cnf(c_0_33,negated_conjecture,
class(sk2,sk5,sk8),
t17_FOL_7 ).
cnf(c_0_34,negated_conjecture,
( greater(sk10,X1)
| ~ reorganization_type(X2,sk4,sk8)
| ~ reorganization(X2,sk8,X1)
| ~ greater(X3,X4)
| ~ class(sk3,X5,sk8)
| ~ class(X2,X5,sk8)
| ~ inertia(sk3,X3,sk8)
| ~ inertia(X2,X4,sk8)
| ~ organization(X2,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
t17_FOL_11 ).
cnf(c_0_36,negated_conjecture,
( greater(X1,X2)
| ~ inertia(sk3,X1,sk8)
| ~ inertia(sk2,X2,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
~ greater(sk10,sk9),
inference(fof_simplification,[status(thm)],[t17_FOL_16]) ).
cnf(c_0_38,negated_conjecture,
( greater(sk10,X1)
| ~ reorganization(sk2,sk8,X1)
| ~ class(sk3,X2,sk8)
| ~ class(sk2,X2,sk8)
| ~ inertia(sk3,X3,sk8)
| ~ inertia(sk2,X4,sk8) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_35])]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
reorganization(sk2,sk8,sk9),
t17_FOL_9 ).
cnf(c_0_40,negated_conjecture,
~ greater(sk10,sk9),
c_0_37 ).
cnf(c_0_41,plain,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp5_1]) ).
cnf(c_0_42,negated_conjecture,
( ~ class(sk3,X1,sk8)
| ~ class(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ inertia(sk2,X3,sk8) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
c_0_41 ).
cnf(c_0_44,negated_conjecture,
( ~ inertia(sk3,X1,sk8)
| ~ inertia(sk2,X2,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_33])]) ).
cnf(c_0_45,negated_conjecture,
inertia(sk3,sk1(sk8,sk3),sk8),
inference(spm,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_46,negated_conjecture,
inertia(sk2,sk1(sk8,sk2),sk8),
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_47,negated_conjecture,
~ inertia(sk2,X1,sk8),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : MGT017-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 23:56:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14355 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14360 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 16
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 16
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 16
% 0.20/0.52 # Processed clauses : 54
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 0
% 0.20/0.52 # ...remaining for further processing : 54
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 9
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 25
% 0.20/0.52 # ...of the previous two non-redundant : 24
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 1
% 0.20/0.52 # Paramodulations : 24
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 10
% 0.20/0.52 # ...of those cached : 4
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 28
% 0.20/0.52 # Positive orientable unit clauses : 15
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 2
% 0.20/0.52 # Non-unit-clauses : 11
% 0.20/0.52 # Current number of unprocessed clauses: 2
% 0.20/0.52 # ...number of literals in the above : 20
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 26
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 297
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 15
% 0.20/0.52 # Non-unit clause-clause subsumptions : 6
% 0.20/0.52 # Unit Clause-clause subsumption calls : 13
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1467
% 0.20/0.52 # Search garbage collected termcells : 57
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.006 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.007 s
% 0.20/0.52 # Maximum resident set size: 1648 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.028 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.031 s
% 0.20/0.52 # Maximum resident set size: 1704 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------