%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC275+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 : n005.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:06 PM UTC 2026
% Result : Theorem 1.29s 6.30s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 18 unt; 0 def)
% Number of atoms : 143 ( 53 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 158 ( 61 ~; 61 |; 25 &)
% ( 2 <=>; 9 =>; 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 : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 28 !; 5 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f108,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f115,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f160,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ~ neq(sK3,nil)
| ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f98]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f108]) ).
fof(f184,plain,
ssList(sK1),
inference(cnf_transformation,[],[f160]) ).
fof(f187,plain,
( ~ neq(sK3,nil)
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f160]) ).
fof(f188,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f160]) ).
fof(f189,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f160]) ).
fof(f190,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f160]) ).
fof(f191,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f160]) ).
fof(f192,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f160]) ).
fof(f208,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f163]) ).
fof(f211,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f228,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f229,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f115]) ).
fof(f270,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f190,f191]) ).
fof(f271,plain,
ssList(sK3),
inference(definition_unfolding,[],[f184,f192]) ).
tcf(c_50,negated_conjecture,
~ totalorderedP(sK2),
inference(cnf_transformation,[],[f270]) ).
tcf(c_51,negated_conjecture,
( ( sK2 = nil )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_52,negated_conjecture,
( ssItem(sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_53,negated_conjecture,
( ( cons(sK4,nil) = sK2 )
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_56,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f271]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_75,plain,
ssList(nil),
inference(cnf_transformation,[],[f211]) ).
tcf(c_91,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f228]) ).
tcf(c_92,plain,
! [X0: $i] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_1300,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( cons(sK4,nil) = sK2 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_71]) ).
tcf(c_1301,plain,
( ( sK3 = nil )
| ( cons(sK4,nil) = sK2 )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_1300]) ).
tcf(c_1302,plain,
( ( sK3 = nil )
| ( cons(sK4,nil) = sK2 ) ),
inference(global_subsumption_just,[status(thm)],[c_1301,c_56,c_75,c_1301]) ).
tcf(c_1324,plain,
! [X0: $i,X1: $i] :
( ssItem(sK4)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_71]) ).
tcf(c_1325,plain,
( ssItem(sK4)
| ( sK3 = nil )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_1324]) ).
tcf(c_1326,plain,
( ssItem(sK4)
| ( sK3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_1325,c_56,c_75,c_1325]) ).
tcf(c_3598,plain,
( totalorderedP(sK2)
| ( sK3 = nil )
| ~ ssItem(sK4) ),
inference(superposition,[status(thm)],[c_1302,c_92]) ).
tcf(c_3599,plain,
( ( sK3 = nil )
| ~ ssItem(sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3598,c_50]) ).
tcf(c_3606,plain,
sK3 = nil,
inference(global_subsumption_just,[status(thm)],[c_3599,c_1326,c_3599]) ).
tcf(c_3609,plain,
( ( sK2 = nil )
| ( nil != nil ) ),
inference(demodulation,[status(thm)],[c_51,c_3606]) ).
tcf(c_3611,plain,
sK2 = nil,
inference(equality_resolution_simp,[status(thm)],[c_3609]) ).
tcf(c_3612,plain,
~ totalorderedP(nil),
inference(demodulation,[status(thm)],[c_50,c_3611]) ).
tcf(c_3614,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3612,c_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC275+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/5.38 % Computer : n005.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 17:21:39 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/5.42 Running first-order theorem proving
% 0.16/5.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.16/5.43
% 0.16/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.43
% 0.16/5.43 % Detected problem language: tptp
% 0.16/5.45 % Proving...
% 1.29/6.30 % SZS status Started for theBenchmark.p
% 1.29/6.30 % SZS status Theorem for theBenchmark.p
% 1.29/6.30
% 1.29/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.29/6.30
% 1.29/6.30 % ------ iProver source info
% 1.29/6.30
% 1.29/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.29/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.29/6.30 % git: non_committed_changes: false
% 1.29/6.30
% 1.29/6.30 % ------ Parsing...
% 1.29/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.29/6.30
% 1.29/6.30 % ------ 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.29/6.30
% 1.29/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.29/6.30
% 1.29/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.29/6.30 % ------ Proving...
% 1.29/6.30 % ------ Problem Properties
% 1.29/6.30
% 1.29/6.30 %
% 1.29/6.30 % clauses 75
% 1.29/6.30 % conjectures 4
% 1.29/6.30 % EPR 21
% 1.29/6.30 % Horn 47
% 1.29/6.30 % unary 9
% 1.29/6.30 % binary 10
% 1.29/6.30 % lits 261
% 1.29/6.30 % lits eq 60
% 1.29/6.30 % fd_pure 0
% 1.29/6.30 % fd_pseudo 0
% 1.29/6.30 % fd_cond 15
% 1.29/6.30 % fd_pseudo_cond 8
% 1.29/6.30 % AC symbols 0
% 1.29/6.30
% 1.29/6.30 % ------ Schedule dynamic 5 is on
% 1.29/6.30
% 1.29/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.29/6.30
% 1.29/6.30
% 1.29/6.30 % ------
% 1.29/6.30 % Current options:
% 1.29/6.30 % ------
% 1.29/6.30
% 1.29/6.30
% 1.29/6.30 %
% 1.29/6.30
% 1.29/6.30 % ------ Proving...
% 1.29/6.30 %
% 1.29/6.30
% 1.29/6.30 % SZS status Theorem for theBenchmark.p
% 1.29/6.30
% 1.29/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/6.30
% 3.97/6.30
%------------------------------------------------------------------------------