%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC258+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 : n019.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:03 PM UTC 2026
% Result : Theorem 3.69s 1.33s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 15 unt; 1 def)
% Number of atoms : 130 ( 45 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 126 ( 38 ~; 36 |; 41 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 17 !; 12 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f180,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( nil = sK55
& nil = sK56 )
| ( ssItem(sK57)
& ! [X5] :
( ~ leq(X5,sK57)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) )
& memberP(sK56,sK57)
& sK55 = cons(sK57,nil) ) )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
fof(f451,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f180]) ).
fof(f452,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f500,plain,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( nil = sK55
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
~ totalorderedP(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
~ totalorderedP(sK55),
inference(definition_unfolding,[],[f508,f509]) ).
tcf(c_203,plain,
! [X0: $i] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f451]) ).
tcf(c_204,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f452]) ).
tcf(c_246,negated_conjecture,
~ totalorderedP(sK55),
inference(cnf_transformation,[],[f511]) ).
tcf(c_248,negated_conjecture,
( ( nil = sK55 )
| ( cons(sK57,nil) = sK55 ) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_254,negated_conjecture,
( ssItem(sK57)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_8954,definition,
iPr_def_10 = cons(sK57,nil),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8957,negated_conjecture,
( ssItem(sK57)
| ( nil = sK55 ) ),
inference(demodulation,[status(thm)],[c_254]) ).
tcf(c_8963,negated_conjecture,
( ( iPr_def_10 = sK55 )
| ( nil = sK55 ) ),
inference(demodulation,[status(thm)],[c_248,c_8954]) ).
tcf(c_8965,negated_conjecture,
~ totalorderedP(sK55),
inference(demodulation,[status(thm)],[c_246]) ).
tcf(c_11863,plain,
( ( sK55 = iPr_def_10 )
| ~ totalorderedP(nil) ),
inference(superposition,[status(thm)],[c_8963,c_8965]) ).
tcf(c_11910,plain,
sK55 = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_11863,c_204,c_11863]) ).
tcf(c_11916,plain,
( ssItem(sK57)
| ( nil = iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_8957,c_11910]) ).
tcf(c_11917,plain,
~ totalorderedP(iPr_def_10),
inference(demodulation,[status(thm)],[c_8965,c_11910]) ).
tcf(c_12086,plain,
( totalorderedP(iPr_def_10)
| ~ ssItem(sK57) ),
inference(superposition,[status(thm)],[c_8954,c_203]) ).
tcf(c_12087,plain,
~ ssItem(sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_12086,c_11917]) ).
tcf(c_12088,plain,
nil = iPr_def_10,
inference(backward_subsumption_resolution,[status(thm)],[c_11916,c_12087]) ).
tcf(c_12107,plain,
totalorderedP(iPr_def_10),
inference(demodulation,[status(thm)],[c_204,c_12088]) ).
tcf(c_12113,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12107,c_11917]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC258+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 : n019.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:15:49 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.44 Running first-order theorem proving
% 0.11/0.44 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.46
% 0.11/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.46
% 0.11/0.46 % Detected problem language: tptp
% 0.11/0.48 % Proving...
% 3.69/1.33 % SZS status Started for theBenchmark.p
% 3.69/1.33 % SZS status Theorem for theBenchmark.p
% 3.69/1.33
% 3.69/1.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.69/1.33
% 3.69/1.33 % ------ iProver source info
% 3.69/1.33
% 3.69/1.33 % git: date: 2026-07-19 20:42:38 +0200
% 3.69/1.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.69/1.33 % git: non_committed_changes: false
% 3.69/1.33
% 3.69/1.33 % ------ Parsing...
% 3.69/1.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.69/1.33
% 3.69/1.33 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.69/1.33
% 3.69/1.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.69/1.33
% 3.69/1.33 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.69/1.33 % ------ Proving...
% 3.69/1.33 % ------ Problem Properties
% 3.69/1.33
% 3.69/1.33 %
% 3.69/1.33 % clauses 192
% 3.69/1.33 % conjectures 11
% 3.69/1.33 % EPR 60
% 3.69/1.33 % Horn 116
% 3.69/1.33 % unary 20
% 3.69/1.33 % binary 46
% 3.69/1.33 % lits 644
% 3.69/1.33 % lits eq 91
% 3.69/1.33 % fd_pure 0
% 3.69/1.33 % fd_pseudo 0
% 3.69/1.33 % fd_cond 23
% 3.69/1.33 % fd_pseudo_cond 14
% 3.69/1.33 % AC symbols 0
% 3.69/1.33
% 3.69/1.33 % ------ Schedule dynamic 5 is on
% 3.69/1.33
% 3.69/1.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.33
% 3.69/1.33
% 3.69/1.33 % ------
% 3.69/1.33 % Current options:
% 3.69/1.33 % ------
% 3.69/1.33
% 3.69/1.33
% 3.69/1.33 %
% 3.69/1.33
% 3.69/1.33 % ------ Proving...
% 3.69/1.33 %
% 3.69/1.33
% 3.69/1.33 % SZS status Theorem for theBenchmark.p
% 3.69/1.33
% 3.69/1.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.33
% 3.69/1.33
%------------------------------------------------------------------------------