%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC040+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 : n011.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:07:38 PM UTC 2026
% Result : Theorem 1.32s 1.16s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f610ERROR: Could not build tree for root c_256ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2 ) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2 ) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ neq(sK56,nil)
| ( ssItem(sK57)
& ssList(sK58)
& sK56 = app(sK58,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),sK58) ) )
& ( nil != sK56
| nil = sK55 )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54 ),
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(f505,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
nil = sK54,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
nil = sK56,
inference(definition_unfolding,[],[f508,f507]) ).
fof(f568,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f505,f509,f506]) ).
tcf(c_246,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f568]) ).
tcf(c_247,negated_conjecture,
sK56 = sK55,
inference(cnf_transformation,[],[f610]) ).
tcf(c_256,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246,c_247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC040+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n011.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 16:02:58 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 1.32/1.16 % SZS status Started for theBenchmark.p
% 1.32/1.16 % SZS status Theorem for theBenchmark.p
% 1.32/1.16
% 1.32/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.32/1.16
% 1.32/1.16 % ------ iProver source info
% 1.32/1.16
% 1.32/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.32/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.32/1.16 % git: non_committed_changes: false
% 1.32/1.16
% 1.32/1.16 % ------ Parsing...
% 1.32/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.32/1.16
% 1.32/1.16 % ------ Preprocessing...%
% 1.32/1.16
% 1.32/1.16 % SZS status Theorem for theBenchmark.p
% 1.32/1.16
% 1.32/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.32/1.16
% 1.32/1.16
%------------------------------------------------------------------------------