TSTP Solution File: MGT044+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 : 600s
% DateTime : Sun Jul 17 22:10:12 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 104 ( 20 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 107 ( 33 ~; 32 |; 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 : 67 ( 9 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_5) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lemma_3) ).
fof(assumption_9,axiom,
! [X1,X4,X5] :
( organization(X1)
=> internal_friction(X1,X5) = internal_friction(X1,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_9) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_7) ).
fof(c_0_5,plain,
! [X5,X4,X1] :
( epred1_3(X1,X4,X5)
<=> ( ( ( 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,plain,
! [X5,X4,X1] :
( epred1_3(X1,X4,X5)
=> ( ( ( 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_7,axiom,
! [X1,X4,X5] :
( organization(X1)
=> epred1_3(X1,X4,X5) ),
inference(apply_def,[status(thm)],[assumption_5,c_0_5]) ).
fof(c_0_8,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_9,plain,
! [X6,X7,X8] :
( ( ~ greater(stock_of_knowledge(X8,X6),stock_of_knowledge(X8,X7))
| ~ smaller_or_equal(internal_friction(X8,X6),internal_friction(X8,X7))
| greater(capability(X8,X6),capability(X8,X7))
| ~ epred1_3(X8,X7,X6) )
& ( ~ smaller_or_equal(stock_of_knowledge(X8,X6),stock_of_knowledge(X8,X7))
| ~ greater(internal_friction(X8,X6),internal_friction(X8,X7))
| smaller(capability(X8,X6),capability(X8,X7))
| ~ epred1_3(X8,X7,X6) )
& ( stock_of_knowledge(X8,X6) != stock_of_knowledge(X8,X7)
| internal_friction(X8,X6) != internal_friction(X8,X7)
| capability(X8,X6) = capability(X8,X7)
| ~ epred1_3(X8,X7,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X6,X7,X8] :
( ~ organization(X6)
| epred1_3(X6,X7,X8) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X6,X7,X8] :
( ~ organization(X6)
| internal_friction(X6,X8) = internal_friction(X6,X7) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_9])])])]) ).
fof(c_0_12,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_8])])]) ).
cnf(c_0_13,plain,
( greater(capability(X1,X3),capability(X1,X2))
| ~ epred1_3(X1,X2,X3)
| ~ smaller_or_equal(internal_friction(X1,X3),internal_friction(X1,X2))
| ~ greater(stock_of_knowledge(X1,X3),stock_of_knowledge(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X3,X4,X3,X4] :
( ( ~ smaller_or_equal(X3,X4)
| smaller(X3,X4)
| X3 = X4 )
& ( ~ smaller(X3,X4)
| smaller_or_equal(X3,X4) )
& ( X3 != X4
| smaller_or_equal(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])])])]) ).
cnf(c_0_18,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
internal_friction(esk1_0,X1) = internal_friction(esk1_0,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X6,X7,X8] :
( ~ organization(X6)
| ~ greater(age(X6,X8),age(X6,X7))
| greater(stock_of_knowledge(X6,X8),stock_of_knowledge(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_7])]) ).
cnf(c_0_22,negated_conjecture,
( greater(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ 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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]) ).
cnf(c_0_23,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( greater(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,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_24,c_0_25]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 11:25:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 30
% 0.22/1.41 # Proof object clause steps : 15
% 0.22/1.41 # Proof object formula steps : 15
% 0.22/1.41 # Proof object conjectures : 11
% 0.22/1.41 # Proof object clause conjectures : 8
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 8
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 6
% 0.22/1.41 # Proof object simplifying inferences : 7
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 10
% 0.22/1.41 # Removed by relevancy pruning/SinE : 1
% 0.22/1.41 # Initial clauses : 17
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 17
% 0.22/1.41 # Processed clauses : 54
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 12
% 0.22/1.41 # ...remaining for further processing : 42
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 133
% 0.22/1.41 # ...of the previous two non-trivial : 116
% 0.22/1.41 # Contextual simplify-reflections : 5
% 0.22/1.41 # Paramodulations : 124
% 0.22/1.41 # Factorizations : 8
% 0.22/1.41 # Equation resolutions : 1
% 0.22/1.41 # Current number of processed clauses : 40
% 0.22/1.41 # Positive orientable unit clauses : 4
% 0.22/1.41 # Positive unorientable unit clauses: 1
% 0.22/1.41 # Negative unit clauses : 3
% 0.22/1.41 # Non-unit-clauses : 32
% 0.22/1.41 # Current number of unprocessed clauses: 74
% 0.22/1.41 # ...number of literals in the above : 330
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 1
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 323
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 272
% 0.22/1.41 # Non-unit clause-clause subsumptions : 12
% 0.22/1.41 # Unit Clause-clause subsumption calls : 11
% 0.22/1.41 # Rewrite failures with RHS unbound : 6
% 0.22/1.41 # BW rewrite match attempts : 3
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 2789
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.017 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.020 s
% 0.22/1.41 # Maximum resident set size: 2812 pages
%------------------------------------------------------------------------------