TSTP Solution File: MGT044+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT044+1 : TPTP v8.1.2. Released v2.4.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:47 EDT 2023
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 102 ( 20 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 105 ( 33 ~; 30 |; 24 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 8 sgn; 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_3,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.XWEp8KbYzc/E---3.1_8609.p',lemma_3) ).
fof(assumption_9,axiom,
! [X1,X4,X5] :
( organization(X1)
=> internal_friction(X1,X5) = internal_friction(X1,X4) ),
file('/export/starexec/sandbox/tmp/tmp.XWEp8KbYzc/E---3.1_8609.p',assumption_9) ).
fof(assumption_7,axiom,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.XWEp8KbYzc/E---3.1_8609.p',assumption_7) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.XWEp8KbYzc/E---3.1_8609.p',definition_smaller_or_equal) ).
fof(assumption_5,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XWEp8KbYzc/E---3.1_8609.p',assumption_5) ).
fof(c_0_5,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
<=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ),
inference(assume_negation,[status(cth)],[lemma_3]) ).
fof(c_0_7,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X25,X26,X27] :
( ~ organization(X25)
| internal_friction(X25,X27) = internal_friction(X25,X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_9])]) ).
fof(c_0_9,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& ~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X31,X32,X33] :
( ( ~ greater(stock_of_knowledge(X31,X32),stock_of_knowledge(X31,X33))
| ~ smaller_or_equal(internal_friction(X31,X32),internal_friction(X31,X33))
| greater(capability(X31,X32),capability(X31,X33))
| ~ epred1_3(X33,X32,X31) )
& ( ~ smaller_or_equal(stock_of_knowledge(X31,X32),stock_of_knowledge(X31,X33))
| ~ greater(internal_friction(X31,X32),internal_friction(X31,X33))
| smaller(capability(X31,X32),capability(X31,X33))
| ~ epred1_3(X33,X32,X31) )
& ( stock_of_knowledge(X31,X32) != stock_of_knowledge(X31,X33)
| internal_friction(X31,X32) != internal_friction(X31,X33)
| capability(X31,X32) = capability(X31,X33)
| ~ epred1_3(X33,X32,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X22,X23,X24] :
( ~ organization(X22)
| ~ greater(age(X22,X24),age(X22,X23))
| greater(stock_of_knowledge(X22,X24),stock_of_knowledge(X22,X23)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_7])]) ).
cnf(c_0_14,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
internal_friction(esk1_0,X1) = internal_friction(esk1_0,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X6,X7] :
( ( ~ smaller_or_equal(X6,X7)
| smaller(X6,X7)
| X6 = X7 )
& ( ~ smaller(X6,X7)
| smaller_or_equal(X6,X7) )
& ( X6 != X7
| smaller_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])]) ).
cnf(c_0_19,plain,
( greater(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2))
| ~ smaller_or_equal(internal_friction(esk1_0,X1),internal_friction(esk1_0,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12])]) ).
cnf(c_0_21,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,axiom,
! [X1,X4,X5] :
( organization(X1)
=> epred1_3(X4,X5,X1) ),
inference(apply_def,[status(thm)],[assumption_5,c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( ~ epred1_3(esk2_0,esk3_0,esk1_0)
| ~ smaller_or_equal(internal_friction(esk1_0,esk1_0),internal_friction(esk1_0,X1)) ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_15]) ).
cnf(c_0_25,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X19,X20,X21] :
( ~ organization(X19)
| epred1_3(X20,X21,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
~ epred1_3(esk2_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( epred1_3(X2,X3,X1)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT044+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 00:21:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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.XWEp8KbYzc/E---3.1_8609.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8687 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMF22-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8694 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMF22-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 10
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 20
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 20
% 0.21/0.50 # Processed clauses : 130
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 38
% 0.21/0.50 # ...remaining for further processing : 92
% 0.21/0.50 # Other redundant clauses eliminated : 2
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 5
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 315
% 0.21/0.50 # ...of the previous two non-redundant : 269
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 3
% 0.21/0.50 # Paramodulations : 304
% 0.21/0.50 # Factorizations : 8
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 3
% 0.21/0.50 # Total rewrite steps : 37
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 65
% 0.21/0.50 # Positive orientable unit clauses : 5
% 0.21/0.50 # Positive unorientable unit clauses: 1
% 0.21/0.50 # Negative unit clauses : 4
% 0.21/0.50 # Non-unit-clauses : 55
% 0.21/0.50 # Current number of unprocessed clauses: 179
% 0.21/0.50 # ...number of literals in the above : 937
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 25
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 1379
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 1093
% 0.21/0.50 # Non-unit clause-clause subsumptions : 38
% 0.21/0.50 # Unit Clause-clause subsumption calls : 27
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 6524
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.016 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 1772 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.065 s
% 0.21/0.50 # System time : 0.010 s
% 0.21/0.50 # Total time : 0.074 s
% 0.21/0.50 # Maximum resident set size: 1680 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------