TSTP Solution File: MGT009+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT009+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:24 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 174 ( 0 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 230 ( 90 ~; 87 |; 47 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 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 : 109 ( 0 sgn 56 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_FOL,conjecture,
! [X1,X4,X11,X7,X8,X12,X13,X5,X6] :
( ( organization(X1,X5)
& organization(X4,X6)
& reorganization_free(X1,X5,X5)
& reorganization_free(X4,X6,X6)
& class(X1,X11,X5)
& class(X4,X11,X6)
& reproducibility(X1,X7,X5)
& reproducibility(X4,X8,X6)
& size(X1,X12,X5)
& size(X4,X13,X6)
& greater(X13,X12) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X11,X12,X13,X9,X10,X5,X6] :
( ( organization(X1,X5)
& organization(X4,X6)
& class(X1,X11,X5)
& class(X4,X11,X6)
& size(X1,X12,X5)
& size(X4,X13,X6)
& inertia(X1,X9,X5)
& inertia(X4,X10,X6)
& greater(X13,X12) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
fof(a3_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10] :
( ( organization(X1,X5)
& organization(X4,X6)
& reorganization_free(X1,X5,X5)
& reorganization_free(X4,X6,X6)
& reproducibility(X1,X7,X5)
& reproducibility(X4,X8,X6)
& inertia(X1,X9,X5)
& inertia(X4,X10,X6) )
=> ( greater(X8,X7)
<=> greater(X10,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X4,X11,X7,X8,X12,X13,X5,X6] :
( ( organization(X1,X5)
& organization(X4,X6)
& reorganization_free(X1,X5,X5)
& reorganization_free(X4,X6,X6)
& class(X1,X11,X5)
& class(X4,X11,X6)
& reproducibility(X1,X7,X5)
& reproducibility(X4,X8,X6)
& size(X1,X12,X5)
& size(X4,X13,X6)
& greater(X13,X12) )
=> greater(X8,X7) ),
inference(assume_negation,[status(cth)],[t9_FOL]) ).
fof(c_0_5,hypothesis,
! [X25,X26,X27,X28,X29,X30,X31,X32,X33] :
( ~ organization(X25,X32)
| ~ organization(X26,X33)
| ~ class(X25,X27,X32)
| ~ class(X26,X27,X33)
| ~ size(X25,X28,X32)
| ~ size(X26,X29,X33)
| ~ inertia(X25,X30,X32)
| ~ inertia(X26,X31,X33)
| ~ greater(X29,X28)
| greater(X31,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])])]) ).
fof(c_0_6,negated_conjecture,
( organization(esk2_0,esk9_0)
& organization(esk3_0,esk10_0)
& reorganization_free(esk2_0,esk9_0,esk9_0)
& reorganization_free(esk3_0,esk10_0,esk10_0)
& class(esk2_0,esk4_0,esk9_0)
& class(esk3_0,esk4_0,esk10_0)
& reproducibility(esk2_0,esk5_0,esk9_0)
& reproducibility(esk3_0,esk6_0,esk10_0)
& size(esk2_0,esk7_0,esk9_0)
& size(esk3_0,esk8_0,esk10_0)
& greater(esk8_0,esk7_0)
& ~ greater(esk6_0,esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,negated_conjecture,
size(esk3_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk3_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ greater(X22,X21)
| greater(X24,X23)
| ~ organization(X17,X19)
| ~ organization(X18,X20)
| ~ reorganization_free(X17,X19,X19)
| ~ reorganization_free(X18,X20,X20)
| ~ reproducibility(X17,X21,X19)
| ~ reproducibility(X18,X22,X20)
| ~ inertia(X17,X23,X19)
| ~ inertia(X18,X24,X20) )
& ( ~ greater(X24,X23)
| greater(X22,X21)
| ~ organization(X17,X19)
| ~ organization(X18,X20)
| ~ reorganization_free(X17,X19,X19)
| ~ reorganization_free(X18,X20,X20)
| ~ reproducibility(X17,X21,X19)
| ~ reproducibility(X18,X22,X20)
| ~ inertia(X17,X23,X19)
| ~ inertia(X18,X24,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a3_FOL])])])]) ).
cnf(c_0_11,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(esk3_0,X6,esk10_0)
| ~ class(X3,X6,X5)
| ~ greater(esk8_0,X4)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
class(esk3_0,esk4_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| inertia(X14,esk1_2(X14,X15),X15) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])]) ).
cnf(c_0_14,hypothesis,
( greater(X3,X4)
| ~ greater(X1,X2)
| ~ organization(X5,X6)
| ~ organization(X7,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ reproducibility(X5,X4,X6)
| ~ reproducibility(X7,X3,X8)
| ~ inertia(X5,X2,X6)
| ~ inertia(X7,X1,X8) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
reproducibility(esk3_0,esk6_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
reorganization_free(esk3_0,esk10_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(X3,esk4_0,X5)
| ~ greater(esk8_0,X4)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( greater(esk6_0,X1)
| ~ greater(X2,X3)
| ~ reproducibility(X4,X1,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(esk3_0,X2,esk10_0)
| ~ 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_14,c_0_15]),c_0_16]),c_0_9])]) ).
cnf(c_0_20,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ size(X2,X3,X4)
| ~ class(X2,esk4_0,X4)
| ~ greater(esk8_0,X3)
| ~ inertia(X2,X1,X4)
| ~ organization(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9])]) ).
cnf(c_0_21,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
class(esk2_0,esk4_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
greater(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( greater(esk6_0,X1)
| ~ greater(esk1_2(esk3_0,esk10_0),X2)
| ~ reproducibility(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_9])]) ).
cnf(c_0_26,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ inertia(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( greater(esk6_0,X1)
| ~ reproducibility(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(esk2_0,X4,esk9_0)
| ~ inertia(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( greater(esk6_0,X1)
| ~ reproducibility(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk1_2(esk2_0,esk9_0),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( greater(esk6_0,X1)
| ~ reproducibility(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
reproducibility(esk2_0,esk5_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
~ greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT009+1 : TPTP v8.2.0. Released v2.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 00:01:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10378 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 10382 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 4
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 16
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 16
% 0.21/0.51 # Processed clauses : 53
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 1
% 0.21/0.51 # ...remaining for further processing : 52
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 26
% 0.21/0.51 # ...of the previous two non-redundant : 24
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 26
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 30
% 0.21/0.51 # ...of those cached : 23
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 36
% 0.21/0.51 # Positive orientable unit clauses : 11
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 24
% 0.21/0.51 # Current number of unprocessed clauses: 3
% 0.21/0.51 # ...number of literals in the above : 20
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 16
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 287
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 12
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2365
% 0.21/0.51 # Search garbage collected termcells : 376
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.006 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.010 s
% 0.21/0.51 # Maximum resident set size: 1792 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.029 s
% 0.21/0.51 # System time : 0.008 s
% 0.21/0.51 # Total time : 0.037 s
% 0.21/0.51 # Maximum resident set size: 1692 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------