%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC213+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:08:53 PM UTC 2026
% Result : Theorem 0.42s 11.29s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f544ERROR: Could not build tree for root c_6150ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X11,cons(X9,nil)) = X2
& ssList(X11) )
& app(cons(X9,nil),X10) = X5
& ssList(X10) )
& ssItem(X9) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X11,cons(X9,nil)) = X2
& ssList(X11) )
& app(cons(X9,nil),X10) = X5
& ssList(X10) )
& ssItem(X9) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X11,cons(X9,nil)) != X2
| ~ ssList(X11) )
| app(cons(X9,nil),X10) != X5
| ~ ssList(X10) )
| ~ ssItem(X9) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(cons(X6,nil),X8) != X2
| ~ ssList(X8) )
| app(X7,cons(X6,nil)) != X4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3 ) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X11,cons(X9,nil)) != X2
| ~ ssList(X11) )
| app(cons(X9,nil),X10) != X5
| ~ ssList(X10) )
| ~ ssItem(X9) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(cons(X6,nil),X8) != X2
| ~ ssList(X8) )
| app(X7,cons(X6,nil)) != X4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3 ) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( nil != sK55
| nil = sK56 )
& ~ neq(sK53,nil)
& ssList(sK57)
& ssList(sK58)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X11,cons(X9,nil)) != sK55
| ~ ssList(X11) )
| app(cons(X9,nil),X10) != sK58
| ~ ssList(X10) )
| ~ ssItem(X9) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(cons(X6,nil),X8) != sK55
| ~ ssList(X8) )
| app(X7,cons(X6,nil)) != sK57
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f508,f510]) ).
fof(f512,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f501,f509]) ).
fof(f514,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f509]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f387]) ).
tcf(c_139,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f544]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f511]) ).
tcf(c_253,negated_conjecture,
~ neq(sK55,nil),
inference(cnf_transformation,[],[f512]) ).
tcf(c_254,negated_conjecture,
( ( nil = sK56 )
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_258,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f514]) ).
tcf(c_3260,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK55 ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_253]) ).
tcf(c_3261,plain,
( ( sK55 = nil )
| ~ ssList(sK55)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3260]) ).
tcf(c_3262,plain,
sK55 = nil,
inference(global_subsumption_just,[status(thm)],[c_3261,c_258,c_141,c_3261]) ).
tcf(c_3269,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != sK56 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_246]) ).
tcf(c_3270,plain,
( ~ ssList(nil)
| ( nil != sK56 ) ),
inference(unflattening,[status(thm)],[c_3269]) ).
tcf(c_3271,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3270,c_141,c_3270]) ).
tcf(c_3286,plain,
nil != sK55,
inference(backward_subsumption_resolution,[status(thm)],[c_254,c_3271]) ).
tcf(c_6149,plain,
nil != nil,
inference(demodulation,[status(thm)],[c_3286,c_3262]) ).
tcf(c_6150,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_6149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC213+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/10.38 % Computer : n018.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Thu Sep 24 17:03:01 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/10.42 Running first-order theorem proving
% 0.13/10.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/10.43
% 0.13/10.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/10.43
% 0.13/10.43 % Detected problem language: tptp
% 0.13/10.45 % Proving...
% 0.42/11.29 % SZS status Started for theBenchmark.p
% 0.42/11.29 % SZS status Theorem for theBenchmark.p
% 0.42/11.29
% 0.42/11.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/11.29
% 0.42/11.29 % ------ iProver source info
% 0.42/11.29
% 0.42/11.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/11.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/11.29 % git: non_committed_changes: false
% 0.42/11.29
% 0.42/11.29 % ------ Parsing...
% 0.42/11.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/11.29
% 0.42/11.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e %
% 0.42/11.29
% 0.42/11.29 % SZS status Theorem for theBenchmark.p
% 0.42/11.29
% 0.42/11.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/11.30
% 0.42/11.30
%------------------------------------------------------------------------------