TSTP Solution File: MGT014+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:59 EDT 2023
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 19 unt; 0 def)
% Number of atoms : 178 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 205 ( 79 ~; 68 |; 48 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 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 : 108 ( 1 sgn; 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_FOL,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',t11_FOL) ).
fof(t14_FOL,conjecture,
! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',t14_FOL) ).
fof(mp17,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',mp17) ).
fof(mp15,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',mp15) ).
fof(t12_FOL,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',t12_FOL) ).
fof(mp16,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',mp16) ).
fof(mp19,axiom,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& X4 = X5 )
=> X6 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',mp19) ).
fof(mp6_1,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p',mp6_1) ).
fof(c_0_8,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[t11_FOL]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t14_FOL])]) ).
fof(c_0_10,hypothesis,
! [X23,X24,X25,X26,X27] :
( ~ organization(X23,X26)
| ~ organization(X23,X27)
| ~ reorganization_free(X23,X26,X27)
| ~ size(X23,X24,X26)
| ~ size(X23,X25,X27)
| ~ greater(X27,X26)
| ~ greater(X24,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_11,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& size(esk1_0,esk5_0,esk7_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_9])])]) ).
fof(c_0_12,plain,
! [X38,X39,X40] :
( ~ reorganization_free(X38,X39,X40)
| reorganization_free(X38,X40,X39) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp17])]) ).
fof(c_0_13,plain,
! [X41,X42] :
( ~ organization(X41,X42)
| time(X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp15])]) ).
cnf(c_0_14,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) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[t12_FOL]) ).
fof(c_0_20,plain,
! [X21,X22] :
( ~ time(X21)
| ~ time(X22)
| greater(X21,X22)
| X21 = X22
| greater(X22,X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp16])]) ).
cnf(c_0_21,plain,
( time(X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ size(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk6_0)
| ~ organization(esk1_0,X2)
| ~ greater(X1,esk4_0)
| ~ greater(esk6_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_25,hypothesis,
! [X28,X29,X30,X31,X32] :
( ~ organization(X28,X31)
| ~ organization(X28,X32)
| ~ reorganization_free(X28,X31,X32)
| ~ complexity(X28,X29,X31)
| ~ complexity(X28,X30,X32)
| ~ greater(X32,X31)
| ~ greater(X29,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_26,plain,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ size(esk1_0,X1,esk7_0)
| ~ greater(esk6_0,esk7_0)
| ~ greater(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,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) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X33,X34,X35,X36,X37] :
( ~ organization(X33,X36)
| ~ organization(X33,X37)
| ~ size(X33,X34,X36)
| ~ size(X33,X35,X37)
| X36 != X37
| X34 = X35 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp19])]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk7_0
| greater(X1,esk7_0)
| greater(esk7_0,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ organization(esk1_0,X2)
| ~ greater(X1,esk3_0)
| ~ greater(esk7_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22])]) ).
cnf(c_0_38,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_39,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,plain,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk7_0,esk6_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18]),c_0_16]),c_0_39])]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ size(X3,X2,X4)
| ~ size(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_45,plain,
! [X17,X18] :
( ~ greater(X17,X18)
| X17 != X18 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_1])]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_15]),c_0_16])]) ).
cnf(c_0_47,negated_conjecture,
size(esk1_0,esk5_0,esk6_0),
inference(rw,[status(thm)],[c_0_29,c_0_44]) ).
cnf(c_0_48,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
esk4_0 = esk5_0,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n026.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 2400
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Oct 3 00:44:29 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.G1Up9sv8EV/E---3.1_31011.p
% 0.21/0.49 # Version: 3.1pre001
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # sh5l with pid 31091 completed with status 0
% 0.21/0.49 # Result found by sh5l
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.49 # Search class: FGHSF-FFSM00-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 31097 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.49 # Search class: FGHSF-FFSM00-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 9
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 17
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 17
% 0.21/0.49 # Processed clauses : 62
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 4
% 0.21/0.49 # ...remaining for further processing : 58
% 0.21/0.49 # Other redundant clauses eliminated : 2
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 2
% 0.21/0.49 # Backward-rewritten : 17
% 0.21/0.49 # Generated clauses : 33
% 0.21/0.49 # ...of the previous two non-redundant : 44
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 30
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 2
% 0.21/0.49 # Total rewrite steps : 48
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 19
% 0.21/0.49 # Positive orientable unit clauses : 9
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 2
% 0.21/0.49 # Non-unit-clauses : 8
% 0.21/0.49 # Current number of unprocessed clauses: 13
% 0.21/0.49 # ...number of literals in the above : 42
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 37
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 145
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 54
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 29
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 2
% 0.21/0.49 # BW rewrite match successes : 2
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 1825
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.008 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.010 s
% 0.21/0.49 # Maximum resident set size: 1696 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.011 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.013 s
% 0.21/0.49 # Maximum resident set size: 1684 pages
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------