%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC153-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 : n005.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:07 PM UTC 2026
% Result : Unsatisfiable 0.91s 1.30s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 46 ( 24 unt; 0 def)
% Number of atoms : 157 ( 15 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 224 ( 113 ~; 111 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 55 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f206,negated_conjecture,
sk3 = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f207,plain,
sk1 = sk3,
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
! [X2,X3,X0,X1,X4] :
( leq(X0,X1)
| ~ leq(X1,X0)
| app(app(app(app(X2,cons(X0,nil)),X3),cons(X1,nil)),X4) != sk3
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f209,plain,
! [X2,X3,X0,X1,X4] :
( leq(X0,X1)
| ~ leq(X1,X0)
| sk3 != app(app(app(app(X2,cons(X0,nil)),X3),cons(X1,nil)),X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f208]) ).
fof(f210,negated_conjecture,
! [X2,X3,X0,X1,X4,X5] :
( leq(X0,X5)
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X1,X0)
| app(app(app(app(X2,cons(X0,nil)),X3),cons(X1,nil)),X4) != sk3
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f211,plain,
! [X2,X3,X0,X1,X4,X5] :
( leq(X0,X5)
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X1,X0)
| sk3 != app(app(app(app(X2,cons(X0,nil)),X3),cons(X1,nil)),X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
! [X2,X3,X0,X1,X4,X5] :
( leq(X5,X1)
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X1,X0)
| app(app(app(app(X2,cons(X0,nil)),X3),cons(X1,nil)),X4) != sk3
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f213,plain,
! [X2,X3,X0,X1,X4,X5] :
( leq(X5,X1)
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X1,X0)
| sk3 != app(app(app(app(X2,cons(X0,nil)),X3),cons(X1,nil)),X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f212]) ).
fof(f214,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f215,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f216,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f217,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f218,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f219,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f220,plain,
sk1 = app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9),
inference(reorient_equations,[],[f219]) ).
fof(f221,negated_conjecture,
leq(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f222,negated_conjecture,
( ~ leq(sk5,sk6)
| ssItem(sk10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f223,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f224,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk10,sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
fof(f227,plain,
sk3 = app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9),
inference(definition_unfolding,[],[f220,f207]) ).
tcf(c_257,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( leq(X1,X3)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ leq(X3,X1)
| ( app(app(app(app(X0,cons(X1,nil)),X2),cons(X3,nil)),X4) != sk3 ) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_258,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( leq(X1,X5)
| ~ ssItem(X5)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X2,X5)
| ~ leq(X3,X1)
| ( app(app(app(app(X0,cons(X1,nil)),X2),cons(X3,nil)),X4) != sk3 ) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_259,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( leq(X5,X3)
| ~ ssItem(X5)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X2,X5)
| ~ leq(X3,X1)
| ( app(app(app(app(X0,cons(X1,nil)),X2),cons(X3,nil)),X4) != sk3 ) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_260,negated_conjecture,
ssItem(sk5),
inference(cnf_transformation,[],[f214]) ).
tcf(c_261,negated_conjecture,
ssItem(sk6),
inference(cnf_transformation,[],[f215]) ).
tcf(c_262,negated_conjecture,
ssList(sk7),
inference(cnf_transformation,[],[f216]) ).
tcf(c_263,negated_conjecture,
ssList(sk8),
inference(cnf_transformation,[],[f217]) ).
tcf(c_264,negated_conjecture,
ssList(sk9),
inference(cnf_transformation,[],[f218]) ).
tcf(c_265,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(cnf_transformation,[],[f227]) ).
tcf(c_266,negated_conjecture,
leq(sk6,sk5),
inference(cnf_transformation,[],[f221]) ).
tcf(c_267,negated_conjecture,
( ssItem(sk10)
| ~ leq(sk5,sk6) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_268,negated_conjecture,
( memberP(sk8,sk10)
| ~ leq(sk5,sk6) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_269,negated_conjecture,
( ~ leq(sk10,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk5,sk6) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_2280,plain,
( leq(sk5,sk6)
| ~ ssItem(sk6)
| ~ ssItem(sk5)
| ~ ssList(sk9)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ leq(sk6,sk5) ),
inference(superposition,[status(thm)],[c_265,c_257]) ).
tcf(c_2282,plain,
leq(sk5,sk6),
inference(forward_subsumption_resolution,[status(thm)],[c_2280,c_261,c_260,c_264,c_263,c_262,c_266]) ).
tcf(c_2291,plain,
memberP(sk8,sk10),
inference(backward_subsumption_resolution,[status(thm)],[c_268,c_2282]) ).
tcf(c_2292,plain,
ssItem(sk10),
inference(backward_subsumption_resolution,[status(thm)],[c_267,c_2282]) ).
tcf(c_2316,plain,
! [X0: $i] :
( leq(sk5,X0)
| ~ ssItem(sk6)
| ~ ssItem(sk5)
| ~ ssList(sk9)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(X0)
| ~ leq(sk6,sk5)
| ~ memberP(sk8,X0) ),
inference(superposition,[status(thm)],[c_265,c_258]) ).
tcf(c_2318,plain,
! [X0: $i] :
( leq(sk5,X0)
| ~ ssItem(X0)
| ~ memberP(sk8,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2316,c_261,c_260,c_264,c_263,c_262,c_266]) ).
tcf(c_2352,plain,
! [X0: $i] :
( leq(X0,sk6)
| ~ ssItem(sk6)
| ~ ssItem(sk5)
| ~ ssList(sk9)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(X0)
| ~ leq(sk6,sk5)
| ~ memberP(sk8,X0) ),
inference(superposition,[status(thm)],[c_265,c_259]) ).
tcf(c_2354,plain,
! [X0: $i] :
( leq(X0,sk6)
| ~ ssItem(X0)
| ~ memberP(sk8,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2352,c_261,c_260,c_264,c_263,c_262,c_266]) ).
tcf(c_2437,plain,
( leq(sk5,sk10)
| ~ ssItem(sk10) ),
inference(superposition,[status(thm)],[c_2291,c_2318]) ).
tcf(c_2438,plain,
leq(sk5,sk10),
inference(forward_subsumption_resolution,[status(thm)],[c_2437,c_2292]) ).
tcf(c_2446,plain,
( leq(sk10,sk6)
| ~ ssItem(sk10) ),
inference(superposition,[status(thm)],[c_2291,c_2354]) ).
tcf(c_2447,plain,
leq(sk10,sk6),
inference(forward_subsumption_resolution,[status(thm)],[c_2446,c_2292]) ).
tcf(c_2448,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2447,c_2438,c_2282,c_269]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC153-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.09/0.38 % Computer : n005.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Thu Sep 24 16:41:18 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 0.91/1.30 % SZS status Started for theBenchmark.p
% 0.91/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 0.91/1.30
% 0.91/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.91/1.30
% 0.91/1.30 % ------ iProver source info
% 0.91/1.30
% 0.91/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.91/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.91/1.30 % git: non_committed_changes: false
% 0.91/1.30
% 0.91/1.30 % ------ Parsing...% successful
% 0.91/1.30
% 0.91/1.30
% 0.91/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.91/1.30
% 0.91/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.91/1.30
% 0.91/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.91/1.30
% 0.91/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.91/1.30 % ------ Proving...
% 0.91/1.30 % ------ Problem Properties
% 0.91/1.30
% 0.91/1.30 %
% 0.91/1.30 % clauses 43
% 0.91/1.30 % conjectures 15
% 0.91/1.30 % EPR 16
% 0.91/1.30 % Horn 41
% 0.91/1.30 % unary 11
% 0.91/1.30 % binary 6
% 0.91/1.30 % lits 153
% 0.91/1.30 % lits eq 26
% 0.91/1.30 % fd_pure 0
% 0.91/1.30 % fd_pseudo 0
% 0.91/1.30 % fd_cond 2
% 0.91/1.30 % fd_pseudo_cond 6
% 0.91/1.30 % AC symbols 0
% 0.91/1.30
% 0.91/1.30 % ------ Schedule dynamic 5 is on
% 0.91/1.30
% 0.91/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.91/1.30
% 0.91/1.30
% 0.91/1.30 % ------
% 0.91/1.30 % Current options:
% 0.91/1.30 % ------
% 0.91/1.30
% 0.91/1.30
% 0.91/1.30 %
% 0.91/1.30
% 0.91/1.30 % ------ Proving...
% 0.91/1.30 %
% 0.91/1.30
% 0.91/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 0.91/1.30
% 0.91/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.21/1.30
% 4.21/1.30
%------------------------------------------------------------------------------