%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC112-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 : n019.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:57 PM UTC 2026
% Result : Unsatisfiable 4.59s 6.33s
% Output : CNFRefutation 4.59s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f240ERROR: Could not build tree for root c_6611ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f80,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
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(f187,axiom,
! [X2,X3,X0,X1] :
( segmentP(X3,X1)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| app(app(X0,X1),X2) != X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
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,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
sk4 = app(app(sk5,sk3),sk6),
inference(reorient_equations,[],[f208]) ).
fof(f215,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f217,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f223,plain,
( ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil)
| nil = sk4 ),
inference(definition_unfolding,[],[f217,f204,f205,f204,f205]) ).
fof(f224,plain,
( neq(sk4,nil)
| nil != sk3 ),
inference(definition_unfolding,[],[f218,f205,f204]) ).
fof(f233,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f187]) ).
tcf(c_253,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_254,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_255,negated_conjecture,
ssList(sk5),
inference(cnf_transformation,[],[f206]) ).
tcf(c_256,negated_conjecture,
ssList(sk6),
inference(cnf_transformation,[],[f207]) ).
tcf(c_257,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
inference(cnf_transformation,[],[f209]) ).
tcf(c_261,negated_conjecture,
( ( sk4 = nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_263,negated_conjecture,
( ( sk4 = nil )
| ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_264,negated_conjecture,
( neq(sk4,nil)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_285,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_299,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f240]) ).
tcf(c_301,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_306,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_1347,plain,
! [X0: $i,X1: $i] :
( ( sk4 = nil )
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sk4,sk3)
| ( X1 != sk3 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_301,c_263]) ).
tcf(c_1348,plain,
( ( nil = sk3 )
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ segmentP(sk4,sk3) ),
inference(unflattening,[status(thm)],[c_1347]) ).
tcf(c_1349,plain,
( ( nil = sk3 )
| ( sk4 = nil )
| ~ segmentP(sk4,sk3) ),
inference(global_subsumption_just,[status(thm)],[c_1348,c_253,c_285,c_1348]) ).
tcf(c_1398,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( sk3 != nil )
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_264,c_299]) ).
tcf(c_1399,plain,
( ~ ssList(sk4)
| ( sk4 != nil )
| ( sk3 != nil ) ),
inference(unflattening,[status(thm)],[c_1398]) ).
tcf(c_1400,plain,
sk3 != nil,
inference(global_subsumption_just,[status(thm)],[c_1399,c_254,c_261,c_1399]) ).
tcf(c_5645,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk6)
| ~ ssList(sk5)
| ~ ssList(sk3)
| ~ ssList(app(app(sk5,sk3),sk6)) ),
inference(superposition,[status(thm)],[c_257,c_302]) ).
tcf(c_5727,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk6)
| ~ ssList(sk5)
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(light_normalisation,[status(thm)],[c_5645,c_257]) ).
tcf(c_5728,plain,
segmentP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_5727,c_256,c_255,c_254,c_253]) ).
tcf(c_6029,plain,
( ( sk4 = nil )
| ( sk3 = nil ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1349,c_5728]) ).
tcf(c_6032,plain,
sk4 = nil,
inference(forward_subsumption_resolution,[status(thm)],[c_6029,c_1400]) ).
tcf(c_6607,plain,
segmentP(nil,sk3),
inference(light_normalisation,[status(thm)],[c_5728,c_6032]) ).
tcf(c_6608,plain,
( ( sk3 = nil )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6607,c_306]) ).
tcf(c_6611,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6608,c_1400,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC112-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.02/5.40 % Computer : n019.cluster.edu
% 0.02/5.40 % Model : x86_64 x86_64
% 0.02/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/5.40 % Memory : 8046.5625MB
% 0.02/5.40 % OS : Linux 6.8.0-71-generic
% 0.02/5.40 % CPULimit : 300
% 0.02/5.40 % WCLimit : 300
% 0.02/5.40 % DateTime : Thu Sep 24 16:28:10 UTC 2026
% 0.02/5.40 % CPUTime :
% 0.02/5.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/5.43 Running first-order theorem proving
% 0.02/5.43 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.02/5.44
% 0.02/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.02/5.44
% 0.02/5.44 % Detected problem language: tptp
% 0.02/5.46 % Proving...
% 4.59/6.33 % SZS status Started for theBenchmark.p
% 4.59/6.33 % SZS status Unsatisfiable for theBenchmark.p
% 4.59/6.33
% 4.59/6.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.59/6.33
% 4.59/6.33 % ------ iProver source info
% 4.59/6.33
% 4.59/6.33 % git: date: 2026-07-19 20:42:38 +0200
% 4.59/6.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.59/6.33 % git: non_committed_changes: false
% 4.59/6.33
% 4.59/6.33 % ------ Parsing...% successful
% 4.59/6.33
% 4.59/6.33
% 4.59/6.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.59/6.33
% 4.59/6.33 % ------ 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 %
% 4.59/6.33
% 4.59/6.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.59/6.33
% 4.59/6.33 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.59/6.33 % ------ Proving...
% 4.59/6.33 % ------ Problem Properties
% 4.59/6.33
% 4.59/6.33 %
% 4.59/6.33 % clauses 60
% 4.59/6.33 % conjectures 8
% 4.59/6.33 % EPR 26
% 4.59/6.33 % Horn 50
% 4.59/6.33 % unary 12
% 4.59/6.33 % binary 8
% 4.59/6.33 % lits 220
% 4.59/6.33 % lits eq 44
% 4.59/6.33 % fd_pure 0
% 4.59/6.33 % fd_pseudo 0
% 4.59/6.33 % fd_cond 11
% 4.59/6.33 % fd_pseudo_cond 7
% 4.59/6.33 % AC symbols 0
% 4.59/6.33
% 4.59/6.33 % ------ Schedule dynamic 5 is on
% 4.59/6.33
% 4.59/6.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.59/6.33
% 4.59/6.33
% 4.59/6.33 % ------
% 4.59/6.33 % Current options:
% 4.59/6.33 % ------
% 4.59/6.33
% 4.59/6.33
% 4.59/6.33 %
% 4.59/6.33
% 4.59/6.33 % ------ Proving...
% 4.59/6.33 %
% 4.59/6.33
% 4.59/6.33 % SZS status Unsatisfiable for theBenchmark.p
% 4.59/6.33
% 4.59/6.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.59/6.33
% 4.59/6.33
%------------------------------------------------------------------------------