TSTP Solution File: SWV416+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV416+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:32 EDT 2022
% Result : Theorem 0.25s 1.41s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 42 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 11 |; 6 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 38 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co3,conjecture,
! [X1,X2,X3,X4] :
( pi_remove(triple(X1,X2,X3),X4)
=> ( phi(remove_cpq(triple(X1,X2,X3),X4))
=> ( pi_sharp_remove(i(triple(X1,X2,X3)),X4)
& i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co3) ).
fof(ax57,axiom,
! [X1,X2] :
( pi_remove(X1,X2)
<=> pi_sharp_remove(i(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax57) ).
fof(ax56,axiom,
! [X1,X2] :
( pi_sharp_remove(X1,X2)
<=> contains_pq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax56) ).
fof(main3_li34,lemma,
! [X1,X2,X3,X4] :
( contains_pq(i(triple(X1,X2,X3)),X4)
=> i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main3_li34) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( pi_remove(triple(X1,X2,X3),X4)
=> ( phi(remove_cpq(triple(X1,X2,X3),X4))
=> ( pi_sharp_remove(i(triple(X1,X2,X3)),X4)
& i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4) ) ) ),
inference(assume_negation,[status(cth)],[co3]) ).
fof(c_0_5,plain,
! [X3,X4,X3,X4] :
( ( ~ pi_remove(X3,X4)
| pi_sharp_remove(i(X3),X4) )
& ( ~ pi_sharp_remove(i(X3),X4)
| pi_remove(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])])]) ).
fof(c_0_6,negated_conjecture,
( pi_remove(triple(esk1_0,esk2_0,esk3_0),esk4_0)
& phi(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ( ~ pi_sharp_remove(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0)
| i(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != remove_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( ~ pi_sharp_remove(X3,X4)
| contains_pq(X3,X4) )
& ( ~ contains_pq(X3,X4)
| pi_sharp_remove(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_8,lemma,
! [X5,X6,X7,X8] :
( ~ contains_pq(i(triple(X5,X6,X7)),X8)
| i(remove_cpq(triple(X5,X6,X7),X8)) = remove_pq(i(triple(X5,X6,X7)),X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[main3_li34])]) ).
cnf(c_0_9,plain,
( pi_sharp_remove(i(X1),X2)
| ~ pi_remove(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
pi_remove(triple(esk1_0,esk2_0,esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( i(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != remove_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0)
| ~ pi_sharp_remove(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( pi_sharp_remove(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,lemma,
( i(remove_cpq(triple(X1,X2,X3),X4)) = remove_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_pq(i(triple(X1,X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_remove(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
pi_sharp_remove(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ contains_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV416+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.14/0.33 % Computer : n012.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue Jun 14 16:11:10 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.41 # Preprocessing time : 0.018 s
% 0.25/1.41
% 0.25/1.41 # Proof found!
% 0.25/1.41 # SZS status Theorem
% 0.25/1.41 # SZS output start CNFRefutation
% See solution above
% 0.25/1.41 # Proof object total steps : 18
% 0.25/1.41 # Proof object clause steps : 9
% 0.25/1.41 # Proof object formula steps : 9
% 0.25/1.41 # Proof object conjectures : 8
% 0.25/1.41 # Proof object clause conjectures : 5
% 0.25/1.41 # Proof object formula conjectures : 3
% 0.25/1.41 # Proof object initial clauses used : 6
% 0.25/1.41 # Proof object initial formulas used : 4
% 0.25/1.41 # Proof object generating inferences : 3
% 0.25/1.41 # Proof object simplifying inferences : 2
% 0.25/1.41 # Training examples: 0 positive, 0 negative
% 0.25/1.41 # Parsed axioms : 65
% 0.25/1.41 # Removed by relevancy pruning/SinE : 29
% 0.25/1.41 # Initial clauses : 50
% 0.25/1.41 # Removed in clause preprocessing : 0
% 0.25/1.41 # Initial clauses in saturation : 50
% 0.25/1.41 # Processed clauses : 53
% 0.25/1.41 # ...of these trivial : 0
% 0.25/1.41 # ...subsumed : 0
% 0.25/1.41 # ...remaining for further processing : 53
% 0.25/1.41 # Other redundant clauses eliminated : 2
% 0.25/1.41 # Clauses deleted for lack of memory : 0
% 0.25/1.41 # Backward-subsumed : 0
% 0.25/1.41 # Backward-rewritten : 1
% 0.25/1.41 # Generated clauses : 72
% 0.25/1.41 # ...of the previous two non-trivial : 60
% 0.25/1.41 # Contextual simplify-reflections : 3
% 0.25/1.41 # Paramodulations : 68
% 0.25/1.41 # Factorizations : 2
% 0.25/1.41 # Equation resolutions : 2
% 0.25/1.41 # Current number of processed clauses : 50
% 0.25/1.41 # Positive orientable unit clauses : 11
% 0.25/1.41 # Positive unorientable unit clauses: 3
% 0.25/1.41 # Negative unit clauses : 3
% 0.25/1.41 # Non-unit-clauses : 33
% 0.25/1.41 # Current number of unprocessed clauses: 55
% 0.25/1.41 # ...number of literals in the above : 117
% 0.25/1.41 # Current number of archived formulas : 0
% 0.25/1.41 # Current number of archived clauses : 1
% 0.25/1.41 # Clause-clause subsumption calls (NU) : 148
% 0.25/1.41 # Rec. Clause-clause subsumption calls : 96
% 0.25/1.41 # Non-unit clause-clause subsumptions : 3
% 0.25/1.41 # Unit Clause-clause subsumption calls : 8
% 0.25/1.41 # Rewrite failures with RHS unbound : 10
% 0.25/1.41 # BW rewrite match attempts : 5
% 0.25/1.41 # BW rewrite match successes : 3
% 0.25/1.41 # Condensation attempts : 0
% 0.25/1.41 # Condensation successes : 0
% 0.25/1.41 # Termbank termtop insertions : 4420
% 0.25/1.41
% 0.25/1.41 # -------------------------------------------------
% 0.25/1.41 # User time : 0.018 s
% 0.25/1.41 # System time : 0.004 s
% 0.25/1.41 # Total time : 0.022 s
% 0.25/1.41 # Maximum resident set size: 3156 pages
%------------------------------------------------------------------------------