%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC069-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 : n026.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:45 PM UTC 2026
% Result : Unsatisfiable 3.63s 11.30s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 96 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 108 ( 56 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(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,
! [X0] :
( ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
! [X0] :
( ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f216,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
tcf(c_254,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_346,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_435,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_436,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_437,negated_conjecture,
( ( sk3 = nil )
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_438,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_439,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_440,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_441,negated_conjecture,
( segmentP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_442,negated_conjecture,
( segmentP(sk3,sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_556,negated_conjecture,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_437,c_437,c_438]) ).
tcf(c_560,negated_conjecture,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_438,c_556]) ).
tcf(c_6564,negated_conjecture,
sk4 != nil,
inference(demodulation,[status(thm)],[c_560]) ).
tcf(c_6565,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ~ neq(X0,nil) ),
inference(demodulation,[status(thm)],[c_436]) ).
tcf(c_6566,negated_conjecture,
( segmentP(sk3,sk5)
| ~ neq(sk4,nil) ),
inference(demodulation,[status(thm)],[c_442]) ).
tcf(c_6567,negated_conjecture,
( segmentP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(demodulation,[status(thm)],[c_441]) ).
tcf(c_6568,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
inference(demodulation,[status(thm)],[c_440]) ).
tcf(c_6569,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
inference(demodulation,[status(thm)],[c_439]) ).
tcf(c_6570,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_435]) ).
tcf(c_10615,plain,
( neq(sk5,nil)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_346,c_6568]) ).
tcf(c_10616,plain,
( segmentP(sk4,sk5)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_346,c_6567]) ).
tcf(c_10617,plain,
( segmentP(sk3,sk5)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_346,c_6566]) ).
tcf(c_10618,plain,
( ssList(sk5)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_346,c_6569]) ).
tcf(c_10621,plain,
ssList(sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_10618,c_6564,c_254,c_6570]) ).
tcf(c_10622,plain,
segmentP(sk3,sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_10617,c_6564,c_254,c_6570]) ).
tcf(c_10623,plain,
segmentP(sk4,sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_10616,c_6564,c_254,c_6570]) ).
tcf(c_10624,plain,
neq(sk5,nil),
inference(forward_subsumption_resolution,[status(thm)],[c_10615,c_6564,c_254,c_6570]) ).
tcf(c_10676,plain,
( ~ ssList(sk5)
| ~ segmentP(sk4,sk5)
| ~ segmentP(sk3,sk5) ),
inference(superposition,[status(thm)],[c_10624,c_6565]) ).
tcf(c_10677,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10676,c_10621,c_10623,c_10622]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC069-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/10.38 % Computer : n026.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Thu Sep 24 16:16:06 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.42 Running first-order theorem proving
% 0.14/10.42 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.14/10.43
% 0.14/10.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.43
% 0.14/10.43 % Detected problem language: tptp
% 0.14/10.45 % Proving...
% 3.63/11.30 % SZS status Started for theBenchmark.p
% 3.63/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.63/11.30
% 3.63/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.63/11.30
% 3.63/11.30 % ------ iProver source info
% 3.63/11.30
% 3.63/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.63/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.63/11.30 % git: non_committed_changes: false
% 3.63/11.30
% 3.63/11.30 % ------ Parsing...% successful
% 3.63/11.30
% 3.63/11.30
% 3.63/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.63/11.30
% 3.63/11.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.63/11.30
% 3.63/11.30 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.63/11.30
% 3.63/11.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.63/11.30 % ------ Proving...
% 3.63/11.30 % ------ Problem Properties
% 3.63/11.30
% 3.63/11.30 %
% 3.63/11.30 % clauses 189
% 3.63/11.30 % conjectures 8
% 3.63/11.30 % EPR 64
% 3.63/11.30 % Horn 159
% 3.63/11.30 % unary 61
% 3.63/11.30 % binary 27
% 3.63/11.30 % lits 568
% 3.63/11.30 % lits eq 72
% 3.63/11.30 % fd_pure 0
% 3.63/11.30 % fd_pseudo 0
% 3.63/11.30 % fd_cond 15
% 3.63/11.30 % fd_pseudo_cond 16
% 3.63/11.30 % AC symbols 0
% 3.63/11.30
% 3.63/11.30 % ------ Schedule dynamic 5 is on
% 3.63/11.30
% 3.63/11.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.63/11.30
% 3.63/11.30
% 3.63/11.30 % ------
% 3.63/11.30 % Current options:
% 3.63/11.30 % ------
% 3.63/11.30
% 3.63/11.30
% 3.63/11.30 %
% 3.63/11.30
% 3.63/11.30 % ------ Proving...
% 3.63/11.30 %
% 3.63/11.30
% 3.63/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.63/11.30
% 3.63/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/11.30
% 3.63/11.30
%------------------------------------------------------------------------------