TSTP Solution File: MSC017+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:43:05 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 71 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 82 ( 35 ~; 28 |; 8 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 21 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(no_bad,conjecture,
! [X1] :
( dive(X1)
=> ! [X2] :
( outcome(X1,X2)
=> ~ bad(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',no_bad) ).
fof(dci_is_the_only_bad_outcome,axiom,
! [X1] :
( dive(X1)
=> ! [X2] :
( ( outcome(X1,X2)
& bad(X2) )
=> X2 = dci ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dci_is_the_only_bad_outcome) ).
fof(depth_and_time_and_nitrogen,axiom,
! [X1] :
( dive(X1)
=> ( ( greater(depth(X1),depth_limit)
| greater(time(X1),time_limit) )
<=> greater(nitrogen(X1),nitrogen_limit) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',depth_and_time_and_nitrogen) ).
fof(no_deep_long,axiom,
! [X1] :
( dive(X1)
=> ( ~ greater(depth(X1),depth_limit)
& ~ greater(time(X1),time_limit) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',no_deep_long) ).
fof(too_much_nitrogen,axiom,
! [X1] :
( dive(X1)
=> ( greater(nitrogen(X1),nitrogen_limit)
<=> outcome(X1,dci) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',too_much_nitrogen) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( dive(X1)
=> ! [X2] :
( outcome(X1,X2)
=> ~ bad(X2) ) ),
inference(assume_negation,[status(cth)],[no_bad]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ dive(X3)
| ~ outcome(X3,X4)
| ~ bad(X4)
| X4 = dci ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dci_is_the_only_bad_outcome])])])])]) ).
fof(c_0_7,negated_conjecture,
( dive(esk1_0)
& outcome(esk1_0,esk2_0)
& bad(esk2_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])]) ).
cnf(c_0_8,plain,
( X1 = dci
| ~ bad(X1)
| ~ outcome(X2,X1)
| ~ dive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
outcome(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
bad(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
dive(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X2] :
( ( ~ greater(depth(X2),depth_limit)
| greater(nitrogen(X2),nitrogen_limit)
| ~ dive(X2) )
& ( ~ greater(time(X2),time_limit)
| greater(nitrogen(X2),nitrogen_limit)
| ~ dive(X2) )
& ( ~ greater(nitrogen(X2),nitrogen_limit)
| greater(depth(X2),depth_limit)
| greater(time(X2),time_limit)
| ~ dive(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[depth_and_time_and_nitrogen])])]) ).
fof(c_0_13,plain,
! [X2] :
( ( ~ greater(depth(X2),depth_limit)
| ~ dive(X2) )
& ( ~ greater(time(X2),time_limit)
| ~ dive(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[no_deep_long])])])]) ).
fof(c_0_14,plain,
! [X2] :
( ( ~ greater(nitrogen(X2),nitrogen_limit)
| outcome(X2,dci)
| ~ dive(X2) )
& ( ~ outcome(X2,dci)
| greater(nitrogen(X2),nitrogen_limit)
| ~ dive(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[too_much_nitrogen])])]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 = dci,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_16,plain,
( greater(time(X1),time_limit)
| greater(depth(X1),depth_limit)
| ~ dive(X1)
| ~ greater(nitrogen(X1),nitrogen_limit) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ dive(X1)
| ~ greater(time(X1),time_limit) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ dive(X1)
| ~ greater(depth(X1),depth_limit) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( greater(nitrogen(X1),nitrogen_limit)
| ~ dive(X1)
| ~ outcome(X1,dci) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
outcome(esk1_0,dci),
inference(rw,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_21,plain,
( ~ greater(nitrogen(X1),nitrogen_limit)
| ~ dive(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
greater(nitrogen(esk1_0),nitrogen_limit),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_11])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n026.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 : Fri Jul 1 16:18:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Failure: Out of unprocessed clauses!
% 0.23/1.42 # OLD status GaveUp
% 0.23/1.42 # Parsed axioms : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 5
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 5
% 0.23/1.42 # Processed clauses : 7
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 7
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 2
% 0.23/1.42 # Generated clauses : 1
% 0.23/1.42 # ...of the previous two non-trivial : 2
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 1
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 5
% 0.23/1.42 # Positive orientable unit clauses : 4
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 1
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 2
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 295
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.009 s
% 0.23/1.42 # System time : 0.005 s
% 0.23/1.42 # Total time : 0.014 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
% 0.23/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 24
% 0.23/1.42 # Proof object clause steps : 13
% 0.23/1.42 # Proof object formula steps : 11
% 0.23/1.42 # Proof object conjectures : 10
% 0.23/1.42 # Proof object clause conjectures : 7
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 8
% 0.23/1.42 # Proof object initial formulas used : 5
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 10
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 13
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 13
% 0.23/1.42 # Processed clauses : 16
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 2
% 0.23/1.42 # ...remaining for further processing : 14
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 1
% 0.23/1.42 # Backward-rewritten : 2
% 0.23/1.42 # Generated clauses : 4
% 0.23/1.42 # ...of the previous two non-trivial : 3
% 0.23/1.42 # Contextual simplify-reflections : 4
% 0.23/1.42 # Paramodulations : 4
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 11
% 0.23/1.42 # Positive orientable unit clauses : 5
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 6
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 3
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 8
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 7
% 0.23/1.42 # Non-unit clause-clause subsumptions : 7
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 810
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.013 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.014 s
% 0.23/1.42 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------