%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC239-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 : n003.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:58 PM UTC 2026
% Result : Unsatisfiable 3.59s 1.19s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 124 ( 43 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 144 ( 70 ~; 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f71,axiom,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/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/sandbox2/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(f209,negated_conjecture,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,plain,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f209]) ).
fof(f217,negated_conjecture,
( nil = sk4
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f218,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f219,negated_conjecture,
( nil = sk4
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f220,plain,
( nil = sk4
| sk3 = cons(sk6,nil) ),
inference(reorient_equations,[],[f219]) ).
fof(f223,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f224,plain,
( nil = sk3
| sk3 = cons(sk6,nil) ),
inference(reorient_equations,[],[f223]) ).
fof(f229,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f230,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(f231,plain,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f210,f205]) ).
tcf(c_256,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_258,negated_conjecture,
sk3 != nil,
inference(cnf_transformation,[],[f229]) ).
tcf(c_259,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,[],[f230]) ).
tcf(c_260,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_264,negated_conjecture,
( ssItem(sk6)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_265,negated_conjecture,
( ssItem(sk6)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_266,negated_conjecture,
( ( sk4 = nil )
| ( cons(sk6,nil) = sk3 ) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_269,negated_conjecture,
( ( sk3 = nil )
| ( cons(sk6,nil) = sk3 ) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_277,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_278,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_279,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_296,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_335,negated_conjecture,
ssItem(sk6),
inference(global_subsumption_just,[status(thm)],[c_264,c_258,c_265]) ).
tcf(c_345,negated_conjecture,
cons(sk6,nil) = sk3,
inference(global_subsumption_just,[status(thm)],[c_266,c_258,c_269]) ).
tcf(c_2526,plain,
! [X0: $i,X1: $i] :
( ssItem(sk5(X1,X0,sk6))
| ~ ssItem(sk6)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,sk3),X1) != sk3 ) ),
inference(superposition,[status(thm)],[c_345,c_259]) ).
tcf(c_2527,plain,
! [X0: $i,X1: $i] :
( ssItem(sk5(X1,X0,sk6))
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,sk3),X1) != sk3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2526,c_335]) ).
tcf(c_2550,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_256,c_277]) ).
tcf(c_2557,plain,
app(sk3,nil) = sk3,
inference(superposition,[status(thm)],[c_256,c_278]) ).
tcf(c_2570,plain,
! [X0: $i,X1: $i] :
( memberP(X0,sk5(X1,X0,sk6))
| ~ ssItem(sk6)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,sk3),X1) != sk3 ) ),
inference(superposition,[status(thm)],[c_345,c_260]) ).
tcf(c_2571,plain,
! [X0: $i,X1: $i] :
( memberP(X0,sk5(X1,X0,sk6))
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,sk3),X1) != sk3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2570,c_335]) ).
tcf(c_2635,plain,
! [X0: $i] :
( ssItem(sk5(X0,nil,sk6))
| ~ ssList(nil)
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(superposition,[status(thm)],[c_2550,c_2527]) ).
tcf(c_2636,plain,
! [X0: $i] :
( ssItem(sk5(X0,nil,sk6))
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2635,c_279]) ).
tcf(c_2649,plain,
! [X0: $i] :
( memberP(nil,sk5(X0,nil,sk6))
| ~ ssList(nil)
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(superposition,[status(thm)],[c_2550,c_2571]) ).
tcf(c_2650,plain,
! [X0: $i] :
( memberP(nil,sk5(X0,nil,sk6))
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2649,c_279]) ).
tcf(c_2777,plain,
( ssItem(sk5(nil,nil,sk6))
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_2557,c_2636]) ).
tcf(c_2778,plain,
ssItem(sk5(nil,nil,sk6)),
inference(forward_subsumption_resolution,[status(thm)],[c_2777,c_279]) ).
tcf(c_2785,plain,
( memberP(nil,sk5(nil,nil,sk6))
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_2557,c_2650]) ).
tcf(c_2786,plain,
memberP(nil,sk5(nil,nil,sk6)),
inference(forward_subsumption_resolution,[status(thm)],[c_2785,c_279]) ).
tcf(c_2787,plain,
~ ssItem(sk5(nil,nil,sk6)),
inference(superposition,[status(thm)],[c_2786,c_296]) ).
tcf(c_2788,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2787,c_2778]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC239-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.11/0.36 % Computer : n003.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 17:11:21 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.41 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 3.59/1.19 % SZS status Started for theBenchmark.p
% 3.59/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.59/1.19
% 3.59/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.59/1.19
% 3.59/1.19 % ------ iProver source info
% 3.59/1.19
% 3.59/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.59/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.59/1.19 % git: non_committed_changes: false
% 3.59/1.19
% 3.59/1.19 % ------ Parsing...% successful
% 3.59/1.19
% 3.59/1.19
% 3.59/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.59/1.19
% 3.59/1.19 % ------ 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 %
% 3.59/1.19
% 3.59/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.59/1.19
% 3.59/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.59/1.19 % ------ Proving...
% 3.59/1.19 % ------ Problem Properties
% 3.59/1.19
% 3.59/1.19 %
% 3.59/1.19 % clauses 46
% 3.59/1.19 % conjectures 12
% 3.59/1.19 % EPR 17
% 3.59/1.19 % Horn 43
% 3.59/1.19 % unary 8
% 3.59/1.19 % binary 5
% 3.59/1.19 % lits 171
% 3.59/1.19 % lits eq 31
% 3.59/1.19 % fd_pure 0
% 3.59/1.19 % fd_pseudo 0
% 3.59/1.19 % fd_cond 3
% 3.59/1.19 % fd_pseudo_cond 7
% 3.59/1.19 % AC symbols 0
% 3.59/1.19
% 3.59/1.19 % ------ Schedule dynamic 5 is on
% 3.59/1.19
% 3.59/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.59/1.19
% 3.59/1.19
% 3.59/1.19 % ------
% 3.59/1.19 % Current options:
% 3.59/1.19 % ------
% 3.59/1.19
% 3.59/1.19
% 3.59/1.19 %
% 3.59/1.19
% 3.59/1.19 % ------ Proving...
% 3.59/1.19 %
% 3.59/1.19
% 3.59/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.59/1.19
% 3.59/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.59/1.19
% 3.59/1.19
%------------------------------------------------------------------------------