TSTP Solution File: SWC384+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC384+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:28:25 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 11 unt; 0 def)
% Number of atoms : 217 ( 78 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 257 ( 86 ~; 105 |; 42 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 33 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( singletonP(X1)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( singletonP(X1)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_7,negated_conjecture,
! [X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| ssList(esk6_0) )
& ( nil = esk3_0
| ssList(esk6_0) )
& ( nil = esk4_0
| ssList(esk7_0) )
& ( nil = esk3_0
| ssList(esk7_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk4_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk3_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk4_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( ~ singletonP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ) ),
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_6])])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X5] :
( ( ssItem(esk10_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk10_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) ) ),
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)],[ax4])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| nil = esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk1_0
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
fof(c_0_15,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk9_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk8_2(X5,X6),X6),esk9_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
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)],[ax7])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( app(app(esk6_0,esk3_0),esk7_0) = esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ssList(esk6_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( ssList(esk7_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
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)],[ax21])])])])]) ).
cnf(c_0_21,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ singletonP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk1_0
| singletonP(X1)
| esk1_0 != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( app(app(esk6_0,esk1_0),esk7_0) = esk2_0
| nil = esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10]),c_0_10]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk1_0
| ssList(esk6_0) ),
inference(rw,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk1_0
| ssList(esk7_0) ),
inference(rw,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_30,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| nil = esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17]),c_0_10]) ).
cnf(c_0_32,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk2_0
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( nil = esk1_0
| ~ segmentP(esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_35,negated_conjecture,
( nil = esk1_0
| segmentP(X1,esk1_0)
| esk2_0 != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),c_0_28]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_37,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
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)],[ax15])])])])])]) ).
cnf(c_0_38,negated_conjecture,
( nil = esk2_0
| nil != esk1_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
nil = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39])]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
neq(esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_39]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC384+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 16:51:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.024 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 46
% 0.25/1.44 # Proof object clause steps : 34
% 0.25/1.44 # Proof object formula steps : 12
% 0.25/1.44 # Proof object conjectures : 31
% 0.25/1.44 # Proof object clause conjectures : 28
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 18
% 0.25/1.44 # Proof object initial formulas used : 6
% 0.25/1.44 # Proof object generating inferences : 6
% 0.25/1.44 # Proof object simplifying inferences : 31
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 96
% 0.25/1.44 # Removed by relevancy pruning/SinE : 55
% 0.25/1.44 # Initial clauses : 86
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 86
% 0.25/1.44 # Processed clauses : 282
% 0.25/1.44 # ...of these trivial : 7
% 0.25/1.44 # ...subsumed : 94
% 0.25/1.44 # ...remaining for further processing : 181
% 0.25/1.44 # Other redundant clauses eliminated : 7
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 11
% 0.25/1.44 # Backward-rewritten : 108
% 0.25/1.44 # Generated clauses : 1671
% 0.25/1.44 # ...of the previous two non-trivial : 1507
% 0.25/1.44 # Contextual simplify-reflections : 160
% 0.25/1.44 # Paramodulations : 1655
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 16
% 0.25/1.44 # Current number of processed clauses : 58
% 0.25/1.44 # Positive orientable unit clauses : 8
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 2
% 0.25/1.44 # Non-unit-clauses : 48
% 0.25/1.44 # Current number of unprocessed clauses: 185
% 0.25/1.44 # ...number of literals in the above : 1073
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 119
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 5112
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 2146
% 0.25/1.44 # Non-unit clause-clause subsumptions : 265
% 0.25/1.44 # Unit Clause-clause subsumption calls : 17
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 2
% 0.25/1.44 # BW rewrite match successes : 2
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 33188
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.118 s
% 0.25/1.44 # System time : 0.005 s
% 0.25/1.44 # Total time : 0.123 s
% 0.25/1.44 # Maximum resident set size: 4536 pages
%------------------------------------------------------------------------------