TSTP Solution File: SWV383+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:24 EDT 2022
% Result : Theorem 0.26s 1.42s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 45 ( 22 ~; 13 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l19_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l19_co) ).
fof(l19_l20,lemma,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l19_l20) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
inference(assume_negation,[status(cth)],[l19_co]) ).
fof(c_0_3,lemma,
! [X7,X8,X9,X10,X11,X12] :
( ( check_cpq(triple(X7,X8,X9))
| ~ succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) )
& ( ok(triple(X7,X8,X9))
| ~ succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) ) ),
inference(distribute,[status(thm)],[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)],[inference(fof_simplification,[status(thm)],[l19_l20])])])])])])]) ).
fof(c_0_4,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
& ok(triple(esk4_0,esk5_0,esk6_0))
& check_cpq(triple(esk4_0,esk5_0,esk6_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_2])])])])])]) ).
cnf(c_0_5,lemma,
( check_cpq(triple(X4,X5,X6))
| ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3))
| ~ succ_cpq(triple(X4,X5,X6),triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n012.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 : Wed Jun 15 23:27:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.26/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.42 # Preprocessing time : 0.018 s
% 0.26/1.42
% 0.26/1.42 # Proof found!
% 0.26/1.42 # SZS status Theorem
% 0.26/1.42 # SZS output start CNFRefutation
% See solution above
% 0.26/1.42 # Proof object total steps : 11
% 0.26/1.42 # Proof object clause steps : 6
% 0.26/1.42 # Proof object formula steps : 5
% 0.26/1.42 # Proof object conjectures : 8
% 0.26/1.42 # Proof object clause conjectures : 5
% 0.26/1.42 # Proof object formula conjectures : 3
% 0.26/1.42 # Proof object initial clauses used : 5
% 0.26/1.42 # Proof object initial formulas used : 2
% 0.26/1.42 # Proof object generating inferences : 1
% 0.26/1.42 # Proof object simplifying inferences : 4
% 0.26/1.42 # Training examples: 0 positive, 0 negative
% 0.26/1.42 # Parsed axioms : 43
% 0.26/1.42 # Removed by relevancy pruning/SinE : 15
% 0.26/1.42 # Initial clauses : 37
% 0.26/1.42 # Removed in clause preprocessing : 0
% 0.26/1.42 # Initial clauses in saturation : 37
% 0.26/1.42 # Processed clauses : 24
% 0.26/1.42 # ...of these trivial : 0
% 0.26/1.42 # ...subsumed : 0
% 0.26/1.42 # ...remaining for further processing : 24
% 0.26/1.42 # Other redundant clauses eliminated : 0
% 0.26/1.42 # Clauses deleted for lack of memory : 0
% 0.26/1.42 # Backward-subsumed : 0
% 0.26/1.42 # Backward-rewritten : 0
% 0.26/1.42 # Generated clauses : 10
% 0.26/1.42 # ...of the previous two non-trivial : 4
% 0.26/1.42 # Contextual simplify-reflections : 1
% 0.26/1.42 # Paramodulations : 8
% 0.26/1.42 # Factorizations : 2
% 0.26/1.42 # Equation resolutions : 0
% 0.26/1.42 # Current number of processed clauses : 24
% 0.26/1.42 # Positive orientable unit clauses : 10
% 0.26/1.42 # Positive unorientable unit clauses: 0
% 0.26/1.42 # Negative unit clauses : 3
% 0.26/1.42 # Non-unit-clauses : 11
% 0.26/1.42 # Current number of unprocessed clauses: 17
% 0.26/1.42 # ...number of literals in the above : 47
% 0.26/1.42 # Current number of archived formulas : 0
% 0.26/1.42 # Current number of archived clauses : 0
% 0.26/1.42 # Clause-clause subsumption calls (NU) : 29
% 0.26/1.42 # Rec. Clause-clause subsumption calls : 22
% 0.26/1.42 # Non-unit clause-clause subsumptions : 1
% 0.26/1.42 # Unit Clause-clause subsumption calls : 1
% 0.26/1.42 # Rewrite failures with RHS unbound : 0
% 0.26/1.42 # BW rewrite match attempts : 0
% 0.26/1.42 # BW rewrite match successes : 0
% 0.26/1.42 # Condensation attempts : 0
% 0.26/1.42 # Condensation successes : 0
% 0.26/1.42 # Termbank termtop insertions : 2780
% 0.26/1.42
% 0.26/1.42 # -------------------------------------------------
% 0.26/1.42 # User time : 0.017 s
% 0.26/1.42 # System time : 0.002 s
% 0.26/1.42 # Total time : 0.019 s
% 0.26/1.42 # Maximum resident set size: 3056 pages
%------------------------------------------------------------------------------