%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC292+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 : n008.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:11 PM UTC 2026
% Result : Theorem 3.94s 6.32s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 53 ( 20 unt; 1 def)
% Number of atoms : 170 ( 64 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 174 ( 62 ~; 62 |; 35 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 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 : 38 ( 0 sgn 28 !; 10 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X3
& nil != X2 )
| strictorderedP(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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X3
& nil != X2 )
| strictorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f182,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ( nil != X3
| nil = X2 )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ( nil != X3
| nil = X2 )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ neq(sK56,nil)
| ( ssItem(sK57)
& memberP(sK56,sK57)
& sK55 = cons(sK57,nil) ) )
& ( nil != sK56
| nil = sK55 )
& ~ strictorderedP(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(f387,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f458,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f182]) ).
fof(f459,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ neq(sK56,nil)
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ strictorderedP(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
~ strictorderedP(sK55),
inference(definition_unfolding,[],[f504,f505]) ).
fof(f508,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f506]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f387]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_209,plain,
! [X0: $i] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f458]) ).
tcf(c_210,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f459]) ).
tcf(c_246,negated_conjecture,
~ strictorderedP(sK55),
inference(cnf_transformation,[],[f507]) ).
tcf(c_247,negated_conjecture,
( ( nil = sK55 )
| ( nil != sK56 ) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_248,negated_conjecture,
( ( cons(sK57,nil) = sK55 )
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_250,negated_conjecture,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f508]) ).
tcf(c_3228,plain,
! [X0: $i,X1: $i] :
( ssItem(sK57)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK56 ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_250]) ).
tcf(c_3229,plain,
( ssItem(sK57)
| ( sK56 = nil )
| ~ ssList(sK56)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3228]) ).
tcf(c_3230,plain,
( ssItem(sK57)
| ( sK56 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_3229,c_253,c_141,c_3229]) ).
tcf(c_3248,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( cons(sK57,nil) = sK55 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK56 ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_248]) ).
tcf(c_3249,plain,
( ( sK56 = nil )
| ( cons(sK57,nil) = sK55 )
| ~ ssList(sK56)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3248]) ).
tcf(c_3250,plain,
( ( sK56 = nil )
| ( cons(sK57,nil) = sK55 ) ),
inference(global_subsumption_just,[status(thm)],[c_3249,c_253,c_141,c_3249]) ).
tcf(c_8879,definition,
iPr_def_10 = cons(sK57,nil),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8880,plain,
( ( iPr_def_10 = sK55 )
| ( sK56 = nil ) ),
inference(demodulation,[status(thm)],[c_3250,c_8879]) ).
tcf(c_8882,plain,
( ssItem(sK57)
| ( sK56 = nil ) ),
inference(demodulation,[status(thm)],[c_3230]) ).
tcf(c_8885,negated_conjecture,
( ( nil = sK55 )
| ( nil != sK56 ) ),
inference(demodulation,[status(thm)],[c_247]) ).
tcf(c_8886,negated_conjecture,
~ strictorderedP(sK55),
inference(demodulation,[status(thm)],[c_246]) ).
tcf(c_11724,plain,
( ( nil = sK56 )
| ~ strictorderedP(iPr_def_10) ),
inference(superposition,[status(thm)],[c_8880,c_8886]) ).
tcf(c_11882,plain,
( strictorderedP(iPr_def_10)
| ~ ssItem(sK57) ),
inference(superposition,[status(thm)],[c_8879,c_209]) ).
tcf(c_11889,plain,
( strictorderedP(iPr_def_10)
| ( nil = sK56 ) ),
inference(superposition,[status(thm)],[c_8882,c_11882]) ).
tcf(c_11892,plain,
nil = sK56,
inference(global_subsumption_just,[status(thm)],[c_11889,c_11724,c_11889]) ).
tcf(c_11898,plain,
( ( nil = sK55 )
| ( nil != nil ) ),
inference(demodulation,[status(thm)],[c_8885,c_11892]) ).
tcf(c_11900,plain,
nil = sK55,
inference(equality_resolution_simp,[status(thm)],[c_11898]) ).
tcf(c_11901,plain,
~ strictorderedP(nil),
inference(demodulation,[status(thm)],[c_8886,c_11900]) ).
tcf(c_11903,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11901,c_210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC292+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.13/5.39 % Computer : n008.cluster.edu
% 0.13/5.39 % Model : x86_64 x86_64
% 0.13/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.39 % Memory : 8046.5625MB
% 0.13/5.39 % OS : Linux 6.8.0-71-generic
% 0.13/5.39 % CPULimit : 300
% 0.13/5.39 % WCLimit : 300
% 0.13/5.39 % DateTime : Thu Sep 24 17:28:01 UTC 2026
% 0.13/5.40 % CPUTime :
% 0.13/5.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/5.43 Running first-order theorem proving
% 0.17/5.43 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.17/5.45
% 0.17/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.17/5.45
% 0.17/5.45 % Detected problem language: tptp
% 0.17/5.46 % Proving...
% 3.94/6.32 % SZS status Started for theBenchmark.p
% 3.94/6.32 % SZS status Theorem for theBenchmark.p
% 3.94/6.32
% 3.94/6.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.94/6.32
% 3.94/6.32 % ------ iProver source info
% 3.94/6.32
% 3.94/6.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.94/6.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.94/6.32 % git: non_committed_changes: false
% 3.94/6.32
% 3.94/6.32 % ------ Parsing...
% 3.94/6.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.94/6.32
% 3.94/6.32 % ------ 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: 5 0s sf_e pe_s pe_e %
% 3.94/6.32
% 3.94/6.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.94/6.32
% 3.94/6.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.94/6.32 % ------ Proving...
% 3.94/6.32 % ------ Problem Properties
% 3.94/6.32
% 3.94/6.32 %
% 3.94/6.32 % clauses 188
% 3.94/6.32 % conjectures 4
% 3.94/6.32 % EPR 56
% 3.94/6.32 % Horn 117
% 3.94/6.32 % unary 20
% 3.94/6.32 % binary 44
% 3.94/6.32 % lits 630
% 3.94/6.32 % lits eq 85
% 3.94/6.32 % fd_pure 0
% 3.94/6.32 % fd_pseudo 0
% 3.94/6.32 % fd_cond 21
% 3.94/6.32 % fd_pseudo_cond 14
% 3.94/6.32 % AC symbols 0
% 3.94/6.32
% 3.94/6.32 % ------ Schedule dynamic 5 is on
% 3.94/6.32
% 3.94/6.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.94/6.32
% 3.94/6.32
% 3.94/6.32 % ------
% 3.94/6.32 % Current options:
% 3.94/6.32 % ------
% 3.94/6.32
% 3.94/6.32
% 3.94/6.32 %
% 3.94/6.32
% 3.94/6.32 % ------ Proving...
% 3.94/6.32 %
% 3.94/6.32
% 3.94/6.32 % SZS status Theorem for theBenchmark.p
% 3.94/6.32
% 3.94/6.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/6.32
% 3.94/6.32
%------------------------------------------------------------------------------