%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC106-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 : n013.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:55 PM UTC 2026
% Result : Unsatisfiable 0.59s 1.60s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f238ERROR: Could not build tree for root c_1834ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f100,axiom,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
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(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(f215,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f216,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f218,plain,
( ~ neq(sk4,nil)
| sk3 = cons(sk5,nil) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f220,plain,
( ~ neq(sk4,nil)
| sk4 = app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f219]) ).
fof(f221,negated_conjecture,
( ~ neq(sk4,nil)
| ~ rearsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f231,plain,
( ~ neq(sk4,nil)
| ~ rearsegP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(definition_unfolding,[],[f221,f205,f204,f205]) ).
fof(f236,plain,
! [X0,X1] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f154]) ).
tcf(c_254,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_256,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f238]) ).
tcf(c_262,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_263,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_264,negated_conjecture,
( ( cons(sk5,nil) = sk3 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_265,negated_conjecture,
( ( app(sk6,cons(sk5,nil)) = sk4 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_266,negated_conjecture,
( ~ rearsegP(sk4,sk3)
| ~ neq(sk4,nil)
| ~ neq(sk3,nil) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_274,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_282,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_287,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_289,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f236]) ).
tcf(c_318,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_263,c_256,c_263]) ).
tcf(c_320,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_262,c_256,c_262]) ).
tcf(c_328,negated_conjecture,
cons(sk5,nil) = sk3,
inference(global_subsumption_just,[status(thm)],[c_264,c_256,c_264]) ).
tcf(c_334,negated_conjecture,
( ~ rearsegP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(global_subsumption_just,[status(thm)],[c_266,c_256,c_266]) ).
tcf(c_336,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(global_subsumption_just,[status(thm)],[c_265,c_256,c_265]) ).
tcf(c_398,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_289,c_287]) ).
tcf(c_568,plain,
app(sk6,sk3) = sk4,
inference(light_normalisation,[status(thm)],[c_336,c_328]) ).
tcf(c_788,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(sk4,sk3)
| ( X1 != sk3 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_278,c_334]) ).
tcf(c_789,plain,
( ( nil = sk3 )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ rearsegP(sk4,sk3) ),
inference(unflattening,[status(thm)],[c_788]) ).
tcf(c_790,plain,
( ( nil = sk3 )
| ~ rearsegP(sk4,sk3) ),
inference(global_subsumption_just,[status(thm)],[c_789,c_254,c_274,c_789]) ).
tcf(c_1753,plain,
( rearsegP(sk4,sk3)
| ~ ssList(sk6)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_568,c_398]) ).
tcf(c_1766,plain,
rearsegP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_1753,c_318,c_254]) ).
tcf(c_1767,plain,
sk3 = nil,
inference(backward_subsumption_resolution,[status(thm)],[c_790,c_1766]) ).
tcf(c_1772,plain,
cons(sk5,nil) = nil,
inference(demodulation,[status(thm)],[c_328,c_1767]) ).
tcf(c_1831,plain,
( ~ ssItem(sk5)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_1772,c_282]) ).
tcf(c_1834,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1831,c_320,c_274]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC106-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.64 % Computer : n013.cluster.edu
% 0.15/0.64 % Model : x86_64 x86_64
% 0.15/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.64 % Memory : 8046.5625MB
% 0.15/0.64 % OS : Linux 6.8.0-71-generic
% 0.04/0.64 % CPULimit : 300
% 0.04/0.64 % WCLimit : 300
% 0.04/0.64 % DateTime : Thu Sep 24 16:25:38 UTC 2026
% 0.04/0.64 % CPUTime :
% 0.04/0.64 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.70 Running first-order theorem proving
% 0.04/0.70 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.19/0.71
% 0.19/0.71 % ======== iProver multi-core TPTP/SMT =========
% 0.19/0.71
% 0.19/0.71 % Detected problem language: tptp
% 0.19/0.73 % Proving...
% 0.59/1.60 % SZS status Started for theBenchmark.p
% 0.59/1.60 % SZS status Unsatisfiable for theBenchmark.p
% 0.59/1.60
% 0.59/1.60 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.59/1.60
% 0.59/1.60 % ------ iProver source info
% 0.59/1.60
% 0.59/1.60 % git: date: 2026-07-19 20:42:38 +0200
% 0.59/1.60 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.59/1.60 % git: non_committed_changes: false
% 0.59/1.60
% 0.59/1.60 % ------ Parsing...% successful
% 0.59/1.60
% 0.59/1.60
% 0.59/1.60 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.59/1.60
% 0.59/1.60 % ------ Preprocessing... sup_sim: 1 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 %
% 0.59/1.60
% 0.59/1.60 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.59/1.60
% 0.59/1.60 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.59/1.60 % ------ Proving...
% 0.59/1.60 % ------ Problem Properties
% 0.59/1.60
% 0.59/1.60 %
% 0.59/1.60 % clauses 34
% 0.59/1.60 % conjectures 5
% 0.59/1.60 % EPR 14
% 0.59/1.60 % Horn 34
% 0.59/1.60 % unary 10
% 0.59/1.60 % binary 6
% 0.59/1.60 % lits 97
% 0.59/1.60 % lits eq 27
% 0.59/1.60 % fd_pure 0
% 0.59/1.60 % fd_pseudo 0
% 0.59/1.60 % fd_cond 3
% 0.59/1.60 % fd_pseudo_cond 5
% 0.59/1.60 % AC symbols 0
% 0.59/1.60
% 0.59/1.60 % ------ Schedule dynamic 5 is on
% 0.59/1.60
% 0.59/1.60 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.59/1.60
% 0.59/1.60
% 0.59/1.60 % ------
% 0.59/1.60 % Current options:
% 0.59/1.60 % ------
% 0.59/1.60
% 0.59/1.60
% 0.59/1.60 %
% 0.59/1.60
% 0.59/1.60 % ------ Proving...
% 0.59/1.60 %
% 0.59/1.60
% 0.59/1.60 % SZS status Unsatisfiable for theBenchmark.p
% 0.59/1.60
% 0.59/1.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.59/1.60
% 0.59/1.60
%------------------------------------------------------------------------------