%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC017+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 : n020.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:31 PM UTC 2026
% Result : Theorem 0.80s 1.29s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f210ERROR: Could not build tree for root c_2801ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f104,plain,
! [X0] :
( ~ ssList(X0)
| ( frontsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f109,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f130,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f135,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ frontsegP(nil,X0)
| nil = X0 )
& ( nil != X0
| frontsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f143,plain,
ssList(sK0),
inference(cnf_transformation,[],[f130]) ).
fof(f144,plain,
ssList(sK1),
inference(cnf_transformation,[],[f130]) ).
fof(f146,plain,
( frontsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f147,plain,
( neq(sK2,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f148,plain,
( frontsegP(sK3,sK2)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f150,plain,
! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK0 ),
inference(cnf_transformation,[],[f130]) ).
fof(f151,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f130]) ).
fof(f152,plain,
! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f154,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f155,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f168,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f169,plain,
! [X0] :
( ~ ssList(X0)
| ~ frontsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f135]) ).
fof(f176,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f198,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f152,f155,f155,f154]) ).
fof(f199,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f151,f154,f155]) ).
fof(f200,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK2 ),
inference(definition_unfolding,[],[f150,f154,f155,f154]) ).
fof(f201,plain,
ssList(sK3),
inference(definition_unfolding,[],[f144,f155]) ).
fof(f202,plain,
ssList(sK2),
inference(definition_unfolding,[],[f143,f154]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( ( sK3 = nil )
| ~ ssList(X0)
| ~ frontsegP(sK2,X0)
| ~ frontsegP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_52,negated_conjecture,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ frontsegP(sK2,X0)
| ~ frontsegP(sK3,X0)
| ~ neq(X0,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_54,negated_conjecture,
( neq(sK2,nil)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_55,negated_conjecture,
( frontsegP(sK3,sK2)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_56,negated_conjecture,
( neq(sK2,nil)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_57,negated_conjecture,
( frontsegP(sK3,sK2)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_59,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f201]) ).
tcf(c_60,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f202]) ).
tcf(c_65,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_72,plain,
ssList(nil),
inference(cnf_transformation,[],[f168]) ).
tcf(c_74,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_80,plain,
! [X0: $i] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_801,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( nil != sK2 )
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_65]) ).
tcf(c_802,plain,
( ~ ssList(sK3)
| ( nil != sK2 )
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_801]) ).
tcf(c_817,plain,
! [X0: $i] :
( ( sK3 = nil )
| ~ ssList(X0)
| ~ frontsegP(sK2,X0)
| ~ frontsegP(sK3,X0)
| ( nil != sK2 )
| ( nil != nil )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_54]) ).
tcf(c_818,plain,
( ( sK3 = nil )
| ~ ssList(sK2)
| ~ frontsegP(sK2,sK2)
| ~ frontsegP(sK3,sK2)
| ( nil != sK2 ) ),
inference(unflattening,[status(thm)],[c_817]) ).
tcf(c_819,plain,
( ~ frontsegP(sK2,sK2)
| ( nil != sK2 ) ),
inference(global_subsumption_just,[status(thm)],[c_818,c_60,c_59,c_55,c_802,c_818]) ).
tcf(c_827,plain,
! [X0: $i] :
( ( nil = sK2 )
| ( sK3 = nil )
| ~ ssList(X0)
| ~ frontsegP(sK2,X0)
| ~ frontsegP(sK3,X0)
| ( nil != nil )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
tcf(c_828,plain,
( ( nil = sK2 )
| ( sK3 = nil )
| ~ ssList(sK2)
| ~ frontsegP(sK2,sK2)
| ~ frontsegP(sK3,sK2) ),
inference(unflattening,[status(thm)],[c_827]) ).
tcf(c_829,plain,
( ~ frontsegP(sK2,sK2)
| ( sK3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_828,c_60,c_55,c_819,c_828]) ).
tcf(c_830,plain,
( ( sK3 = nil )
| ~ frontsegP(sK2,sK2) ),
inference(renaming,[status(thm)],[c_829]) ).
tcf(c_943,plain,
! [X0: $i] :
( ( sK3 = nil )
| ~ ssList(X0)
| ( X0 != sK2 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_65]) ).
tcf(c_944,plain,
( ( sK3 = nil )
| ~ ssList(nil)
| ( nil != sK2 ) ),
inference(unflattening,[status(thm)],[c_943]) ).
tcf(c_945,plain,
nil != sK2,
inference(global_subsumption_just,[status(thm)],[c_944,c_59,c_72,c_802,c_944]) ).
tcf(c_970,negated_conjecture,
frontsegP(sK3,sK2),
inference(global_subsumption_just,[status(thm)],[c_55,c_57,c_945]) ).
tcf(c_2710,plain,
( ( sK3 = nil )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_80,c_830]) ).
tcf(c_2711,plain,
sK3 = nil,
inference(forward_subsumption_resolution,[status(thm)],[c_2710,c_60]) ).
tcf(c_2712,plain,
frontsegP(nil,sK2),
inference(demodulation,[status(thm)],[c_970,c_2711]) ).
tcf(c_2800,plain,
( ( nil = sK2 )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_2712,c_74]) ).
tcf(c_2801,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2800,c_945,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC017+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.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 15:56:48 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.80/1.29 % SZS status Started for theBenchmark.p
% 0.80/1.29 % SZS status Theorem for theBenchmark.p
% 0.80/1.29
% 0.80/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.80/1.29
% 0.80/1.29 % ------ iProver source info
% 0.80/1.29
% 0.80/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.80/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.80/1.29 % git: non_committed_changes: false
% 0.80/1.29
% 0.80/1.29 % ------ Parsing...
% 0.80/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.80/1.29
% 0.80/1.29 % ------ 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 sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 0.80/1.29
% 0.80/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.80/1.29
% 0.80/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.80/1.29 % ------ Proving...
% 0.80/1.29 % ------ Problem Properties
% 0.80/1.29
% 0.80/1.29 %
% 0.80/1.29 % clauses 43
% 0.80/1.29 % conjectures 3
% 0.80/1.29 % EPR 17
% 0.80/1.29 % Horn 39
% 0.80/1.29 % unary 10
% 0.80/1.29 % binary 5
% 0.80/1.29 % lits 137
% 0.80/1.29 % lits eq 34
% 0.80/1.29 % fd_pure 0
% 0.80/1.29 % fd_pseudo 0
% 0.80/1.29 % fd_cond 6
% 0.80/1.29 % fd_pseudo_cond 6
% 0.80/1.29 % AC symbols 0
% 0.80/1.29
% 0.80/1.29 % ------ Schedule dynamic 5 is on
% 0.80/1.29
% 0.80/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.80/1.29
% 0.80/1.29
% 0.80/1.29 % ------
% 0.80/1.29 % Current options:
% 0.80/1.29 % ------
% 0.80/1.29
% 0.80/1.29
% 0.80/1.29 %
% 0.80/1.29
% 0.80/1.29 % ------ Proving...
% 0.80/1.29 %
% 0.80/1.29
% 0.80/1.29 % SZS status Theorem for theBenchmark.p
% 0.80/1.29
% 0.80/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.80/1.29
% 0.80/1.29
%------------------------------------------------------------------------------