%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC086+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 : n015.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:50 PM UTC 2026
% Result : Theorem 1.12s 1.29s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f201ERROR: Could not build tree for root c_1893ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f109,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f130,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( segmentP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f141,plain,
ssList(sK0),
inference(cnf_transformation,[],[f130]) ).
fof(f142,plain,
ssList(sK1),
inference(cnf_transformation,[],[f130]) ).
fof(f147,plain,
( segmentP(sK3,sK2)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f148,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f150,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f130]) ).
fof(f151,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f152,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f169,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f191,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f150,f152]) ).
fof(f192,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f149,f152,f151]) ).
fof(f193,plain,
ssList(sK3),
inference(definition_unfolding,[],[f142,f152]) ).
fof(f194,plain,
ssList(sK2),
inference(definition_unfolding,[],[f141,f151]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f191]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_51,negated_conjecture,
( neq(sK2,nil)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_52,negated_conjecture,
( segmentP(sK3,sK2)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_57,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f193]) ).
tcf(c_58,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f194]) ).
tcf(c_63,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f201]) ).
tcf(c_75,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_692,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_63]) ).
tcf(c_693,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_692]) ).
tcf(c_709,plain,
! [X0: $i] :
( ( sK3 = nil )
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ( nil != nil )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_51]) ).
tcf(c_710,plain,
( ( sK3 = nil )
| ~ ssList(sK2)
| ~ segmentP(sK2,sK2)
| ~ segmentP(sK3,sK2) ),
inference(unflattening,[status(thm)],[c_709]) ).
tcf(c_711,plain,
~ segmentP(sK2,sK2),
inference(global_subsumption_just,[status(thm)],[c_710,c_58,c_57,c_52,c_693,c_710]) ).
tcf(c_1892,plain,
~ ssList(sK2),
inference(superposition,[status(thm)],[c_75,c_711]) ).
tcf(c_1893,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1892,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC086+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.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 16:22:42 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.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.45 % Proving...
% 1.12/1.29 % SZS status Started for theBenchmark.p
% 1.12/1.29 % SZS status Theorem for theBenchmark.p
% 1.12/1.29
% 1.12/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.12/1.29
% 1.12/1.29 % ------ iProver source info
% 1.12/1.29
% 1.12/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.12/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.12/1.29 % git: non_committed_changes: false
% 1.12/1.29
% 1.12/1.29 % ------ Parsing...
% 1.12/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.12/1.29
% 1.12/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 %
% 1.12/1.29
% 1.12/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.12/1.29
% 1.12/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.12/1.29 % ------ Proving...
% 1.12/1.29 % ------ Problem Properties
% 1.12/1.29
% 1.12/1.29 %
% 1.12/1.29 % clauses 42
% 1.12/1.29 % conjectures 2
% 1.12/1.29 % EPR 18
% 1.12/1.29 % Horn 39
% 1.12/1.29 % unary 12
% 1.12/1.29 % binary 5
% 1.12/1.29 % lits 125
% 1.12/1.29 % lits eq 31
% 1.12/1.29 % fd_pure 0
% 1.12/1.29 % fd_pseudo 0
% 1.12/1.29 % fd_cond 6
% 1.12/1.29 % fd_pseudo_cond 5
% 1.12/1.29 % AC symbols 0
% 1.12/1.29
% 1.12/1.29 % ------ Schedule dynamic 5 is on
% 1.12/1.29
% 1.12/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.12/1.29
% 1.12/1.29
% 1.12/1.29 % ------
% 1.12/1.29 % Current options:
% 1.12/1.29 % ------
% 1.12/1.29
% 1.12/1.29
% 1.12/1.29 %
% 1.12/1.29
% 1.12/1.29 % ------ Proving...
% 1.12/1.29 %
% 1.12/1.29
% 1.12/1.29 % SZS status Theorem for theBenchmark.p
% 1.12/1.29
% 1.12/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.12/1.29
% 1.12/1.29
%------------------------------------------------------------------------------