TSTP Solution File: MGT011-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT011-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:34:33 EDT 2023
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 41 ( 18 unt; 0 nHn; 41 RR)
% Number of literals : 115 ( 5 equ; 79 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp10_24,axiom,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ class(X1,X4,X2)
| ~ class(X1,X5,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',mp10_24) ).
cnf(t11_FOL_29,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_29) ).
cnf(t11_FOL_28,negated_conjecture,
organization(sk3,sk7),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_28) ).
cnf(t11_FOL_27,negated_conjecture,
organization(sk3,sk6),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_27) ).
cnf(mp9_23,axiom,
( class(X1,sk2(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',mp9_23) ).
cnf(a5_FOL_25,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.v0MNdSm6jr/E---3.1_11651.p',a5_FOL_25) ).
cnf(t11_FOL_30,negated_conjecture,
size(sk3,sk4,sk6),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_30) ).
cnf(t2_FOL_26,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ inertia(X1,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t2_FOL_26) ).
cnf(t11_FOL_32,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_32) ).
cnf(mp5_20,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',mp5_20) ).
cnf(t11_FOL_31,negated_conjecture,
size(sk3,sk5,sk7),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_31) ).
cnf(t11_FOL_33,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',t11_FOL_33) ).
cnf(mp6_2_22,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p',mp6_2_22) ).
cnf(c_0_13,axiom,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ class(X1,X4,X2)
| ~ class(X1,X5,X3) ),
mp10_24 ).
cnf(c_0_14,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
t11_FOL_29 ).
cnf(c_0_15,negated_conjecture,
organization(sk3,sk7),
t11_FOL_28 ).
cnf(c_0_16,negated_conjecture,
organization(sk3,sk6),
t11_FOL_27 ).
cnf(c_0_17,negated_conjecture,
( X1 = X2
| ~ class(sk3,X2,sk7)
| ~ class(sk3,X1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,axiom,
( class(X1,sk2(X2,X1),X2)
| ~ organization(X1,X2) ),
mp9_23 ).
cnf(c_0_19,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_25 ).
cnf(c_0_20,negated_conjecture,
size(sk3,sk4,sk6),
t11_FOL_30 ).
cnf(c_0_21,negated_conjecture,
( X1 = sk2(sk7,sk3)
| ~ class(sk3,X1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(sk3,X6,sk6)
| ~ class(X3,X6,X5)
| ~ greater(sk4,X4)
| ~ inertia(sk3,X1,sk6)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
sk2(sk7,sk3) = sk2(sk6,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_16])]) ).
cnf(c_0_24,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ inertia(X1,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ greater(X3,X2) ),
t2_FOL_26 ).
cnf(c_0_25,negated_conjecture,
greater(sk7,sk6),
t11_FOL_32 ).
cnf(c_0_26,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(X3,sk2(sk6,sk3),X5)
| ~ greater(sk4,X4)
| ~ inertia(sk3,X1,sk6)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_16])]) ).
cnf(c_0_27,negated_conjecture,
class(sk3,sk2(sk6,sk3),sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_15])]) ).
cnf(c_0_28,negated_conjecture,
( greater(X1,X2)
| ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X2,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_25]),c_0_15]),c_0_16])]) ).
cnf(c_0_29,axiom,
( inertia(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp5_20 ).
cnf(c_0_30,negated_conjecture,
( greater(X1,X2)
| ~ size(sk3,X3,sk7)
| ~ greater(sk4,X3)
| ~ inertia(sk3,X1,sk6)
| ~ inertia(sk3,X2,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15])]) ).
cnf(c_0_31,negated_conjecture,
size(sk3,sk5,sk7),
t11_FOL_31 ).
cnf(c_0_32,negated_conjecture,
greater(sk4,sk5),
t11_FOL_33 ).
cnf(c_0_33,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
mp6_2_22 ).
cnf(c_0_34,negated_conjecture,
( greater(sk1(sk7,sk3),X1)
| ~ inertia(sk3,X1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15])]) ).
cnf(c_0_35,negated_conjecture,
( greater(X1,X2)
| ~ inertia(sk3,X1,sk6)
| ~ inertia(sk3,X2,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(X1,sk1(sk7,sk3))
| ~ inertia(sk3,X1,sk6) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( greater(sk1(sk6,sk3),X1)
| ~ inertia(sk3,X1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_16])]) ).
cnf(c_0_38,negated_conjecture,
( ~ inertia(sk3,sk1(sk6,sk3),sk6)
| ~ inertia(sk3,sk1(sk7,sk3),sk7) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
~ inertia(sk3,sk1(sk6,sk3),sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_15])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT011-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:36:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/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/tmp/tmp.v0MNdSm6jr/E---3.1_11651.p
% 0.22/0.52 # Version: 3.1pre001
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # sh5l with pid 11849 completed with status 0
% 0.22/0.52 # Result found by sh5l
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: FHHSF-FFSM22-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 11860 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: FHHSF-FFSM22-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 14
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 14
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 14
% 0.22/0.52 # Processed clauses : 58
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 6
% 0.22/0.52 # ...remaining for further processing : 52
% 0.22/0.52 # Other redundant clauses eliminated : 1
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 2
% 0.22/0.52 # Backward-rewritten : 1
% 0.22/0.52 # Generated clauses : 32
% 0.22/0.52 # ...of the previous two non-redundant : 32
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 31
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 1
% 0.22/0.52 # Total rewrite steps : 23
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 34
% 0.22/0.52 # Positive orientable unit clauses : 9
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 6
% 0.22/0.52 # Non-unit-clauses : 19
% 0.22/0.52 # Current number of unprocessed clauses: 2
% 0.22/0.52 # ...number of literals in the above : 7
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 17
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 337
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 29
% 0.22/0.52 # Non-unit clause-clause subsumptions : 4
% 0.22/0.52 # Unit Clause-clause subsumption calls : 39
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 1
% 0.22/0.52 # BW rewrite match successes : 1
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1124
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.006 s
% 0.22/0.52 # System time : 0.001 s
% 0.22/0.52 # Total time : 0.007 s
% 0.22/0.52 # Maximum resident set size: 1640 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.007 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.010 s
% 0.22/0.52 # Maximum resident set size: 1680 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------