%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV385+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : Wed Jul 20 18:16:25 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 43 ( 24 ~; 13 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l21_co,conjecture,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l21_co) ).
fof(l21_li1316,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l21_li1316) ).
fof(l21_li2225,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l21_li2225) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(assume_negation,[status(cth)],[l21_co]) ).
fof(c_0_4,lemma,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| ~ ok(im_succ_cpq(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[l21_li1316])])]) ).
fof(c_0_5,negated_conjecture,
( ( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ ok(triple(esk1_0,esk2_0,esk3_0)) )
& check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))
& ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,lemma,
! [X4,X5,X6] :
( check_cpq(triple(X4,X5,X6))
| ~ check_cpq(im_succ_cpq(triple(X4,X5,X6)))
| ~ ok(im_succ_cpq(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[l21_li2225])])]) ).
cnf(c_0_7,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
| ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
ok(triple(esk1_0,esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_10])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV385+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 19:00:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.018 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 15
% 0.24/1.42 # Proof object clause steps : 8
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 9
% 0.24/1.42 # Proof object clause conjectures : 6
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 5
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 6
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 44
% 0.24/1.42 # Removed by relevancy pruning/SinE : 15
% 0.24/1.42 # Initial clauses : 36
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 36
% 0.24/1.42 # Processed clauses : 41
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 39
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 1
% 0.24/1.42 # Generated clauses : 26
% 0.24/1.42 # ...of the previous two non-trivial : 21
% 0.24/1.42 # Contextual simplify-reflections : 2
% 0.24/1.42 # Paramodulations : 23
% 0.24/1.42 # Factorizations : 2
% 0.24/1.42 # Equation resolutions : 1
% 0.24/1.42 # Current number of processed clauses : 37
% 0.24/1.42 # Positive orientable unit clauses : 11
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 24
% 0.24/1.42 # Current number of unprocessed clauses: 15
% 0.24/1.42 # ...number of literals in the above : 49
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 1
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 84
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 54
% 0.24/1.42 # Non-unit clause-clause subsumptions : 3
% 0.24/1.42 # Unit Clause-clause subsumption calls : 2
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 3139
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.018 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.020 s
% 0.24/1.42 # Maximum resident set size: 3060 pages
%------------------------------------------------------------------------------