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.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 158 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 198 ( 83 ~; 74 |; 34 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 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 : 111 ( 0 sgn; 60 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_FOL,conjecture,
! [X1,X10,X11,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& size(X1,X10,X6)
& size(X1,X11,X7)
& greater(X7,X6) )
=> ~ greater(X10,X11) ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',t11_FOL) ).
fof(mp10,axiom,
! [X1,X6,X7,X8,X9] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& class(X1,X8,X6)
& class(X1,X9,X7) )
=> X8 = X9 ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',mp10) ).
fof(mp9,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X5] : class(X1,X5,X2) ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',mp9) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X5,X10,X11,X12,X13,X6,X7] :
( ( organization(X1,X6)
& organization(X4,X7)
& class(X1,X5,X6)
& class(X4,X5,X7)
& size(X1,X10,X6)
& size(X4,X11,X7)
& inertia(X1,X12,X6)
& inertia(X4,X13,X7)
& greater(X11,X10) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',a5_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X12,X13,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& inertia(X1,X12,X6)
& inertia(X1,X13,X7)
& greater(X7,X6) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',t2_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',mp5) ).
fof(mp6_2,axiom,
! [X1,X4] :
~ ( greater(X1,X4)
& greater(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p',mp6_2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X10,X11,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& size(X1,X10,X6)
& size(X1,X11,X7)
& greater(X7,X6) )
=> ~ greater(X10,X11) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t11_FOL])]) ).
fof(c_0_8,plain,
! [X37,X38,X39,X40,X41] :
( ~ organization(X37,X38)
| ~ organization(X37,X39)
| ~ reorganization_free(X37,X38,X39)
| ~ class(X37,X40,X38)
| ~ class(X37,X41,X39)
| X40 = X41 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp10])]) ).
fof(c_0_9,negated_conjecture,
( organization(esk1_0,esk4_0)
& organization(esk1_0,esk5_0)
& reorganization_free(esk1_0,esk4_0,esk5_0)
& size(esk1_0,esk2_0,esk4_0)
& size(esk1_0,esk3_0,esk5_0)
& greater(esk5_0,esk4_0)
& greater(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_10,plain,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ class(X1,X4,X2)
| ~ class(X1,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
organization(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
organization(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X45,X46] :
( ~ organization(X45,X46)
| class(X45,esk7_2(X45,X46),X46) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp9])])]) ).
fof(c_0_15,hypothesis,
! [X23,X24,X25,X26,X27,X28,X29,X30,X31] :
( ~ organization(X23,X30)
| ~ organization(X24,X31)
| ~ class(X23,X25,X30)
| ~ class(X24,X25,X31)
| ~ size(X23,X26,X30)
| ~ size(X24,X27,X31)
| ~ inertia(X23,X28,X30)
| ~ inertia(X24,X29,X31)
| ~ greater(X27,X26)
| greater(X29,X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| ~ class(esk1_0,X2,esk5_0)
| ~ class(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
( class(X1,esk7_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,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(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
size(esk1_0,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( X1 = esk7_2(esk1_0,esk5_0)
| ~ class(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12])]) ).
fof(c_0_21,hypothesis,
! [X32,X33,X34,X35,X36] :
( ~ organization(X32,X35)
| ~ organization(X32,X36)
| ~ reorganization_free(X32,X35,X36)
| ~ inertia(X32,X33,X35)
| ~ inertia(X32,X34,X36)
| ~ greater(X36,X35)
| greater(X34,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])]) ).
cnf(c_0_22,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(esk1_0,X6,esk4_0)
| ~ class(X3,X6,X5)
| ~ greater(esk2_0,X4)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_23,negated_conjecture,
esk7_2(esk1_0,esk5_0) = esk7_2(esk1_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_13])]) ).
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) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
! [X42,X43] :
( ~ organization(X42,X43)
| inertia(X42,esk6_2(X42,X43),X43) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])]) ).
cnf(c_0_27,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(X3,esk7_2(esk1_0,esk4_0),X5)
| ~ greater(esk2_0,X4)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_13])]) ).
cnf(c_0_28,negated_conjecture,
class(esk1_0,esk7_2(esk1_0,esk4_0),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_12])]) ).
fof(c_0_29,plain,
! [X21,X22] :
( ~ greater(X21,X22)
| ~ greater(X22,X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_2])]) ).
cnf(c_0_30,negated_conjecture,
( greater(X1,X2)
| ~ inertia(esk1_0,X1,esk5_0)
| ~ inertia(esk1_0,X2,esk4_0) ),
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_11]),c_0_25]),c_0_12]),c_0_13])]) ).
cnf(c_0_31,plain,
( inertia(X1,esk6_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( greater(X1,X2)
| ~ size(esk1_0,X3,esk5_0)
| ~ greater(esk2_0,X3)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ inertia(esk1_0,X2,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]) ).
cnf(c_0_33,negated_conjecture,
size(esk1_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( greater(esk6_2(esk1_0,esk5_0),X1)
| ~ inertia(esk1_0,X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_12])]) ).
cnf(c_0_37,negated_conjecture,
( greater(X1,X2)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ inertia(esk1_0,X2,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
( ~ greater(X1,esk6_2(esk1_0,esk5_0))
| ~ inertia(esk1_0,X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( greater(esk6_2(esk1_0,esk4_0),X1)
| ~ inertia(esk1_0,X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_13])]) ).
cnf(c_0_40,negated_conjecture,
( ~ inertia(esk1_0,esk6_2(esk1_0,esk4_0),esk4_0)
| ~ inertia(esk1_0,esk6_2(esk1_0,esk5_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
~ inertia(esk1_0,esk6_2(esk1_0,esk4_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_12])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT011+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n031.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:56:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.PGGHlPSPZs/E---3.1_4001.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 4082 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHHSF-FFSM22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 4083 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHHSF-FFSM22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 8
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 14
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 14
% 0.20/0.49 # Processed clauses : 58
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 6
% 0.20/0.49 # ...remaining for further processing : 52
% 0.20/0.49 # Other redundant clauses eliminated : 1
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 32
% 0.20/0.49 # ...of the previous two non-redundant : 32
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 31
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 1
% 0.20/0.49 # Total rewrite steps : 23
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 34
% 0.20/0.49 # Positive orientable unit clauses : 9
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 6
% 0.20/0.49 # Non-unit-clauses : 19
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 7
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 17
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 337
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 29
% 0.20/0.49 # Non-unit clause-clause subsumptions : 4
% 0.20/0.49 # Unit Clause-clause subsumption calls : 39
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1883
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1712 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1688 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------