TSTP Solution File: SWV370+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV370+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:21 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 7 unt; 0 def)
% Number of atoms : 98 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 93 ( 34 ~; 42 |; 8 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 120 ( 35 sgn 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l6_co,conjecture,
! [X1] :
( ! [X2,X3,X4] :
( contains_cpq(triple(X2,X1,X3),X4)
<=> contains_pq(i(triple(X2,X1,X3)),X4) )
=> ! [X5,X6,X7,X8,X9] :
( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
<=> contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l6_co) ).
fof(ax55,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax55) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(ax9,axiom,
! [X1,X2,X3] :
( contains_pq(insert_pq(X1,X2),X3)
<=> ( contains_pq(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax9) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4] :
( contains_cpq(triple(X2,X1,X3),X4)
<=> contains_pq(i(triple(X2,X1,X3)),X4) )
=> ! [X5,X6,X7,X8,X9] :
( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
<=> contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ),
inference(assume_negation,[status(cth)],[l6_co]) ).
fof(c_0_6,negated_conjecture,
! [X11,X12,X13,X11,X12,X13] :
( ( ~ contains_cpq(triple(X11,esk1_0,X12),X13)
| contains_pq(i(triple(X11,esk1_0,X12)),X13) )
& ( ~ contains_pq(i(triple(X11,esk1_0,X12)),X13)
| contains_cpq(triple(X11,esk1_0,X12),X13) )
& ( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) )
& ( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) ) ),
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_5])])])])])]) ).
fof(c_0_7,plain,
! [X6,X7,X8,X9,X10] : i(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) = insert_pq(i(triple(X6,X7,X8)),X9),
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X6,X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])])])]) ).
cnf(c_0_9,negated_conjecture,
( contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0)
| contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ contains_pq(insert_pq(X4,X5),X6)
| contains_pq(X4,X6)
| X5 = X6 )
& ( ~ contains_pq(X4,X6)
| contains_pq(insert_pq(X4,X5),X6) )
& ( X5 != X6
| contains_pq(insert_pq(X4,X5),X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9])])])])]) ).
cnf(c_0_12,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0)
| ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( contains_cpq(triple(X1,esk1_0,X2),X3)
| ~ contains_pq(i(triple(X1,esk1_0,X2)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( X1 = X2
| contains_pq(X3,X2)
| ~ contains_pq(insert_pq(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ~ contains_slb(X5,X7)
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) )
& ( X6 != X7
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(rw,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_20,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( contains_pq(i(triple(X1,esk1_0,X2)),X3)
| ~ contains_cpq(triple(X1,esk1_0,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( contains_slb(esk1_0,X1)
| ~ contains_pq(i(triple(X2,esk1_0,X3)),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( contains_pq(insert_pq(X1,X2),X3)
| ~ contains_pq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
( contains_pq(i(triple(X1,esk1_0,X2)),X3)
| ~ contains_slb(esk1_0,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(esk1_0,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| ~ contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( esk6_0 = esk4_0
| contains_pq(i(triple(X1,esk1_0,X2)),esk6_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( esk6_0 = esk4_0
| ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,plain,
( contains_pq(insert_pq(X1,X2),X3)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,negated_conjecture,
esk6_0 = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28]) ).
cnf(c_0_36,plain,
contains_slb(insert_slb(X1,pair(X2,X3)),X2),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
contains_pq(insert_pq(X1,X2),X2),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_35]),c_0_36]),c_0_35]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV370+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n007.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 : Wed Jun 15 00:35:25 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 39
% 0.24/1.41 # Proof object clause steps : 28
% 0.24/1.41 # Proof object formula steps : 11
% 0.24/1.41 # Proof object conjectures : 20
% 0.24/1.41 # Proof object clause conjectures : 17
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 13
% 0.24/1.41 # Proof object initial formulas used : 5
% 0.24/1.41 # Proof object generating inferences : 10
% 0.24/1.41 # Proof object simplifying inferences : 11
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 63
% 0.24/1.41 # Removed by relevancy pruning/SinE : 56
% 0.24/1.41 # Initial clauses : 15
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 15
% 0.24/1.41 # Processed clauses : 33
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 2
% 0.24/1.41 # ...remaining for further processing : 31
% 0.24/1.41 # Other redundant clauses eliminated : 2
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 1
% 0.24/1.41 # Backward-rewritten : 10
% 0.24/1.41 # Generated clauses : 74
% 0.24/1.41 # ...of the previous two non-trivial : 65
% 0.24/1.41 # Contextual simplify-reflections : 2
% 0.24/1.41 # Paramodulations : 72
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 2
% 0.24/1.41 # Current number of processed clauses : 18
% 0.24/1.41 # Positive orientable unit clauses : 5
% 0.24/1.41 # Positive unorientable unit clauses: 2
% 0.24/1.41 # Negative unit clauses : 1
% 0.24/1.41 # Non-unit-clauses : 10
% 0.24/1.41 # Current number of unprocessed clauses: 45
% 0.24/1.41 # ...number of literals in the above : 57
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 11
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 62
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 60
% 0.24/1.41 # Non-unit clause-clause subsumptions : 4
% 0.24/1.41 # Unit Clause-clause subsumption calls : 9
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 8
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 2386
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.016 s
% 0.24/1.41 # System time : 0.004 s
% 0.24/1.41 # Total time : 0.020 s
% 0.24/1.41 # Maximum resident set size: 3108 pages
%------------------------------------------------------------------------------