%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC366-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 : n014.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:29 PM UTC 2026
% Result : Unsatisfiable 3.99s 1.27s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f236ERROR: Could not build tree for root c_3157ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f76,axiom,
! [X0] :
( nil = X0
| ssItem(hd(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
fof(f154,axiom,
! [X2,X0,X1] :
( rearsegP(X2,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause143) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f208,negated_conjecture,
! [X2,X0,X1] :
( neq(sk2,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk3) != X0
| ~ ssList(X1)
| sk4 = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,negated_conjecture,
! [X2,X0,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk3) != X0
| ~ ssList(X1)
| sk4 = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( ~ neq(sk4,nil)
| ~ rearsegP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X2,X0,X1] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk3) != X0
| ~ ssList(X1)
| sk4 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f208,f204]) ).
fof(f218,plain,
( ~ neq(sk4,nil)
| ~ rearsegP(sk4,sk3) ),
inference(definition_unfolding,[],[f211,f204,f205]) ).
fof(f219,plain,
! [X2,X1] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| sk4 = app(X1,sk3)
| ~ ssList(app(X1,sk3)) ),
inference(equality_resolution,[],[f216]) ).
fof(f220,plain,
! [X2] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil))
| sk4 = app(cons(X2,nil),sk3)
| ~ ssList(app(cons(X2,nil),sk3)) ),
inference(equality_resolution,[],[f219]) ).
fof(f221,plain,
( neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk4 = app(cons(hd(sk4),nil),sk3)
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(equality_resolution,[],[f220]) ).
fof(f222,plain,
! [X2,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| sk4 = app(X1,sk3)
| ~ ssList(app(X1,sk3)) ),
inference(equality_resolution,[],[f210]) ).
fof(f223,plain,
! [X2] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil))
| sk4 = app(cons(X2,nil),sk3)
| ~ ssList(app(cons(X2,nil),sk3)) ),
inference(equality_resolution,[],[f222]) ).
fof(f224,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk4 = app(cons(hd(sk4),nil),sk3)
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(equality_resolution,[],[f223]) ).
fof(f229,plain,
! [X0,X1] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f154]) ).
tcf(c_248,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_249,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_250,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f236]) ).
tcf(c_251,negated_conjecture,
( neq(sk4,nil)
| ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_253,negated_conjecture,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_254,negated_conjecture,
( ~ rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_262,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_264,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f239]) ).
tcf(c_266,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_271,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_275,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_283,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_347,negated_conjecture,
~ rearsegP(sk4,sk3),
inference(global_subsumption_just,[status(thm)],[c_254,c_250,c_254]) ).
tcf(c_355,negated_conjecture,
neq(sk4,nil),
inference(global_subsumption_just,[status(thm)],[c_251,c_250]) ).
tcf(c_357,plain,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(app(cons(hd(sk4),nil),sk3))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(global_subsumption_just,[status(thm)],[c_253,c_250,c_253]) ).
tcf(c_358,negated_conjecture,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(renaming,[status(thm)],[c_357]) ).
tcf(c_429,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_285,c_275]) ).
tcf(c_1215,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_355,c_264]) ).
tcf(c_1216,plain,
( ~ ssList(sk4)
| ( sk4 != nil ) ),
inference(unflattening,[status(thm)],[c_1215]) ).
tcf(c_1217,plain,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_1216,c_249,c_1216]) ).
tcf(c_1246,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk3))
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_358,c_266]) ).
tcf(c_1247,plain,
( ( sk4 = nil )
| ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(unflattening,[status(thm)],[c_1246]) ).
tcf(c_1248,plain,
( ~ ssList(app(cons(hd(sk4),nil),sk3))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ( app(cons(hd(sk4),nil),sk3) = sk4 ) ),
inference(global_subsumption_just,[status(thm)],[c_1247,c_249,c_262,c_1216,c_1247]) ).
tcf(c_1249,plain,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(renaming,[status(thm)],[c_1248]) ).
tcf(c_3078,plain,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssList(sk3)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(superposition,[status(thm)],[c_275,c_1249]) ).
tcf(c_3085,plain,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3078,c_248]) ).
tcf(c_3097,plain,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssList(nil)
| ~ ssItem(hd(sk4)) ),
inference(superposition,[status(thm)],[c_271,c_3085]) ).
tcf(c_3098,plain,
( ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssItem(hd(sk4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3097,c_262]) ).
tcf(c_3149,plain,
( ( sk4 = nil )
| ( app(cons(hd(sk4),nil),sk3) = sk4 )
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_283,c_3098]) ).
tcf(c_3150,plain,
app(cons(hd(sk4),nil),sk3) = sk4,
inference(forward_subsumption_resolution,[status(thm)],[c_3149,c_1217,c_249]) ).
tcf(c_3152,plain,
( rearsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(superposition,[status(thm)],[c_3150,c_429]) ).
tcf(c_3153,plain,
~ ssList(cons(hd(sk4),nil)),
inference(forward_subsumption_resolution,[status(thm)],[c_3152,c_347,c_248]) ).
tcf(c_3154,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4)) ),
inference(superposition,[status(thm)],[c_271,c_3153]) ).
tcf(c_3155,plain,
~ ssItem(hd(sk4)),
inference(forward_subsumption_resolution,[status(thm)],[c_3154,c_262]) ).
tcf(c_3156,plain,
( ( sk4 = nil )
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_283,c_3155]) ).
tcf(c_3157,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3156,c_1217,c_249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC366-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 : n014.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 17:51:17 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 3.99/1.27 % SZS status Started for theBenchmark.p
% 3.99/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.27
% 3.99/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.99/1.27
% 3.99/1.27 % ------ iProver source info
% 3.99/1.27
% 3.99/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.99/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.99/1.27 % git: non_committed_changes: false
% 3.99/1.27
% 3.99/1.27 % ------ Parsing...% successful
% 3.99/1.27
% 3.99/1.27
% 3.99/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.99/1.27
% 3.99/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.99/1.27
% 3.99/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.99/1.27
% 3.99/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.99/1.27 % ------ Proving...
% 3.99/1.27 % ------ Problem Properties
% 3.99/1.27
% 3.99/1.27 %
% 3.99/1.27 % clauses 54
% 3.99/1.27 % conjectures 3
% 3.99/1.27 % EPR 22
% 3.99/1.27 % Horn 45
% 3.99/1.27 % unary 9
% 3.99/1.27 % binary 8
% 3.99/1.27 % lits 198
% 3.99/1.27 % lits eq 36
% 3.99/1.27 % fd_pure 0
% 3.99/1.27 % fd_pseudo 0
% 3.99/1.27 % fd_cond 11
% 3.99/1.27 % fd_pseudo_cond 7
% 3.99/1.27 % AC symbols 0
% 3.99/1.27
% 3.99/1.27 % ------ Schedule dynamic 5 is on
% 3.99/1.27
% 3.99/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.99/1.27
% 3.99/1.27
% 3.99/1.27 % ------
% 3.99/1.27 % Current options:
% 3.99/1.27 % ------
% 3.99/1.27
% 3.99/1.27
% 3.99/1.27 %
% 3.99/1.27
% 3.99/1.27 % ------ Proving...
% 3.99/1.27 %
% 3.99/1.27
% 3.99/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.27
% 3.99/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.27
% 3.99/1.27
%------------------------------------------------------------------------------