%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC149+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %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 : 300s
% DateTime : Tue May 5 05:18:29 PM UTC 2026
% Result : Theorem 133.94s 84.94s
% Output : CNFRefutation 134.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 9 unt; 0 def)
% Number of atoms : 212 ( 60 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 259 ( 106 ~; 108 |; 22 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 38 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(app(cons(X5,nil),cons(X6,nil)),X7) = X4 ) ) )
| singletonP(X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
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(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_9,plain,
! [X336,X337] :
( ~ ssList(X336)
| ~ ssItem(X337)
| hd(cons(X337,X336)) = X337 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
fof(c_0_10,plain,
! [X228,X230] :
( ( ssItem(esk5_1(X228))
| ~ singletonP(X228)
| ~ ssList(X228) )
& ( cons(esk5_1(X228),nil) = X228
| ~ singletonP(X228)
| ~ ssList(X228) )
& ( ~ ssItem(X230)
| cons(X230,nil) != X228
| singletonP(X228)
| ~ ssList(X228) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
cnf(c_0_11,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X322,X323] :
( ~ ssList(X322)
| ~ ssItem(X323)
| ssList(cons(X323,X322)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_17,plain,
( esk5_1(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,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] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(app(cons(X5,nil),cons(X6,nil)),X7) = X4 ) ) )
| singletonP(X2) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_21,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_22,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_23,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
fof(c_0_24,negated_conjecture,
! [X466,X467,X468] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssItem(X466)
| ~ ssItem(X467)
| ~ ssList(X468)
| app(app(cons(X466,nil),cons(X467,nil)),X468) != esk51_0 )
& ~ singletonP(esk49_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_25,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,plain,
! [X433,X434,X435] :
( ~ ssList(X433)
| ~ ssList(X434)
| ~ ssList(X435)
| app(app(X433,X434),X435) = app(X433,app(X434,X435)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_30,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_13])]) ).
cnf(c_0_31,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_13])]) ).
cnf(c_0_32,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_13])]),c_0_31]) ).
fof(c_0_35,plain,
! [X431,X432] :
( ~ ssList(X431)
| ~ ssItem(X432)
| cons(X432,X431) = app(cons(X432,nil),X431) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_36,negated_conjecture,
( app(cons(X1,nil),app(cons(X2,nil),X3)) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_34]) ).
cnf(c_0_37,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_38,plain,
! [X330] :
( ( ssList(esk44_1(X330))
| nil = X330
| ~ ssList(X330) )
& ( ssItem(esk45_1(X330))
| nil = X330
| ~ ssList(X330) )
& ( cons(esk45_1(X330),esk44_1(X330)) = X330
| nil = X330
| ~ ssList(X330) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_39,negated_conjecture,
( app(cons(X1,nil),cons(X2,X3)) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_41,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( nil = X1
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( nil = X1
| cons(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_46,negated_conjecture,
( esk44_1(esk49_0) = nil
| esk49_0 = nil
| ~ ssList(esk44_1(esk49_0))
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_40])]),c_0_45])]) ).
cnf(c_0_47,negated_conjecture,
( esk44_1(esk49_0) = nil
| esk49_0 = nil
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
( esk44_1(esk49_0) = nil
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk45_1(esk49_0),nil) = esk49_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_48]),c_0_45])]) ).
cnf(c_0_50,negated_conjecture,
~ singletonP(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_51,plain,
! [X320,X321] :
( ( ~ neq(X320,X321)
| X320 != X321
| ~ ssList(X321)
| ~ ssList(X320) )
& ( X320 = X321
| neq(X320,X321)
| ~ ssList(X321)
| ~ ssList(X320) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_52,negated_conjecture,
( esk49_0 = nil
| ~ ssItem(esk45_1(esk49_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_49]),c_0_50]) ).
cnf(c_0_53,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_54,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_55,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_45])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC149+1 : TPTP v9.2.1. Released v2.4.0.
% 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34 % Computer : n005.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 04:30:15 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.21/0.36 % start to proof: theBenchmark
% 133.94/84.94 % Version : CSE_E---1.7
% 133.94/84.94 % Problem : theBenchmark.p
% 133.94/84.94 % SZS status Theorem for theBenchmark.p
% 133.94/84.94 % SZS output start CNFRefutation
% See solution above
% 134.44/85.48 % Total time : 62.604s
%------------------------------------------------------------------------------