%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC241-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 : n018.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:59 PM UTC 2026
% Result : Unsatisfiable 4.02s 1.26s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 12 unt; 0 def)
% Number of atoms : 113 ( 29 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 148 ( 74 ~; 74 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 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 : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f106,axiom,
! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X0,X1] :
( ssItem(sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ssItem(sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f207]) ).
fof(f213,negated_conjecture,
! [X2,X0,X1] :
( lt(X0,sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f214,plain,
! [X2,X0,X1] :
( lt(X0,sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
! [X2,X0,X1] :
( ~ leq(X0,sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X2,X0,X1] :
( ~ leq(X0,sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f215]) ).
fof(f217,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f218,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f219,negated_conjecture,
( ssList(sk8)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f220,negated_conjecture,
( app(app(sk7,cons(sk6,nil)),sk8) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f221,plain,
( sk3 = app(app(sk7,cons(sk6,nil)),sk8)
| nil = sk3 ),
inference(reorient_equations,[],[f220]) ).
fof(f225,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ssItem(sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f208,f205]) ).
fof(f229,plain,
! [X2,X0,X1] :
( lt(X0,sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f214,f205]) ).
fof(f230,plain,
! [X2,X0,X1] :
( ~ leq(X0,sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f216,f205]) ).
tcf(c_255,negated_conjecture,
sk3 != nil,
inference(cnf_transformation,[],[f225]) ).
tcf(c_256,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ssItem(sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_259,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( lt(X1,sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_260,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ leq(X1,sk5(X2,X0,X1))
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_261,negated_conjecture,
( ssItem(sk6)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_262,negated_conjecture,
( ssList(sk7)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_263,negated_conjecture,
( ssList(sk8)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_264,negated_conjecture,
( ( sk3 = nil )
| ( app(app(sk7,cons(sk6,nil)),sk8) = sk3 ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_297,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_326,negated_conjecture,
ssList(sk8),
inference(global_subsumption_just,[status(thm)],[c_263,c_255,c_263]) ).
tcf(c_328,negated_conjecture,
ssList(sk7),
inference(global_subsumption_just,[status(thm)],[c_262,c_255,c_262]) ).
tcf(c_330,negated_conjecture,
ssItem(sk6),
inference(global_subsumption_just,[status(thm)],[c_261,c_255,c_261]) ).
tcf(c_334,negated_conjecture,
app(app(sk7,cons(sk6,nil)),sk8) = sk3,
inference(global_subsumption_just,[status(thm)],[c_264,c_255,c_264]) ).
tcf(c_2555,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7) ),
inference(superposition,[status(thm)],[c_334,c_256]) ).
tcf(c_2556,plain,
ssItem(sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[status(thm)],[c_2555,c_330,c_326,c_328]) ).
tcf(c_2591,plain,
( lt(sk6,sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7) ),
inference(superposition,[status(thm)],[c_334,c_259]) ).
tcf(c_2592,plain,
lt(sk6,sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[status(thm)],[c_2591,c_330,c_326,c_328]) ).
tcf(c_2603,plain,
( ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(superposition,[status(thm)],[c_334,c_260]) ).
tcf(c_2604,plain,
~ leq(sk6,sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[status(thm)],[c_2603,c_330,c_326,c_328]) ).
tcf(c_2682,plain,
( leq(sk6,sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ ssItem(sk5(sk8,sk7,sk6)) ),
inference(superposition,[status(thm)],[c_2592,c_297]) ).
tcf(c_2683,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2682,c_2604,c_330,c_2556]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC241-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.08/0.35 % Computer : n018.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:12:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 4.02/1.26 % SZS status Started for theBenchmark.p
% 4.02/1.26 % SZS status Unsatisfiable for theBenchmark.p
% 4.02/1.26
% 4.02/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.02/1.26
% 4.02/1.26 % ------ iProver source info
% 4.02/1.26
% 4.02/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 4.02/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.02/1.26 % git: non_committed_changes: false
% 4.02/1.26
% 4.02/1.26 % ------ Parsing...% successful
% 4.02/1.26
% 4.02/1.26
% 4.02/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.02/1.26
% 4.02/1.26 % ------ 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 %
% 4.02/1.26
% 4.02/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.02/1.26
% 4.02/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.02/1.26 % ------ Proving...
% 4.02/1.26 % ------ Problem Properties
% 4.02/1.26
% 4.02/1.26 %
% 4.02/1.26 % clauses 47
% 4.02/1.26 % conjectures 13
% 4.02/1.26 % EPR 18
% 4.02/1.26 % Horn 44
% 4.02/1.26 % unary 9
% 4.02/1.26 % binary 5
% 4.02/1.26 % lits 173
% 4.02/1.26 % lits eq 30
% 4.02/1.26 % fd_pure 0
% 4.02/1.26 % fd_pseudo 0
% 4.02/1.26 % fd_cond 2
% 4.02/1.26 % fd_pseudo_cond 7
% 4.02/1.26 % AC symbols 0
% 4.02/1.26
% 4.02/1.26 % ------ Schedule dynamic 5 is on
% 4.02/1.26
% 4.02/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.02/1.26
% 4.02/1.26
% 4.02/1.26 % ------
% 4.02/1.26 % Current options:
% 4.02/1.26 % ------
% 4.02/1.26
% 4.02/1.26
% 4.02/1.26 %
% 4.02/1.26
% 4.02/1.26 % ------ Proving...
% 4.02/1.26 %
% 4.02/1.26
% 4.02/1.26 % SZS status Unsatisfiable for theBenchmark.p
% 4.02/1.26
% 4.02/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.02/1.26
% 4.02/1.26
%------------------------------------------------------------------------------