TSTP Solution File: SWC046+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC046+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : Tue Jul 19 20:26:21 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 146 ( 36 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 183 ( 68 ~; 72 |; 27 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
fof(c_0_6,negated_conjecture,
! [X11,X13] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk2_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssList(esk5_1(X11))
| memberP(esk3_0,X11)
| ~ memberP(esk4_0,X11)
| ~ ssItem(X11) )
& ( segmentP(esk4_0,app(app(cons(X11,nil),esk5_1(X11)),cons(X11,nil)))
| memberP(esk3_0,X11)
| ~ memberP(esk4_0,X11)
| ~ ssItem(X11) )
& ( memberP(esk4_0,X11)
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) )
& ( ~ ssList(X13)
| ~ segmentP(esk4_0,app(app(cons(X11,nil),X13),cons(X11,nil)))
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) ) ),
inference(distribute,[status(thm)],[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)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
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)],[ax37])])])])])]) ).
fof(c_0_8,plain,
! [X4] :
( ( ssList(esk8_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk9_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk9_1(X4),esk8_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
inference(distribute,[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)],[ax20])])])])])]) ).
cnf(c_0_9,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( memberP(esk4_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( memberP(cons(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( nil = X1
| cons(esk9_1(X1),esk8_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( nil = X1
| ssItem(esk9_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( nil = X1
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ~ memberP(esk2_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( memberP(esk2_0,X1)
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_20,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( cons(esk9_1(X1),esk8_1(X1)) = X1
| esk2_0 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_22,plain,
( esk2_0 = X1
| ssItem(esk9_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_23,plain,
( esk2_0 = X1
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_24,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( esk2_0 = X1
| memberP(X1,esk9_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
esk2_0 != esk1_0,
inference(rw,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_29,negated_conjecture,
~ ssItem(esk9_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC046+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 00:41:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.021 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 31
% 0.26/1.44 # Proof object clause steps : 22
% 0.26/1.44 # Proof object formula steps : 9
% 0.26/1.44 # Proof object conjectures : 14
% 0.26/1.44 # Proof object clause conjectures : 11
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 11
% 0.26/1.44 # Proof object initial formulas used : 4
% 0.26/1.44 # Proof object generating inferences : 4
% 0.26/1.44 # Proof object simplifying inferences : 16
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 96
% 0.26/1.44 # Removed by relevancy pruning/SinE : 68
% 0.26/1.44 # Initial clauses : 57
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 57
% 0.26/1.44 # Processed clauses : 661
% 0.26/1.44 # ...of these trivial : 17
% 0.26/1.44 # ...subsumed : 423
% 0.26/1.44 # ...remaining for further processing : 221
% 0.26/1.44 # Other redundant clauses eliminated : 59
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 7
% 0.26/1.44 # Backward-rewritten : 3
% 0.26/1.44 # Generated clauses : 5453
% 0.26/1.44 # ...of the previous two non-trivial : 4798
% 0.26/1.44 # Contextual simplify-reflections : 378
% 0.26/1.44 # Paramodulations : 5363
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 90
% 0.26/1.44 # Current number of processed clauses : 210
% 0.26/1.44 # Positive orientable unit clauses : 9
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 3
% 0.26/1.44 # Non-unit-clauses : 198
% 0.26/1.44 # Current number of unprocessed clauses: 4129
% 0.26/1.44 # ...number of literals in the above : 29686
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 10
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 23959
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 5300
% 0.26/1.44 # Non-unit clause-clause subsumptions : 808
% 0.26/1.44 # Unit Clause-clause subsumption calls : 45
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 3
% 0.26/1.44 # BW rewrite match successes : 3
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 104582
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.245 s
% 0.26/1.44 # System time : 0.005 s
% 0.26/1.44 # Total time : 0.250 s
% 0.26/1.44 # Maximum resident set size: 7144 pages
%------------------------------------------------------------------------------