%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC336-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 : n014.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:09:21 PM UTC 2026
% Result : Unsatisfiable 3.40s 1.20s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 133 ( 53 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 125 ( 53 ~; 72 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause4) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f67,axiom,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause67) ).
fof(f79,axiom,
! [X0] :
( segmentP(nil,X0)
| ~ ssList(X0)
| nil != X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
fof(f100,axiom,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
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,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f210,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
( nil = sk4
| sk3 = cons(sk5,nil) ),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
( nil = sk4
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f213,plain,
( nil = sk4
| sk4 = app(app(sk6,sk3),sk7) ),
inference(reorient_equations,[],[f212]) ).
fof(f216,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f218,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f219,plain,
( nil = sk3
| sk3 = cons(sk5,nil) ),
inference(reorient_equations,[],[f218]) ).
fof(f220,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f221,plain,
( nil = sk3
| sk4 = app(app(sk6,sk3),sk7) ),
inference(reorient_equations,[],[f220]) ).
fof(f224,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
fof(f227,plain,
( ~ totalorderedP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f224,f204,f205,f205]) ).
fof(f228,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f242,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_258,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f4]) ).
tcf(c_262,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_321,plain,
! [X0: $i] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_333,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_353,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_427,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,[],[f242]) ).
tcf(c_442,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_443,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_444,negated_conjecture,
( ssItem(sk5)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_445,negated_conjecture,
( ssItem(sk5)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_448,negated_conjecture,
( ( sk4 = nil )
| ( cons(sk5,nil) = sk3 ) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_449,negated_conjecture,
( ( sk4 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_452,negated_conjecture,
( ssList(sk6)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_453,negated_conjecture,
( ssList(sk7)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_454,negated_conjecture,
( ( sk3 = nil )
| ( cons(sk5,nil) = sk3 ) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_455,negated_conjecture,
( ( sk3 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_458,negated_conjecture,
( ~ totalorderedP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_526,plain,
segmentP(nil,nil),
inference(global_subsumption_just,[status(thm)],[c_333,c_262,c_333]) ).
tcf(c_624,plain,
( totalorderedP(sk3)
| ( sk3 = nil )
| ~ ssItem(sk5) ),
inference(superposition,[status(thm)],[c_454,c_321]) ).
tcf(c_673,plain,
( ( sk4 = nil )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( sk3 != nil ) ),
inference(superposition,[status(thm)],[c_448,c_353]) ).
tcf(c_1050,plain,
( segmentP(sk4,sk3)
| ( sk4 = nil )
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(app(app(sk6,sk3),sk7)) ),
inference(superposition,[status(thm)],[c_449,c_427]) ).
tcf(c_1051,plain,
( segmentP(sk4,sk3)
| ( sk3 = nil )
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(app(app(sk6,sk3),sk7)) ),
inference(superposition,[status(thm)],[c_455,c_427]) ).
tcf(c_1053,plain,
! [X0: $i] :
( segmentP(app(sk4,X0),sk7)
| ( sk3 = nil )
| ~ ssList(sk7)
| ~ ssList(X0)
| ~ ssList(app(sk6,sk3))
| ~ ssList(app(app(app(sk6,sk3),sk7),X0)) ),
inference(superposition,[status(thm)],[c_455,c_427]) ).
tcf(c_1831,plain,
( totalorderedP(sk3)
| ( sk3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_624,c_445,c_624]) ).
tcf(c_1855,plain,
( ( sk4 = nil )
| ( sk3 != nil ) ),
inference(global_subsumption_just,[status(thm)],[c_673,c_262,c_444,c_673]) ).
tcf(c_2877,plain,
( ~ ssList(app(app(sk6,sk3),sk7))
| ( sk3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_1051,c_442,c_453,c_452,c_458,c_1051,c_1831]) ).
tcf(c_2878,plain,
( ( sk3 = nil )
| ~ ssList(app(app(sk6,sk3),sk7)) ),
inference(renaming,[status(thm)],[c_2877]) ).
tcf(c_2885,plain,
( ( sk3 = nil )
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_455,c_2878]) ).
tcf(c_2886,plain,
sk4 = nil,
inference(global_subsumption_just,[status(thm)],[c_1050,c_443,c_1855,c_2885]) ).
tcf(c_2949,plain,
sk3 = nil,
inference(global_subsumption_just,[status(thm)],[c_1053,c_443,c_2885]) ).
tcf(c_2951,plain,
sk3 = sk4,
inference(superposition,[status(thm)],[c_2886,c_2949]) ).
tcf(c_2978,plain,
segmentP(sk3,sk3),
inference(superposition,[status(thm)],[c_2949,c_526]) ).
tcf(c_2979,plain,
totalorderedP(sk3),
inference(superposition,[status(thm)],[c_2949,c_258]) ).
tcf(c_3011,plain,
( ~ totalorderedP(sk3)
| ~ segmentP(sk3,sk3) ),
inference(demodulation,[status(thm)],[c_458,c_2951]) ).
tcf(c_3014,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3011,c_2978,c_2979]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC336-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.37 % Computer : n014.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 17:41:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 3.40/1.20 % SZS status Started for theBenchmark.p
% 3.40/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.40/1.20
% 3.40/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.40/1.20
% 3.40/1.20 % ------ iProver source info
% 3.40/1.20
% 3.40/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.40/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.40/1.20 % git: non_committed_changes: false
% 3.40/1.20
% 3.40/1.20 % ------ Parsing...% successful
% 3.40/1.20
% 3.40/1.20
% 3.40/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.40/1.20 % ------ Proving...
% 3.40/1.20 % ------ Problem Properties
% 3.40/1.20
% 3.40/1.20 %
% 3.40/1.20 % clauses 204
% 3.40/1.20 % conjectures 19
% 3.40/1.20 % EPR 71
% 3.40/1.20 % Horn 161
% 3.40/1.20 % unary 58
% 3.40/1.20 % binary 37
% 3.40/1.20 % lits 616
% 3.40/1.20 % lits eq 92
% 3.40/1.20 % fd_pure 0
% 3.40/1.20 % fd_pseudo 0
% 3.40/1.20 % fd_cond 17
% 3.40/1.20 % fd_pseudo_cond 17
% 3.40/1.20 % AC symbols 0
% 3.40/1.20
% 3.40/1.20 % ------ Input Options Time Limit: Unbounded
% 3.40/1.20
% 3.40/1.20
% 3.40/1.20 % ------
% 3.40/1.20 % Current options:
% 3.40/1.20 % ------
% 3.40/1.20
% 3.40/1.20
% 3.40/1.20 %
% 3.40/1.20
% 3.40/1.20 % ------ Proving...
% 3.40/1.20 %
% 3.40/1.20
% 3.40/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.40/1.20
% 3.40/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/1.20
% 3.40/1.20
%------------------------------------------------------------------------------