%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC415+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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:09:42 PM UTC 2026
% Result : Theorem 2.64s 1.19s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f553ERROR: Could not build tree for root c_12121ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ 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(f129,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(flattening,[],[f129]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X5] :
( ~ neq(nil,X1)
| X0 != X5
| tl(X1) != X5
| ~ ssList(X5) )
& ! [X4] :
( ~ neq(nil,X3)
| tl(X3) != X4
| X2 = X4
| ~ ssList(X4) )
& 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)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X5] :
( ~ neq(nil,X1)
| X0 != X5
| tl(X1) != X5
| ~ ssList(X5) )
& ! [X4] :
( ~ neq(nil,X3)
| tl(X3) != X4
| X2 = X4
| ~ ssList(X4) )
& 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)
& ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ! [X5] :
( ~ neq(nil,sK54)
| sK53 != X5
| tl(sK54) != X5
| ~ ssList(X5) )
& ! [X4] :
( ~ neq(nil,sK56)
| tl(sK56) != X4
| sK55 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[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(f399,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f130]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
! [X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK54)
| sK53 != X5
| tl(sK54) != X5
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
! [X5] :
( neq(sK54,nil)
| ~ neq(nil,sK54)
| sK53 != X5
| tl(sK54) != X5
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X4] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| tl(sK56) != X4
| sK55 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
! [X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != X5
| tl(sK56) != X5
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f501,f507,f506,f507,f507]) ).
fof(f512,plain,
! [X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != X5
| tl(sK56) != X5
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f500,f507,f506,f507]) ).
fof(f513,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f507]) ).
fof(f543,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 = tl(sK56)
| ~ ssList(tl(sK56)) ),
inference(equality_resolution,[],[f502]) ).
fof(f544,plain,
( neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != tl(sK56)
| ~ ssList(tl(sK56)) ),
inference(equality_resolution,[],[f511]) ).
fof(f545,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != tl(sK56)
| ~ ssList(tl(sK56)) ),
inference(equality_resolution,[],[f512]) ).
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,[],[f548]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_151,plain,
! [X0: $i] :
( ssList(tl(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f399]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f553]) ).
tcf(c_248,negated_conjecture,
( ( tl(sK56) = sK55 )
| ~ ssList(tl(sK56))
| ~ neq(sK56,nil)
| ~ neq(nil,sK56) ),
inference(cnf_transformation,[],[f543]) ).
tcf(c_249,negated_conjecture,
( neq(sK56,nil)
| ~ ssList(tl(sK56))
| ~ neq(nil,sK56)
| ( tl(sK56) != sK55 ) ),
inference(cnf_transformation,[],[f544]) ).
tcf(c_250,negated_conjecture,
( ~ ssList(tl(sK56))
| ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| ( tl(sK56) != sK55 ) ),
inference(cnf_transformation,[],[f545]) ).
tcf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f513]) ).
tcf(c_381,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_246]) ).
tcf(c_383,plain,
( ~ neq(nil,sK56)
| ~ ssList(tl(sK56)) ),
inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248,c_250]) ).
tcf(c_384,negated_conjecture,
( ~ ssList(tl(sK56))
| ~ neq(nil,sK56) ),
inference(renaming,[status(thm)],[c_383]) ).
tcf(c_385,negated_conjecture,
( ~ ssList(tl(sK56))
| ~ neq(nil,sK56) ),
inference(global_subsumption_just,[status(thm)],[c_250,c_384]) ).
tcf(c_3212,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(tl(sK56))
| ( X1 != sK56 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_385]) ).
tcf(c_3213,plain,
( ( nil = sK56 )
| ~ ssList(sK56)
| ~ ssList(nil)
| ~ ssList(tl(sK56)) ),
inference(unflattening,[status(thm)],[c_3212]) ).
tcf(c_3214,plain,
( ( nil = sK56 )
| ~ ssList(tl(sK56)) ),
inference(global_subsumption_just,[status(thm)],[c_3213,c_253,c_141,c_3213]) ).
tcf(c_3226,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != sK56 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_381]) ).
tcf(c_3227,plain,
( ~ ssList(nil)
| ( nil != sK56 ) ),
inference(unflattening,[status(thm)],[c_3226]) ).
tcf(c_3228,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3227,c_141,c_3227]) ).
tcf(c_3233,plain,
~ ssList(tl(sK56)),
inference(backward_subsumption_resolution,[status(thm)],[c_3214,c_3228]) ).
tcf(c_8818,definition,
iPr_def_10 = tl(sK56),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8819,plain,
~ ssList(iPr_def_10),
inference(demodulation,[status(thm)],[c_3233,c_8818]) ).
tcf(c_8820,plain,
nil != sK56,
inference(demodulation,[status(thm)],[c_3228]) ).
tcf(c_8822,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
tcf(c_12118,plain,
( ssList(iPr_def_10)
| ( nil = sK56 )
| ~ ssList(sK56) ),
inference(superposition,[status(thm)],[c_8818,c_151]) ).
tcf(c_12121,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12118,c_8819,c_8820,c_8822]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC415+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 18:09:04 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 2.64/1.19 % SZS status Started for theBenchmark.p
% 2.64/1.19 % SZS status Theorem for theBenchmark.p
% 2.64/1.19
% 2.64/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.64/1.19
% 2.64/1.19 % ------ iProver source info
% 2.64/1.19
% 2.64/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 2.64/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.64/1.19 % git: non_committed_changes: false
% 2.64/1.19
% 2.64/1.19 % ------ Parsing...
% 2.64/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.64/1.19
% 2.64/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 2.64/1.19
% 2.64/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.64/1.19
% 2.64/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.64/1.19 % ------ Proving...
% 2.64/1.19 % ------ Problem Properties
% 2.64/1.19
% 2.64/1.19 %
% 2.64/1.19 % clauses 185
% 2.64/1.19 % conjectures 2
% 2.64/1.19 % EPR 53
% 2.64/1.19 % Horn 117
% 2.64/1.19 % unary 21
% 2.64/1.19 % binary 40
% 2.64/1.19 % lits 623
% 2.64/1.19 % lits eq 80
% 2.64/1.19 % fd_pure 0
% 2.64/1.19 % fd_pseudo 0
% 2.64/1.19 % fd_cond 21
% 2.64/1.19 % fd_pseudo_cond 14
% 2.64/1.19 % AC symbols 0
% 2.64/1.19
% 2.64/1.19 % ------ Schedule dynamic 5 is on
% 2.64/1.19
% 2.64/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.64/1.19
% 2.64/1.19
% 2.64/1.19 % ------
% 2.64/1.19 % Current options:
% 2.64/1.19 % ------
% 2.64/1.19
% 2.64/1.19
% 2.64/1.19 %
% 2.64/1.19
% 2.64/1.19 % ------ Proving...
% 2.64/1.19 %
% 2.64/1.19
% 2.64/1.19 % SZS status Theorem for theBenchmark.p
% 2.64/1.19
% 2.64/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.64/1.19
%------------------------------------------------------------------------------