TSTP Solution File: SWV397+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 18:16:27 EDT 2022
% Result : Theorem 0.17s 1.35s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 19 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 2 |; 1 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 26 ( 3 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l33_co,conjecture,
! [X1,X2,X3,X4] :
( ok(remove_cpq(triple(X1,X2,X3),X4))
=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l33_co) ).
fof(ax43,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ok(remove_cpq(triple(X1,X2,X3),X4))
=> contains_slb(X2,X4) ),
inference(assume_negation,[status(cth)],[l33_co]) ).
fof(c_0_4,negated_conjecture,
( ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ~ contains_slb(esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8] :
( contains_slb(X6,X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])]) ).
fof(c_0_6,plain,
! [X3,X4] : ~ ok(triple(X3,X4,bad)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])]) ).
cnf(c_0_7,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ contains_slb(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.09 % Command : run_ET %s %d
% 0.09/0.29 % Computer : n026.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Wed Jun 15 19:00:22 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.17/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.35 # Preprocessing time : 0.014 s
% 0.17/1.35
% 0.17/1.35 # Proof found!
% 0.17/1.35 # SZS status Theorem
% 0.17/1.35 # SZS output start CNFRefutation
% See solution above
% 0.17/1.35 # Proof object total steps : 12
% 0.17/1.35 # Proof object clause steps : 5
% 0.17/1.35 # Proof object formula steps : 7
% 0.17/1.35 # Proof object conjectures : 6
% 0.17/1.35 # Proof object clause conjectures : 3
% 0.17/1.35 # Proof object formula conjectures : 3
% 0.17/1.35 # Proof object initial clauses used : 4
% 0.17/1.35 # Proof object initial formulas used : 3
% 0.17/1.35 # Proof object generating inferences : 1
% 0.17/1.35 # Proof object simplifying inferences : 2
% 0.17/1.35 # Training examples: 0 positive, 0 negative
% 0.17/1.35 # Parsed axioms : 42
% 0.17/1.35 # Removed by relevancy pruning/SinE : 32
% 0.17/1.35 # Initial clauses : 13
% 0.17/1.35 # Removed in clause preprocessing : 0
% 0.17/1.35 # Initial clauses in saturation : 13
% 0.17/1.35 # Processed clauses : 14
% 0.17/1.35 # ...of these trivial : 0
% 0.17/1.35 # ...subsumed : 0
% 0.17/1.35 # ...remaining for further processing : 13
% 0.17/1.35 # Other redundant clauses eliminated : 1
% 0.17/1.35 # Clauses deleted for lack of memory : 0
% 0.17/1.35 # Backward-subsumed : 0
% 0.17/1.35 # Backward-rewritten : 0
% 0.17/1.35 # Generated clauses : 5
% 0.17/1.35 # ...of the previous two non-trivial : 4
% 0.17/1.35 # Contextual simplify-reflections : 0
% 0.17/1.35 # Paramodulations : 4
% 0.17/1.35 # Factorizations : 0
% 0.17/1.35 # Equation resolutions : 1
% 0.17/1.35 # Current number of processed clauses : 12
% 0.17/1.35 # Positive orientable unit clauses : 3
% 0.17/1.35 # Positive unorientable unit clauses: 0
% 0.17/1.35 # Negative unit clauses : 3
% 0.17/1.35 # Non-unit-clauses : 6
% 0.17/1.35 # Current number of unprocessed clauses: 3
% 0.17/1.35 # ...number of literals in the above : 6
% 0.17/1.35 # Current number of archived formulas : 0
% 0.17/1.35 # Current number of archived clauses : 0
% 0.17/1.35 # Clause-clause subsumption calls (NU) : 0
% 0.17/1.35 # Rec. Clause-clause subsumption calls : 0
% 0.17/1.35 # Non-unit clause-clause subsumptions : 0
% 0.17/1.35 # Unit Clause-clause subsumption calls : 1
% 0.17/1.35 # Rewrite failures with RHS unbound : 0
% 0.17/1.35 # BW rewrite match attempts : 0
% 0.17/1.35 # BW rewrite match successes : 0
% 0.17/1.35 # Condensation attempts : 0
% 0.17/1.35 # Condensation successes : 0
% 0.17/1.35 # Termbank termtop insertions : 1143
% 0.17/1.35
% 0.17/1.35 # -------------------------------------------------
% 0.17/1.35 # User time : 0.012 s
% 0.17/1.35 # System time : 0.003 s
% 0.17/1.35 # Total time : 0.015 s
% 0.17/1.35 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------