%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC041+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 : 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:07:38 PM UTC 2026
% Result : Theorem 3.96s 1.31s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 19 unt; 0 def)
% Number of atoms : 160 ( 88 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 187 ( 64 ~; 56 |; 52 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 3 ( 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 38 !; 16 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/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] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f109,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f110,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f121,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( nil != sK2
| nil = sK3 )
& ssList(sK4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK4)
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1 ),
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)],[f99]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f110]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(flattening,[],[f124]) ).
fof(f129,plain,
ssList(sK0),
inference(cnf_transformation,[],[f121]) ).
fof(f134,plain,
ssList(sK4),
inference(cnf_transformation,[],[f121]) ).
fof(f137,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f121]) ).
fof(f138,plain,
nil != sK0,
inference(cnf_transformation,[],[f121]) ).
fof(f139,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f121]) ).
fof(f140,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f121]) ).
fof(f141,plain,
nil = sK1,
inference(cnf_transformation,[],[f121]) ).
fof(f155,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f109]) ).
fof(f157,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1)
| nil = X1 ),
inference(cnf_transformation,[],[f125]) ).
fof(f174,plain,
nil = sK3,
inference(definition_unfolding,[],[f141,f140]) ).
fof(f175,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f138,f174,f139]) ).
fof(f179,plain,
ssList(sK2),
inference(definition_unfolding,[],[f129,f139]) ).
fof(f185,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,sK3) = X0 ),
inference(definition_unfolding,[],[f155,f174]) ).
fof(f187,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != sK3
| sK3 = X1 ),
inference(definition_unfolding,[],[f157,f174,f174]) ).
tcf(c_49,negated_conjecture,
sK2 != sK3,
inference(cnf_transformation,[],[f175]) ).
tcf(c_50,negated_conjecture,
app(sK2,sK4) = sK3,
inference(cnf_transformation,[],[f137]) ).
tcf(c_53,negated_conjecture,
ssList(sK4),
inference(cnf_transformation,[],[f134]) ).
tcf(c_57,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f179]) ).
tcf(c_71,negated_conjecture,
! [X0: $i] :
( ( app(X0,sK3) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_73,negated_conjecture,
! [X0: $i,X1: $i] :
( ( X1 = sK3 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != sK3 ) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_2057,plain,
app(sK2,sK3) = sK2,
inference(superposition,[status(thm)],[c_57,c_71]) ).
tcf(c_2171,plain,
( ( sK3 = sK4 )
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_50,c_73]) ).
tcf(c_2173,plain,
sK3 = sK4,
inference(forward_subsumption_resolution,[status(thm)],[c_2171,c_53,c_57]) ).
tcf(c_2174,plain,
app(sK2,sK3) = sK3,
inference(demodulation,[status(thm)],[c_50,c_2173]) ).
tcf(c_2241,plain,
sK2 = sK3,
inference(light_normalisation,[status(thm)],[c_2057,c_2174]) ).
tcf(c_2242,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2241,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC041+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.12/0.38 % Computer : n008.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 16:04:09 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 3.96/1.31 % SZS status Started for theBenchmark.p
% 3.96/1.31 % SZS status Theorem for theBenchmark.p
% 3.96/1.31
% 3.96/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.96/1.31
% 3.96/1.31 % ------ iProver source info
% 3.96/1.31
% 3.96/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.96/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.96/1.31 % git: non_committed_changes: false
% 3.96/1.31
% 3.96/1.31 % ------ Parsing...
% 3.96/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.96/1.31
% 3.96/1.31 % ------ 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.96/1.31
% 3.96/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.96/1.31
% 3.96/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.96/1.31 % ------ Proving...
% 3.96/1.31 % ------ Problem Properties
% 3.96/1.31
% 3.96/1.31 %
% 3.96/1.31 % clauses 38
% 3.96/1.31 % conjectures 19
% 3.96/1.31 % EPR 9
% 3.96/1.31 % Horn 30
% 3.96/1.31 % unary 11
% 3.96/1.31 % binary 3
% 3.96/1.31 % lits 109
% 3.96/1.31 % lits eq 32
% 3.96/1.31 % fd_pure 0
% 3.96/1.31 % fd_pseudo 0
% 3.96/1.31 % fd_cond 4
% 3.96/1.31 % fd_pseudo_cond 5
% 3.96/1.31 % AC symbols 0
% 3.96/1.31
% 3.96/1.31 % ------ Schedule dynamic 5 is on
% 3.96/1.31
% 3.96/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.96/1.31
% 3.96/1.31
% 3.96/1.31 % ------
% 3.96/1.31 % Current options:
% 3.96/1.31 % ------
% 3.96/1.31
% 3.96/1.31
% 3.96/1.31 %
% 3.96/1.31
% 3.96/1.31 % ------ Proving...
% 3.96/1.31 %
% 3.96/1.31
% 3.96/1.31 % SZS status Theorem for theBenchmark.p
% 3.96/1.31
% 3.96/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.32
% 3.96/1.32
%------------------------------------------------------------------------------