TSTP Solution File: PRO009+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : Mon Jul 18 17:44:58 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 157 ( 65 ~; 59 |; 28 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 56 ( 3 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( min_precedes(X16,X17,X18)
& ~ ? [X19] :
( min_precedes(X16,X19,X18)
& min_precedes(X19,X17,X18) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_04) ).
fof(sos_32,axiom,
! [X96] :
( occurrence_of(X96,tptp0)
=> ? [X97,X98,X99] :
( occurrence_of(X97,tptp3)
& root_occ(X97,X96)
& occurrence_of(X98,tptp4)
& next_subocc(X97,X98,tptp0)
& ( occurrence_of(X99,tptp2)
| occurrence_of(X99,tptp1) )
& next_subocc(X98,X99,tptp0)
& leaf_occ(X99,X96) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X1,X2,X4)
& min_precedes(X2,X3,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos) ).
fof(goals,conjecture,
! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( occurrence_of(X101,tptp3)
& root_occ(X101,X100)
& ( occurrence_of(X102,tptp2)
| occurrence_of(X102,tptp1) )
& min_precedes(X101,X102,tptp0)
& leaf_occ(X102,X100) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(c_0_4,plain,
! [X20,X21,X22,X23,X20,X21,X22] :
( ( min_precedes(X20,X21,X22)
| ~ next_subocc(X20,X21,X22) )
& ( ~ min_precedes(X20,X23,X22)
| ~ min_precedes(X23,X21,X22)
| ~ next_subocc(X20,X21,X22) )
& ( min_precedes(X20,esk6_3(X20,X21,X22),X22)
| ~ min_precedes(X20,X21,X22)
| next_subocc(X20,X21,X22) )
& ( min_precedes(esk6_3(X20,X21,X22),X21,X22)
| ~ min_precedes(X20,X21,X22)
| next_subocc(X20,X21,X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_04])])])])])])]) ).
fof(c_0_5,plain,
! [X100] :
( ( occurrence_of(esk2_1(X100),tptp3)
| ~ occurrence_of(X100,tptp0) )
& ( root_occ(esk2_1(X100),X100)
| ~ occurrence_of(X100,tptp0) )
& ( occurrence_of(esk3_1(X100),tptp4)
| ~ occurrence_of(X100,tptp0) )
& ( next_subocc(esk2_1(X100),esk3_1(X100),tptp0)
| ~ occurrence_of(X100,tptp0) )
& ( occurrence_of(esk4_1(X100),tptp2)
| occurrence_of(esk4_1(X100),tptp1)
| ~ occurrence_of(X100,tptp0) )
& ( next_subocc(esk3_1(X100),esk4_1(X100),tptp0)
| ~ occurrence_of(X100,tptp0) )
& ( leaf_occ(esk4_1(X100),X100)
| ~ occurrence_of(X100,tptp0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8] :
( ~ min_precedes(X5,X6,X8)
| ~ min_precedes(X6,X7,X8)
| min_precedes(X5,X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])]) ).
cnf(c_0_7,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( next_subocc(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
~ ! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( occurrence_of(X101,tptp3)
& root_occ(X101,X100)
& ( occurrence_of(X102,tptp2)
| occurrence_of(X102,tptp1) )
& min_precedes(X101,X102,tptp0)
& leaf_occ(X102,X100) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_10,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( min_precedes(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( next_subocc(esk2_1(X1),esk3_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,negated_conjecture,
! [X104,X105] :
( occurrence_of(esk1_0,tptp0)
& ( ~ occurrence_of(X105,tptp2)
| ~ occurrence_of(X104,tptp3)
| ~ root_occ(X104,esk1_0)
| ~ min_precedes(X104,X105,tptp0)
| ~ leaf_occ(X105,esk1_0) )
& ( ~ occurrence_of(X105,tptp1)
| ~ occurrence_of(X104,tptp3)
| ~ root_occ(X104,esk1_0)
| ~ min_precedes(X104,X105,tptp0)
| ~ leaf_occ(X105,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
cnf(c_0_14,plain,
( min_precedes(X1,esk4_1(X2),tptp0)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(X1,esk3_1(X2),tptp0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( min_precedes(esk2_1(X1),esk3_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk1_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( min_precedes(esk2_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( occurrence_of(esk2_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk1_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ leaf_occ(esk4_1(X1),esk1_0)
| ~ root_occ(esk2_1(X1),esk1_0)
| ~ occurrence_of(esk4_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
( root_occ(esk2_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ leaf_occ(esk4_1(X1),esk1_0)
| ~ root_occ(esk2_1(X1),esk1_0)
| ~ occurrence_of(esk4_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ leaf_occ(esk4_1(esk1_0),esk1_0)
| ~ occurrence_of(esk4_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( leaf_occ(esk4_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( ~ leaf_occ(esk4_1(esk1_0),esk1_0)
| ~ occurrence_of(esk4_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
~ occurrence_of(esk4_1(esk1_0),tptp1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_28,plain,
( occurrence_of(esk4_1(X1),tptp1)
| occurrence_of(esk4_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
~ occurrence_of(esk4_1(esk1_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 02:42:22 EDT 2022
% 0.12/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.018 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 : 31
% 0.23/1.42 # Proof object clause steps : 22
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 13
% 0.23/1.42 # Proof object clause conjectures : 10
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 11
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 11
% 0.23/1.42 # Proof object simplifying inferences : 13
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 46
% 0.23/1.42 # Removed by relevancy pruning/SinE : 8
% 0.23/1.42 # Initial clauses : 67
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 67
% 0.23/1.42 # Processed clauses : 1776
% 0.23/1.42 # ...of these trivial : 1
% 0.23/1.42 # ...subsumed : 1229
% 0.23/1.42 # ...remaining for further processing : 546
% 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 : 57
% 0.23/1.42 # Backward-rewritten : 41
% 0.23/1.42 # Generated clauses : 3108
% 0.23/1.42 # ...of the previous two non-trivial : 2824
% 0.23/1.42 # Contextual simplify-reflections : 1277
% 0.23/1.42 # Paramodulations : 3108
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 448
% 0.23/1.42 # Positive orientable unit clauses : 15
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 19
% 0.23/1.42 # Non-unit-clauses : 414
% 0.23/1.42 # Current number of unprocessed clauses: 901
% 0.23/1.42 # ...number of literals in the above : 3929
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 98
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 217045
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 124207
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2376
% 0.23/1.42 # Unit Clause-clause subsumption calls : 491
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 4
% 0.23/1.42 # BW rewrite match successes : 4
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 43569
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.164 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.165 s
% 0.23/1.42 # Maximum resident set size: 5008 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: CPU time limit exceeded, terminating
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.51 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53 eprover: No such file or directory
% 0.23/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53 eprover: No such file or directory
%------------------------------------------------------------------------------