%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC308+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n018.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:19:07 PM UTC 2026
% Result : Theorem 1.47s 1.76s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 9 unt; 0 def)
% Number of atoms : 218 ( 86 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 280 ( 110 ~; 109 |; 38 &)
% ( 1 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X1 = X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X2) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) )
& neq(nil,X2) ) ) )
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) != X3
& app(cons(X9,nil),X10) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X1 = X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X2) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) )
& neq(nil,X2) ) ) )
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) != X3
& app(cons(X9,nil),X10) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
! [X472,X473,X474,X475,X476,X477] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssList(X472)
| esk48_0 != X472
| ~ ssList(X473)
| ~ ssList(X474)
| tl(esk49_0) != X473
| app(X473,X474) != X472
| ~ ssItem(X475)
| cons(X475,nil) != X474
| hd(esk49_0) != X475
| ~ neq(nil,esk49_0)
| ~ neq(nil,esk49_0) )
& ( ~ ssItem(X476)
| ~ ssList(X477)
| app(X477,cons(X476,nil)) = esk50_0
| app(cons(X476,nil),X477) != esk51_0 )
& ( nil = esk50_0
| nil != esk51_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ ssList(X1)
| esk48_0 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk49_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk49_0) != X4
| ~ neq(nil,esk49_0)
| ~ neq(nil,esk49_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X347,X348] :
( ~ ssList(X347)
| ~ ssList(X348)
| ssList(app(X347,X348)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_13,negated_conjecture,
( app(X2,cons(X1,nil)) = esk50_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X437,X438] :
( ~ ssList(X437)
| ~ ssItem(X438)
| cons(X438,X437) = app(cons(X438,nil),X437) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_16,negated_conjecture,
( esk48_0 != X1
| hd(esk49_0) != X4
| tl(esk49_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk49_0) ),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X344] :
( ~ ssList(X344)
| nil = X344
| ssList(tl(X344)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_20,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X430] :
( ~ ssList(X430)
| nil = X430
| cons(hd(X430),tl(X430)) = X430 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_23,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssList(tl(esk49_0))
| ~ neq(nil,esk49_0)
| ~ ssItem(hd(esk49_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])])])])]),c_0_18]) ).
cnf(c_0_24,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_26,plain,
! [X328,X329] :
( ~ ssList(X328)
| ~ ssItem(X329)
| ssList(cons(X329,X328)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_27,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| cons(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ neq(nil,esk49_0)
| ~ ssItem(hd(esk49_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_30,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_32,plain,
! [X341] :
( ~ ssList(X341)
| nil = X341
| ssItem(hd(X341)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_33,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk50_0
| esk49_0 = nil
| ~ ssList(tl(esk49_0))
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ neq(nil,esk49_0)
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk50_0
| esk49_0 = nil
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_25])]) ).
cnf(c_0_37,negated_conjecture,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ neq(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25])]) ).
cnf(c_0_38,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk50_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_25])]) ).
fof(c_0_39,plain,
! [X326,X327] :
( ( ~ neq(X326,X327)
| X326 != X327
| ~ ssList(X327)
| ~ ssList(X326) )
& ( X326 = X327
| neq(X326,X327)
| ~ ssList(X327)
| ~ ssList(X326) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_40,negated_conjecture,
( esk49_0 = nil
| ~ neq(nil,esk49_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_42,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]),c_0_31])]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC308+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n018.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:42:47 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.47/1.76 % Version : CSE_E---1.7
% 1.47/1.76 % Problem : theBenchmark.p
% 1.47/1.76 % SZS status Theorem for theBenchmark.p
% 1.47/1.76 % SZS output start CNFRefutation
% See solution above
% 1.47/1.77 % Total time : 1.371s
%------------------------------------------------------------------------------