%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC047-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 : n004.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:40 PM UTC 2026
% Result : Unsatisfiable 0.14s 1.91s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f251ERROR: Could not build tree for root c_9042ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f59,axiom,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause59) ).
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(f206,negated_conjecture,
sk4 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,plain,
sk3 = sk4,
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f210,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f212,plain,
sk1 = sk4,
inference(definition_unfolding,[],[f205,f207]) ).
fof(f216,plain,
( neq(sk4,nil)
| nil = sk4 ),
inference(definition_unfolding,[],[f208,f204,f204]) ).
fof(f218,plain,
( neq(sk4,nil)
| nil != sk4 ),
inference(definition_unfolding,[],[f210,f212,f204]) ).
tcf(c_303,plain,
! [X0: $i] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_433,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_434,negated_conjecture,
( neq(sk4,nil)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_435,negated_conjecture,
! [X0: $i] :
( ( sk4 = nil )
| ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f250]) ).
tcf(c_436,negated_conjecture,
( neq(sk4,nil)
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_437,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil)
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f251]) ).
tcf(c_553,negated_conjecture,
neq(sk4,nil),
inference(global_subsumption_just,[status(thm)],[c_434,c_434,c_436]) ).
tcf(c_555,negated_conjecture,
neq(sk4,nil),
inference(global_subsumption_just,[status(thm)],[c_436,c_553]) ).
tcf(c_563,plain,
! [X0: $i] :
( ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_435,c_435,c_437]) ).
tcf(c_564,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil) ),
inference(renaming,[status(thm)],[c_563]) ).
tcf(c_565,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil) ),
inference(global_subsumption_just,[status(thm)],[c_437,c_564]) ).
tcf(c_2985,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ( nil != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_565,c_555]) ).
tcf(c_2986,plain,
( ~ ssList(sk4)
| ~ rearsegP(sk4,sk4) ),
inference(unflattening,[status(thm)],[c_2985]) ).
tcf(c_2987,plain,
~ rearsegP(sk4,sk4),
inference(global_subsumption_just,[status(thm)],[c_2986,c_433,c_2986]) ).
tcf(c_6510,plain,
~ rearsegP(sk4,sk4),
inference(demodulation,[status(thm)],[c_2987]) ).
tcf(c_6512,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_433]) ).
tcf(c_9041,plain,
~ ssList(sk4),
inference(superposition,[status(thm)],[c_303,c_6510]) ).
tcf(c_9042,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9041,c_6512]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC047-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.09/1.20 % Computer : n004.cluster.edu
% 0.09/1.20 % Model : x86_64 x86_64
% 0.09/1.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/1.20 % Memory : 8046.5625MB
% 0.09/1.20 % OS : Linux 6.8.0-71-generic
% 0.09/1.21 % CPULimit : 300
% 0.09/1.21 % WCLimit : 300
% 0.09/1.21 % DateTime : Thu Sep 24 16:05:39 UTC 2026
% 0.09/1.21 % CPUTime :
% 0.09/1.21 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/1.25 Running first-order theorem proving
% 0.09/1.25 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.09/1.26
% 0.09/1.26 % ======== iProver multi-core TPTP/SMT =========
% 0.09/1.26
% 0.09/1.26 % Detected problem language: tptp
% 0.09/1.27 % Proving...
% 0.14/1.91 % SZS status Started for theBenchmark.p
% 0.14/1.91 % SZS status Unsatisfiable for theBenchmark.p
% 0.14/1.91
% 0.14/1.91 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.14/1.91
% 0.14/1.91 % ------ iProver source info
% 0.14/1.91
% 0.14/1.91 % git: date: 2026-07-19 20:42:38 +0200
% 0.14/1.91 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.14/1.91 % git: non_committed_changes: false
% 0.14/1.91
% 0.14/1.91 % ------ Parsing...% successful
% 0.14/1.91
% 0.14/1.91
% 0.14/1.91 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.14/1.91
% 0.14/1.91 % ------ 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 %
% 0.14/1.91
% 0.14/1.91 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.14/1.91
% 0.14/1.91 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.14/1.91 % ------ Proving...
% 0.14/1.91 % ------ Problem Properties
% 0.14/1.91
% 0.14/1.91 %
% 0.14/1.91 % clauses 181
% 0.14/1.91 % conjectures 1
% 0.14/1.91 % EPR 56
% 0.14/1.91 % Horn 153
% 0.14/1.91 % unary 61
% 0.14/1.91 % binary 21
% 0.14/1.91 % lits 547
% 0.14/1.91 % lits eq 71
% 0.14/1.91 % fd_pure 0
% 0.14/1.91 % fd_pseudo 0
% 0.14/1.91 % fd_cond 16
% 0.14/1.91 % fd_pseudo_cond 14
% 0.14/1.91 % AC symbols 0
% 0.14/1.91
% 0.14/1.91 % ------ Schedule dynamic 5 is on
% 0.14/1.91
% 0.14/1.91 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.14/1.91
% 0.14/1.91
% 0.14/1.91 % ------
% 0.14/1.91 % Current options:
% 0.14/1.91 % ------
% 0.14/1.91
% 0.14/1.91
% 0.14/1.91 %
% 0.14/1.91
% 0.14/1.91 % ------ Proving...
% 0.14/1.91 %
% 0.14/1.91
% 0.14/1.91 % SZS status Unsatisfiable for theBenchmark.p
% 0.14/1.91
% 0.14/1.91 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.14/1.91
% 0.14/1.91
%------------------------------------------------------------------------------