%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC214-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:08:54 PM UTC 2026
% Result : Unsatisfiable 55.08s 8.44s
% Output : CNFRefutation 55.08s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f244ERROR: Could not build tree for root c_112649ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
fof(f66,axiom,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f77,axiom,
! [X0] :
( nil = X0
| ssList(tl(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause77) ).
fof(f78,axiom,
! [X0] :
( nil = X0
| ssItem(hd(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause78) ).
fof(f83,axiom,
! [X0] :
( frontsegP(nil,X0)
| ~ ssList(X0)
| nil != X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause83) ).
fof(f84,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f98,axiom,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| nil != cons(X0,X1) ),
inference(reorient_equations,[],[f98]) ).
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(f107,axiom,
! [X0] :
( nil = X0
| cons(hd(X0),tl(X0)) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
fof(f155,axiom,
! [X2,X0,X1] :
( frontsegP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
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,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f209,negated_conjecture,
! [X0] :
( ~ strictorderedP(X0)
| ~ segmentP(X0,sk3)
| ~ frontsegP(sk4,X0)
| ~ neq(sk3,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
~ neq(sk3,nil),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f217,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f83]) ).
fof(f226,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f155]) ).
tcf(c_252,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_300,plain,
! [X0: $i] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_310,plain,
! [X0: $i] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f66]) ).
tcf(c_318,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_321,plain,
! [X0: $i] :
( ssList(tl(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_322,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_327,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_328,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_329,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_342,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_348,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(hd(X0),tl(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_359,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f240]) ).
tcf(c_388,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_422,plain,
! [X0: $i,X1: $i,X2: $i] :
( frontsegP(cons(X2,X0),cons(X2,X1))
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_432,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_433,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_434,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f213]) ).
tcf(c_437,negated_conjecture,
! [X0: $i] :
( ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(X0,sk3)
| ~ frontsegP(sk4,X0)
| ~ neq(sk3,X0) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_438,negated_conjecture,
~ neq(sk3,nil),
inference(cnf_transformation,[],[f214]) ).
tcf(c_499,plain,
( ( nil = nil )
| ~ ssList(nil)
| ~ frontsegP(nil,nil) ),
inference(instantiation,[status(thm)],[c_328]) ).
tcf(c_795,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_388,c_329]) ).
tcf(c_2984,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ strictorderedP(X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X0,sk3)
| ~ frontsegP(sk4,X0)
| ( X2 != sk3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_437,c_344]) ).
tcf(c_2985,plain,
! [X0: $i] :
( ( X0 = sk3 )
| ~ ssList(sk3)
| ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(X0,sk3)
| ~ frontsegP(sk4,X0) ),
inference(unflattening,[status(thm)],[c_2984]) ).
tcf(c_2987,plain,
! [X0: $i] :
( ( X0 = sk3 )
| ~ frontsegP(sk4,X0)
| ~ segmentP(X0,sk3)
| ~ ssList(X0)
| ~ strictorderedP(X0) ),
inference(global_subsumption_just,[status(thm)],[c_2985,c_432,c_2985]) ).
tcf(c_2988,plain,
! [X0: $i] :
( ( X0 = sk3 )
| ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(X0,sk3)
| ~ frontsegP(sk4,X0) ),
inference(renaming,[status(thm)],[c_2987]) ).
tcf(c_3037,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != sk3 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_344,c_438]) ).
tcf(c_3038,plain,
( ( nil = sk3 )
| ~ ssList(nil)
| ~ ssList(sk3) ),
inference(unflattening,[status(thm)],[c_3037]) ).
tcf(c_3039,plain,
nil = sk3,
inference(global_subsumption_just,[status(thm)],[c_3038,c_432,c_252,c_3038]) ).
tcf(c_3052,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_359,c_434]) ).
tcf(c_3053,plain,
( ~ ssList(sk4)
| ( sk4 != nil ) ),
inference(unflattening,[status(thm)],[c_3052]) ).
tcf(c_3059,plain,
( ( nil != nil )
| ( sk3 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_434,c_438]) ).
tcf(c_3060,plain,
sk3 != sk4,
inference(global_subsumption_just,[status(thm)],[c_3059,c_252,c_327,c_499,c_3059]) ).
tcf(c_4760,plain,
sk4 != nil,
inference(light_normalisation,[status(thm)],[c_3060,c_3039]) ).
tcf(c_5111,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(X0,nil)
| ~ frontsegP(sk4,X0) ),
inference(light_normalisation,[status(thm)],[c_2988,c_3039]) ).
tcf(c_5117,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ frontsegP(sk4,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5111,c_300]) ).
tcf(c_9498,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ frontsegP(sk4,X0) ),
inference(demodulation,[status(thm)],[c_5117]) ).
tcf(c_9500,plain,
sk4 != nil,
inference(demodulation,[status(thm)],[c_4760]) ).
tcf(c_9502,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_433]) ).
tcf(c_13157,plain,
( ssList(tl(sk4))
| ( sk4 = nil )
| ~ ssList(sk4) ),
inference(instantiation,[status(thm)],[c_321]) ).
tcf(c_13158,plain,
( ssItem(hd(sk4))
| ( sk4 = nil )
| ~ ssList(sk4) ),
inference(instantiation,[status(thm)],[c_322]) ).
tcf(c_13330,plain,
( ( sk4 = nil )
| ( cons(hd(sk4),tl(sk4)) = sk4 ) ),
inference(superposition,[status(thm)],[c_9502,c_348]) ).
tcf(c_13362,plain,
cons(hd(sk4),tl(sk4)) = sk4,
inference(forward_subsumption_resolution,[status(thm)],[c_13330,c_9500]) ).
tcf(c_17569,plain,
! [X0: $i] :
( frontsegP(sk4,cons(hd(sk4),X0))
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ~ frontsegP(tl(sk4),X0) ),
inference(superposition,[status(thm)],[c_13362,c_422]) ).
tcf(c_17627,plain,
( frontsegP(sk4,cons(hd(sk4),nil))
| ~ ssList(nil)
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ~ frontsegP(tl(sk4),nil) ),
inference(instantiation,[status(thm)],[c_17569]) ).
tcf(c_19594,plain,
! [X0: $i,X1: $i] :
( ( cons(X0,X1) = nil )
| ~ strictorderedP(cons(X0,X1))
| ~ ssList(cons(X0,X1))
| ~ frontsegP(sk4,cons(X0,X1)) ),
inference(instantiation,[status(thm)],[c_9498]) ).
tcf(c_22800,plain,
! [X0: $i] :
( ssList(cons(hd(sk4),X0))
| ~ ssList(X0)
| ~ ssItem(hd(sk4)) ),
inference(instantiation,[status(thm)],[c_330]) ).
tcf(c_22801,plain,
( ssList(cons(hd(sk4),nil))
| ~ ssList(nil)
| ~ ssItem(hd(sk4)) ),
inference(instantiation,[status(thm)],[c_22800]) ).
tcf(c_42766,plain,
! [X0: $i] :
( ( cons(hd(sk4),X0) = nil )
| ~ strictorderedP(cons(hd(sk4),X0))
| ~ ssList(cons(hd(sk4),X0))
| ~ frontsegP(sk4,cons(hd(sk4),X0)) ),
inference(instantiation,[status(thm)],[c_19594]) ).
tcf(c_42767,plain,
( ( cons(hd(sk4),nil) = nil )
| ~ strictorderedP(cons(hd(sk4),nil))
| ~ ssList(cons(hd(sk4),nil))
| ~ frontsegP(sk4,cons(hd(sk4),nil)) ),
inference(instantiation,[status(thm)],[c_42766]) ).
tcf(c_106098,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ ssItem(hd(sk4))
| ( cons(hd(sk4),X0) != nil ) ),
inference(instantiation,[status(thm)],[c_342]) ).
tcf(c_106099,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| ( cons(hd(sk4),nil) != nil ) ),
inference(instantiation,[status(thm)],[c_106098]) ).
tcf(c_109070,plain,
( strictorderedP(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4)) ),
inference(instantiation,[status(thm)],[c_310]) ).
tcf(c_111347,plain,
! [X0: $i] :
( ( X0 = nil )
| ( app(nil,tl(X0)) = tl(X0) )
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_321,c_318]) ).
tcf(c_112041,plain,
( ( sk4 = nil )
| ( app(nil,tl(sk4)) = tl(sk4) ) ),
inference(superposition,[status(thm)],[c_9502,c_111347]) ).
tcf(c_112073,plain,
app(nil,tl(sk4)) = tl(sk4),
inference(forward_subsumption_resolution,[status(thm)],[c_112041,c_9500]) ).
tcf(c_112641,plain,
( frontsegP(tl(sk4),nil)
| ~ ssList(nil)
| ~ ssList(tl(sk4)) ),
inference(superposition,[status(thm)],[c_112073,c_795]) ).
tcf(c_112643,plain,
( frontsegP(tl(sk4),nil)
| ~ ssList(tl(sk4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_112641,c_252]) ).
tcf(c_112649,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_112643,c_109070,c_106099,c_42767,c_22801,c_17627,c_13158,c_13157,c_3053,c_252,c_433]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC214-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/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.02/0.36 % CPULimit : 300
% 0.02/0.36 % WCLimit : 300
% 0.02/0.36 % DateTime : Thu Sep 24 17:01:06 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.39 Running first-order theorem proving
% 0.02/0.39 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/0.40
% 0.02/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.40
% 0.02/0.41 % Detected problem language: tptp
% 0.02/0.42 % Proving...
% 55.08/8.44 % SZS status Started for theBenchmark.p
% 55.08/8.44 % SZS status Unsatisfiable for theBenchmark.p
% 55.08/8.44
% 55.08/8.44 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 55.08/8.44
% 55.08/8.44 % ------ iProver source info
% 55.08/8.44
% 55.08/8.44 % git: date: 2026-07-19 20:42:38 +0200
% 55.08/8.44 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 55.08/8.44 % git: non_committed_changes: false
% 55.08/8.44
% 55.08/8.44 % ------ Parsing...% successful
% 55.08/8.44
% 55.08/8.44
% 55.08/8.44 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 55.08/8.44
% 55.08/8.44 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 8 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 55.08/8.44
% 55.08/8.44 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 55.08/8.44
% 55.08/8.44 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 55.08/8.44 % ------ Proving...
% 55.08/8.44 % ------ Problem Properties
% 55.08/8.44
% 55.08/8.44 %
% 55.08/8.44 % clauses 182
% 55.08/8.44 % conjectures 1
% 55.08/8.44 % EPR 57
% 55.08/8.44 % Horn 154
% 55.08/8.44 % unary 62
% 55.08/8.44 % binary 21
% 55.08/8.44 % lits 549
% 55.08/8.44 % lits eq 72
% 55.08/8.44 % fd_pure 0
% 55.08/8.44 % fd_pseudo 0
% 55.08/8.44 % fd_cond 16
% 55.08/8.44 % fd_pseudo_cond 14
% 55.08/8.44 % AC symbols 0
% 55.08/8.44
% 55.08/8.44 % ------ Schedule dynamic 5 is on
% 55.08/8.44
% 55.08/8.44 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 55.08/8.44
% 55.08/8.44
% 55.08/8.44 % ------
% 55.08/8.44 % Current options:
% 55.08/8.44 % ------
% 55.08/8.44
% 55.08/8.44
% 55.08/8.44 %
% 55.08/8.44
% 55.08/8.44 % ------ Proving...
% 55.08/8.44 %
% 55.08/8.44
% 55.08/8.44 % SZS status Unsatisfiable for theBenchmark.p
% 55.08/8.44
% 55.08/8.44 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 55.08/8.44
% 55.08/8.44
%------------------------------------------------------------------------------