%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC012+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:07:30 PM UTC 2026
% Result : Theorem 2.79s 1.38s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f552ERROR: Could not build tree for root c_12177ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> app(X2,cons(X7,nil)) != X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(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) )
& ( ! [X7] :
( ssItem(X7)
=> app(X2,cons(X7,nil)) != X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f201,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X7] :
( ssItem(X7)
& app(X2,cons(X7,nil)) = X3 )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X5,X6) != X0
| app(app(X5,cons(X4,nil)),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(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) )
| ( ? [X7] :
( ssItem(X7)
& app(X2,cons(X7,nil)) = X3 )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X5,X6) != X0
| app(app(X5,cons(X4,nil)),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ssItem(sK57)
& sK56 = app(sK55,cons(sK57,nil))
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X5,X6) != sK53
| app(app(X5,cons(X4,nil)),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57)],[f222]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ neq(sK56,nil)
| sK56 = app(sK55,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
! [X6,X4,X5] :
( ~ neq(sK56,nil)
| app(X5,X6) != sK53
| app(app(X5,cons(X4,nil)),X6) != sK54
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
! [X6,X4,X5] :
( ~ neq(sK56,nil)
| app(X5,X6) != sK55
| app(app(X5,cons(X4,nil)),X6) != sK56
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f504,f509,f508]) ).
fof(f516,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f509]) ).
fof(f517,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f508]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_232,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f482]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f552]) ).
tcf(c_248,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ neq(sK56,nil)
| ( app(X0,X2) != sK55 )
| ( app(app(X0,cons(X1,nil)),X2) != sK56 ) ),
inference(cnf_transformation,[],[f513]) ).
tcf(c_250,negated_conjecture,
( ( app(sK55,cons(sK57,nil)) = sK56 )
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_252,negated_conjecture,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_255,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f516]) ).
tcf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f517]) ).
tcf(c_366,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_252,c_246,c_252]) ).
tcf(c_382,negated_conjecture,
app(sK55,cons(sK57,nil)) = sK56,
inference(global_subsumption_just,[status(thm)],[c_250,c_246,c_250]) ).
tcf(c_392,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ( app(app(X0,cons(X1,nil)),X2) != sK56 )
| ( app(X0,X2) != sK55 ) ),
inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248]) ).
tcf(c_393,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ( app(X0,X2) != sK55 )
| ( app(app(X0,cons(X1,nil)),X2) != sK56 ) ),
inference(renaming,[status(thm)],[c_392]) ).
tcf(c_8847,definition,
iPr_def_10 = cons(sK57,nil),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8848,definition,
iPr_def_11 = app(sK55,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_8850,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ( app(X0,X2) != sK55 )
| ( app(app(X0,cons(X1,nil)),X2) != sK56 ) ),
inference(demodulation,[status(thm)],[c_393]) ).
tcf(c_8851,negated_conjecture,
iPr_def_11 = sK56,
inference(demodulation,[status(thm)],[c_382,c_8847,c_8848]) ).
tcf(c_8852,negated_conjecture,
ssItem(sK57),
inference(demodulation,[status(thm)],[c_366]) ).
tcf(c_8853,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_256]) ).
tcf(c_8854,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_255]) ).
tcf(c_11674,plain,
ssList(iPr_def_11),
inference(light_normalisation,[status(thm)],[c_8854,c_8851]) ).
tcf(c_11675,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ( app(X0,X2) != sK55 )
| ( app(app(X0,cons(X1,nil)),X2) != iPr_def_11 ) ),
inference(light_normalisation,[status(thm)],[c_8850,c_8851]) ).
tcf(c_11694,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(sK57)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != sK55 )
| ( app(app(X0,iPr_def_10),X1) != iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_8847,c_11675]) ).
tcf(c_11695,plain,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != sK55 )
| ( app(app(X0,iPr_def_10),X1) != iPr_def_11 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11694,c_8852]) ).
tcf(c_11769,plain,
! [X0: $i] :
( ~ ssList(sK55)
| ~ ssList(X0)
| ( app(iPr_def_11,X0) != iPr_def_11 )
| ( app(sK55,X0) != sK55 ) ),
inference(superposition,[status(thm)],[c_8848,c_11695]) ).
tcf(c_11770,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( app(iPr_def_11,X0) != iPr_def_11 )
| ( app(sK55,X0) != sK55 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11769,c_8853]) ).
tcf(c_11774,plain,
( ~ ssList(nil)
| ( app(iPr_def_11,nil) != iPr_def_11 )
| ( app(sK55,nil) != sK55 ) ),
inference(instantiation,[status(thm)],[c_11770]) ).
tcf(c_12120,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_8853,c_232]) ).
tcf(c_12121,plain,
app(iPr_def_11,nil) = iPr_def_11,
inference(superposition,[status(thm)],[c_11674,c_232]) ).
tcf(c_12177,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12120,c_12121,c_11774,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC012+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.43 % Computer : n020.cluster.edu
% 0.14/0.43 % Model : x86_64 x86_64
% 0.14/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.43 % Memory : 8046.5625MB
% 0.14/0.43 % OS : Linux 6.8.0-71-generic
% 0.14/0.43 % CPULimit : 300
% 0.14/0.43 % WCLimit : 300
% 0.14/0.43 % DateTime : Thu Sep 24 15:55:19 UTC 2026
% 0.14/0.43 % CPUTime :
% 0.14/0.43 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.48 Running first-order theorem proving
% 0.14/0.48 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.14/0.50
% 0.14/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.50
% 0.14/0.50 % Detected problem language: tptp
% 0.22/0.52 % Proving...
% 2.79/1.38 % SZS status Started for theBenchmark.p
% 2.79/1.38 % SZS status Theorem for theBenchmark.p
% 2.79/1.38
% 2.79/1.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.79/1.38
% 2.79/1.38 % ------ iProver source info
% 2.79/1.38
% 2.79/1.38 % git: date: 2026-07-19 20:42:38 +0200
% 2.79/1.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.79/1.38 % git: non_committed_changes: false
% 2.79/1.38
% 2.79/1.38 % ------ Parsing...
% 2.79/1.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.79/1.38
% 2.79/1.38 % ------ 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.79/1.38
% 2.79/1.38 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.79/1.38
% 2.79/1.38 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.79/1.38 % ------ Proving...
% 2.79/1.38 % ------ Problem Properties
% 2.79/1.38
% 2.79/1.38 %
% 2.79/1.38 % clauses 188
% 2.79/1.38 % conjectures 5
% 2.79/1.38 % EPR 54
% 2.79/1.38 % Horn 120
% 2.79/1.38 % unary 23
% 2.79/1.38 % binary 40
% 2.79/1.38 % lits 630
% 2.79/1.38 % lits eq 84
% 2.79/1.38 % fd_pure 0
% 2.79/1.38 % fd_pseudo 0
% 2.79/1.38 % fd_cond 21
% 2.79/1.38 % fd_pseudo_cond 14
% 2.79/1.38 % AC symbols 0
% 2.79/1.38
% 2.79/1.38 % ------ Schedule dynamic 5 is on
% 2.79/1.38
% 2.79/1.38 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.79/1.38
% 2.79/1.38
% 2.79/1.38 % ------
% 2.79/1.38 % Current options:
% 2.79/1.38 % ------
% 2.79/1.38
% 2.79/1.38
% 2.79/1.38 %
% 2.79/1.38
% 2.79/1.38 % ------ Proving...
% 2.79/1.38 %
% 2.79/1.38
% 2.79/1.38 % SZS status Theorem for theBenchmark.p
% 2.79/1.38
% 2.79/1.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.79/1.38
% 2.79/1.38
%------------------------------------------------------------------------------