TSTP Solution File: PRO011+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO011+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:45:01 EDT 2022
% Result : Theorem 0.26s 1.45s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 49 ( 7 avg)
% Number of connectives : 143 ( 43 ~; 51 |; 41 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 5 sgn 13 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( leaf_occ(X108,X106)
& ( occurrence_of(X108,tptp1)
=> ~ ? [X109] :
( occurrence_of(X109,tptp2)
& subactivity_occurrence(X109,X106)
& min_precedes(X107,X109,tptp0) ) )
& ( occurrence_of(X108,tptp2)
=> ~ ? [X110] :
( occurrence_of(X110,tptp1)
& subactivity_occurrence(X110,X106)
& min_precedes(X107,X110,tptp0) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(sos_09,axiom,
! [X32,X33,X34] :
( ( occurrence_of(X32,X34)
& leaf_occ(X33,X32) )
=> ~ ? [X35] : min_precedes(X33,X35,X34) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_09) ).
fof(sos_32,axiom,
! [X102] :
( occurrence_of(X102,tptp0)
=> ? [X103,X104,X105] :
( occurrence_of(X103,tptp3)
& root_occ(X103,X102)
& occurrence_of(X104,tptp4)
& next_subocc(X103,X104,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& next_subocc(X104,X105,tptp0)
& leaf_occ(X105,X102) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).
fof(c_0_3,negated_conjecture,
~ ! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( leaf_occ(X108,X106)
& ( occurrence_of(X108,tptp1)
=> ~ ? [X109] :
( occurrence_of(X109,tptp2)
& subactivity_occurrence(X109,X106)
& min_precedes(X107,X109,tptp0) ) )
& ( occurrence_of(X108,tptp2)
=> ~ ? [X110] :
( occurrence_of(X110,tptp1)
& subactivity_occurrence(X110,X106)
& min_precedes(X107,X110,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,plain,
! [X36,X37,X38,X39] :
( ~ occurrence_of(X36,X38)
| ~ leaf_occ(X37,X36)
| ~ min_precedes(X37,X39,X38) ),
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)],[sos_09])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X112,X113] :
( occurrence_of(esk1_0,tptp0)
& ( occurrence_of(X113,tptp2)
| occurrence_of(X113,tptp1)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(esk3_2(X112,X113),tptp1)
| occurrence_of(X113,tptp1)
| ~ leaf_occ(X113,esk1_0) )
& ( subactivity_occurrence(esk3_2(X112,X113),esk1_0)
| occurrence_of(X113,tptp1)
| ~ leaf_occ(X113,esk1_0) )
& ( min_precedes(X112,esk3_2(X112,X113),tptp0)
| occurrence_of(X113,tptp1)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(X113,tptp2)
| occurrence_of(esk2_2(X112,X113),tptp2)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(esk3_2(X112,X113),tptp1)
| occurrence_of(esk2_2(X112,X113),tptp2)
| ~ leaf_occ(X113,esk1_0) )
& ( subactivity_occurrence(esk3_2(X112,X113),esk1_0)
| occurrence_of(esk2_2(X112,X113),tptp2)
| ~ leaf_occ(X113,esk1_0) )
& ( min_precedes(X112,esk3_2(X112,X113),tptp0)
| occurrence_of(esk2_2(X112,X113),tptp2)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(X113,tptp2)
| subactivity_occurrence(esk2_2(X112,X113),esk1_0)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(esk3_2(X112,X113),tptp1)
| subactivity_occurrence(esk2_2(X112,X113),esk1_0)
| ~ leaf_occ(X113,esk1_0) )
& ( subactivity_occurrence(esk3_2(X112,X113),esk1_0)
| subactivity_occurrence(esk2_2(X112,X113),esk1_0)
| ~ leaf_occ(X113,esk1_0) )
& ( min_precedes(X112,esk3_2(X112,X113),tptp0)
| subactivity_occurrence(esk2_2(X112,X113),esk1_0)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(X113,tptp2)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| ~ leaf_occ(X113,esk1_0) )
& ( occurrence_of(esk3_2(X112,X113),tptp1)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| ~ leaf_occ(X113,esk1_0) )
& ( subactivity_occurrence(esk3_2(X112,X113),esk1_0)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| ~ leaf_occ(X113,esk1_0) )
& ( min_precedes(X112,esk3_2(X112,X113),tptp0)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| ~ leaf_occ(X113,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_3])])])])])])]) ).
cnf(c_0_6,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf_occ(X1,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( min_precedes(X2,esk2_2(X2,X1),tptp0)
| min_precedes(X2,esk3_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X106] :
( ( occurrence_of(esk5_1(X106),tptp3)
| ~ occurrence_of(X106,tptp0) )
& ( root_occ(esk5_1(X106),X106)
| ~ occurrence_of(X106,tptp0) )
& ( occurrence_of(esk6_1(X106),tptp4)
| ~ occurrence_of(X106,tptp0) )
& ( next_subocc(esk5_1(X106),esk6_1(X106),tptp0)
| ~ occurrence_of(X106,tptp0) )
& ( occurrence_of(esk7_1(X106),tptp1)
| occurrence_of(esk7_1(X106),tptp2)
| ~ occurrence_of(X106,tptp0) )
& ( next_subocc(esk6_1(X106),esk7_1(X106),tptp0)
| ~ occurrence_of(X106,tptp0) )
& ( leaf_occ(esk7_1(X106),X106)
| ~ occurrence_of(X106,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])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| ~ leaf_occ(X2,X3)
| ~ occurrence_of(X3,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_10,plain,
( leaf_occ(esk7_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_13,negated_conjecture,
~ occurrence_of(X1,tptp0),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : PRO011+4 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 03:17:11 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.45 # Preprocessing time : 0.021 s
% 0.26/1.45
% 0.26/1.45 # Proof found!
% 0.26/1.45 # SZS status Theorem
% 0.26/1.45 # SZS output start CNFRefutation
% See solution above
% 0.26/1.45 # Proof object total steps : 15
% 0.26/1.45 # Proof object clause steps : 8
% 0.26/1.45 # Proof object formula steps : 7
% 0.26/1.45 # Proof object conjectures : 9
% 0.26/1.45 # Proof object clause conjectures : 6
% 0.26/1.45 # Proof object formula conjectures : 3
% 0.26/1.45 # Proof object initial clauses used : 4
% 0.26/1.45 # Proof object initial formulas used : 3
% 0.26/1.45 # Proof object generating inferences : 3
% 0.26/1.45 # Proof object simplifying inferences : 4
% 0.26/1.45 # Training examples: 0 positive, 0 negative
% 0.26/1.45 # Parsed axioms : 46
% 0.26/1.45 # Removed by relevancy pruning/SinE : 12
% 0.26/1.45 # Initial clauses : 71
% 0.26/1.45 # Removed in clause preprocessing : 0
% 0.26/1.45 # Initial clauses in saturation : 71
% 0.26/1.45 # Processed clauses : 103
% 0.26/1.45 # ...of these trivial : 2
% 0.26/1.45 # ...subsumed : 2
% 0.26/1.45 # ...remaining for further processing : 99
% 0.26/1.45 # Other redundant clauses eliminated : 0
% 0.26/1.45 # Clauses deleted for lack of memory : 0
% 0.26/1.45 # Backward-subsumed : 6
% 0.26/1.45 # Backward-rewritten : 4
% 0.26/1.45 # Generated clauses : 169
% 0.26/1.45 # ...of the previous two non-trivial : 154
% 0.26/1.45 # Contextual simplify-reflections : 4
% 0.26/1.45 # Paramodulations : 168
% 0.26/1.45 # Factorizations : 0
% 0.26/1.45 # Equation resolutions : 0
% 0.26/1.45 # Current number of processed clauses : 88
% 0.26/1.45 # Positive orientable unit clauses : 12
% 0.26/1.45 # Positive unorientable unit clauses: 0
% 0.26/1.45 # Negative unit clauses : 9
% 0.26/1.45 # Non-unit-clauses : 67
% 0.26/1.45 # Current number of unprocessed clauses: 116
% 0.26/1.45 # ...number of literals in the above : 455
% 0.26/1.45 # Current number of archived formulas : 0
% 0.26/1.45 # Current number of archived clauses : 11
% 0.26/1.45 # Clause-clause subsumption calls (NU) : 985
% 0.26/1.45 # Rec. Clause-clause subsumption calls : 686
% 0.26/1.45 # Non-unit clause-clause subsumptions : 10
% 0.26/1.45 # Unit Clause-clause subsumption calls : 161
% 0.26/1.45 # Rewrite failures with RHS unbound : 0
% 0.26/1.45 # BW rewrite match attempts : 4
% 0.26/1.45 # BW rewrite match successes : 4
% 0.26/1.45 # Condensation attempts : 0
% 0.26/1.45 # Condensation successes : 0
% 0.26/1.45 # Termbank termtop insertions : 6009
% 0.26/1.45
% 0.26/1.45 # -------------------------------------------------
% 0.26/1.45 # User time : 0.031 s
% 0.26/1.45 # System time : 0.004 s
% 0.26/1.45 # Total time : 0.035 s
% 0.26/1.45 # Maximum resident set size: 3440 pages
% 0.26/23.47 eprover: CPU time limit exceeded, terminating
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.52 eprover: No such file or directory
% 0.26/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.52 eprover: No such file or directory
% 0.26/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.53 eprover: No such file or directory
% 0.26/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.54 eprover: No such file or directory
% 0.26/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.54 eprover: No such file or directory
%------------------------------------------------------------------------------