%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC065-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 : n008.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:44 PM UTC 2026
% Result : Unsatisfiable 3.20s 6.20s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f229ERROR: Could not build tree for root c_3667ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/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(f121,axiom,
! [X0,X1] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1) ),
inference(reorient_equations,[],[f121]) ).
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
sk4 = app(sk3,sk5),
inference(reorient_equations,[],[f207]) ).
fof(f212,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f214,negated_conjecture,
! [X0] :
( ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f215,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f220,plain,
! [X0] :
( ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| nil = sk4 ),
inference(definition_unfolding,[],[f214,f204,f204,f205]) ).
fof(f221,plain,
( neq(sk4,nil)
| nil != sk3 ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f226,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_251,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_252,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_253,negated_conjecture,
ssList(sk5),
inference(cnf_transformation,[],[f206]) ).
tcf(c_254,negated_conjecture,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[],[f208]) ).
tcf(c_255,negated_conjecture,
( ( sk4 = nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_257,negated_conjecture,
! [X0: $i] :
( ( sk4 = nil )
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_258,negated_conjecture,
( neq(sk4,nil)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_265,plain,
! [X0: $i,X1: $i] :
( ( X0 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_266,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_267,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_269,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_270,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_271,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_272,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,[],[f226]) ).
tcf(c_278,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_654,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sk4 = nil )
| ( X1 = X2 )
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ( X2 != nil )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_257,c_271]) ).
tcf(c_655,plain,
! [X0: $i] :
( ( sk4 = nil )
| ( X0 = nil )
| ~ ssList(nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(unflattening,[status(thm)],[c_654]) ).
tcf(c_657,plain,
! [X0: $i] :
( ( sk4 = nil )
| ( X0 = nil )
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_655,c_269,c_655]) ).
tcf(c_658,plain,
! [X0: $i] :
( ( sk4 = nil )
| ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(renaming,[status(thm)],[c_657]) ).
tcf(c_706,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( sk3 != nil )
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_258,c_270]) ).
tcf(c_707,plain,
( ~ ssList(sk4)
| ( sk4 != nil )
| ( sk3 != nil ) ),
inference(unflattening,[status(thm)],[c_706]) ).
tcf(c_708,plain,
sk3 != nil,
inference(global_subsumption_just,[status(thm)],[c_707,c_252,c_255,c_707]) ).
tcf(c_1402,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_251,c_267]) ).
tcf(c_1522,plain,
( ( sk3 = nil )
| ~ ssList(sk5)
| ~ ssList(sk3)
| ( sk4 != nil ) ),
inference(superposition,[status(thm)],[c_254,c_265]) ).
tcf(c_1531,plain,
sk4 != nil,
inference(forward_subsumption_resolution,[status(thm)],[c_1522,c_708,c_253,c_251]) ).
tcf(c_1648,plain,
( ( sk4 = nil )
| ( sk3 = nil )
| ~ ssList(sk3)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(instantiation,[status(thm)],[c_658]) ).
tcf(c_1824,plain,
( segmentP(sk3,sk3)
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_278]) ).
tcf(c_1996,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sk3),X0)) ),
inference(superposition,[status(thm)],[c_1402,c_272]) ).
tcf(c_2054,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(app(sk3,X0)) ),
inference(light_normalisation,[status(thm)],[c_1996,c_1402]) ).
tcf(c_2055,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(X0)
| ~ ssList(app(sk3,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2054,c_269,c_251]) ).
tcf(c_2387,plain,
! [X0: $i] :
( ssList(app(sk3,X0))
| ~ ssList(sk3)
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_266]) ).
tcf(c_3643,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_2055,c_251,c_2055,c_2387]) ).
tcf(c_3650,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk5) ),
inference(superposition,[status(thm)],[c_254,c_3643]) ).
tcf(c_3655,plain,
segmentP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_3650,c_253]) ).
tcf(c_3667,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3655,c_1824,c_1648,c_1531,c_708,c_251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC065-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.09/5.37 % Computer : n008.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Thu Sep 24 16:12:35 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 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/5.42
% 0.13/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.42
% 0.13/5.42 % Detected problem language: tptp
% 0.13/5.43 % Proving...
% 3.20/6.20 % SZS status Started for theBenchmark.p
% 3.20/6.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.20/6.20
% 3.20/6.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.20/6.20
% 3.20/6.20 % ------ iProver source info
% 3.20/6.20
% 3.20/6.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.20/6.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.20/6.20 % git: non_committed_changes: false
% 3.20/6.20
% 3.20/6.20 % ------ Parsing...% successful
% 3.20/6.20
% 3.20/6.20
% 3.20/6.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.20/6.20
% 3.20/6.20 % ------ 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 %
% 3.20/6.20
% 3.20/6.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.20/6.20
% 3.20/6.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.20/6.20 % ------ Proving...
% 3.20/6.20 % ------ Problem Properties
% 3.20/6.20
% 3.20/6.20 %
% 3.20/6.20 % clauses 25
% 3.20/6.20 % conjectures 4
% 3.20/6.20 % EPR 13
% 3.20/6.20 % Horn 24
% 3.20/6.20 % unary 8
% 3.20/6.20 % binary 4
% 3.20/6.20 % lits 74
% 3.20/6.20 % lits eq 19
% 3.20/6.20 % fd_pure 0
% 3.20/6.20 % fd_pseudo 0
% 3.20/6.20 % fd_cond 4
% 3.20/6.20 % fd_pseudo_cond 3
% 3.20/6.20 % AC symbols 0
% 3.20/6.20
% 3.20/6.20 % ------ Schedule dynamic 5 is on
% 3.20/6.20
% 3.20/6.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.20/6.20
% 3.20/6.20
% 3.20/6.20 % ------
% 3.20/6.20 % Current options:
% 3.20/6.20 % ------
% 3.20/6.20
% 3.20/6.20
% 3.20/6.20 %
% 3.20/6.20
% 3.20/6.20 % ------ Proving...
% 3.20/6.20 %
% 3.20/6.20
% 3.20/6.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.20/6.20
% 3.20/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.20/6.20
% 3.20/6.20
%------------------------------------------------------------------------------