%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC320+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:17 PM UTC 2026
% Result : Theorem 3.66s 1.26s
% Output : CNFRefutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 171 ( 85 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 225 ( 94 ~; 85 |; 38 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 36 !; 10 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| 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] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| 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] :
( ( ( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| app(cons(X6,nil),X7) != X0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) ) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f119,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK1
| app(cons(X6,nil),X7) != sK0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ( ssItem(sK4)
& sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f98]) ).
fof(f129,plain,
! [X6,X7] :
( app(X7,cons(X6,nil)) != sK1
| app(cons(X6,nil),X7) != sK0
| ~ ssList(X7)
| ~ ssItem(X6)
| nil != sK0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f130,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f131,plain,
! [X6,X7] :
( app(X7,cons(X6,nil)) != sK1
| app(cons(X6,nil),X7) != sK0
| ~ ssList(X7)
| ~ ssItem(X6)
| nil = sK1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f132,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f133,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f134,plain,
( ~ neq(sK3,nil)
| sK3 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f135,plain,
( ~ neq(sK3,nil)
| sK2 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f136,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f137,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f119]) ).
fof(f138,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f119]) ).
fof(f139,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f119]) ).
fof(f168,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f132,f139,f139]) ).
fof(f169,plain,
! [X6,X7] :
( app(X7,cons(X6,nil)) != sK3
| app(cons(X6,nil),X7) != sK2
| ~ ssList(X7)
| ~ ssItem(X6)
| nil = sK3 ),
inference(definition_unfolding,[],[f131,f139,f138,f139]) ).
fof(f170,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f130,f138,f139]) ).
fof(f171,plain,
! [X6,X7] :
( app(X7,cons(X6,nil)) != sK3
| app(cons(X6,nil),X7) != sK2
| ~ ssList(X7)
| ~ ssItem(X6)
| nil != sK2 ),
inference(definition_unfolding,[],[f129,f138,f138,f139]) ).
tcf(c_50,negated_conjecture,
( ( nil = sK2 )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_51,negated_conjecture,
( ssList(sK5)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_52,negated_conjecture,
( ( app(cons(sK4,nil),sK5) = sK2 )
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_53,negated_conjecture,
( ( app(sK5,cons(sK4,nil)) = sK3 )
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_54,negated_conjecture,
( ssItem(sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_55,negated_conjecture,
( neq(sK3,nil)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_56,negated_conjecture,
! [X0: $i,X1: $i] :
( ( sK3 = nil )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sK3 )
| ( app(cons(X0,nil),X1) != sK2 ) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_57,negated_conjecture,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_58,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( nil != sK2 )
| ( app(X1,cons(X0,nil)) != sK3 )
| ( app(cons(X0,nil),X1) != sK2 ) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_108,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_55,c_57,c_50]) ).
tcf(c_110,negated_conjecture,
ssList(sK5),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_55,c_57,c_50]) ).
tcf(c_112,negated_conjecture,
neq(sK3,nil),
inference(global_subsumption_just,[status(thm)],[c_55,c_55,c_57,c_50]) ).
tcf(c_118,negated_conjecture,
app(sK5,cons(sK4,nil)) = sK3,
inference(global_subsumption_just,[status(thm)],[c_53,c_55,c_57,c_50,c_53]) ).
tcf(c_120,negated_conjecture,
app(cons(sK4,nil),sK5) = sK2,
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_112]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X0,nil),X1) != sK2 )
| ( app(X1,cons(X0,nil)) != sK3 )
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_56,c_50,c_56,c_58]) ).
tcf(c_123,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sK3 )
| ( app(cons(X0,nil),X1) != sK2 ) ),
inference(renaming,[status(thm)],[c_122]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sK2 )
| ( app(X1,cons(X0,nil)) != sK3 ) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_123]) ).
tcf(c_126,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sK3 )
| ( app(cons(X0,nil),X1) != sK2 ) ),
inference(renaming,[status(thm)],[c_125]) ).
tcf(c_1235,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5)
| ( app(sK5,cons(sK4,nil)) != sK3 ) ),
inference(superposition,[status(thm)],[c_120,c_126]) ).
tcf(c_1236,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5) ),
inference(ground_joinability,[status(thm)],[c_1235,c_118]) ).
tcf(c_1237,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1236,c_108,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC320+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.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:36:18 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.66/1.26 % SZS status Started for theBenchmark.p
% 3.66/1.26 % SZS status Theorem for theBenchmark.p
% 3.66/1.26
% 3.66/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.66/1.26
% 3.66/1.26 % ------ iProver source info
% 3.66/1.26
% 3.66/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 3.66/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.66/1.26 % git: non_committed_changes: false
% 3.66/1.26
% 3.66/1.26 % ------ Parsing...
% 3.66/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.66/1.26
% 3.66/1.26 % ------ 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 %
% 3.66/1.26
% 3.66/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.66/1.26
% 3.66/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.66/1.26 % ------ Proving...
% 3.66/1.26 % ------ Problem Properties
% 3.66/1.26
% 3.66/1.26 %
% 3.66/1.26 % clauses 31
% 3.66/1.26 % conjectures 7
% 3.66/1.26 % EPR 9
% 3.66/1.26 % Horn 28
% 3.66/1.26 % unary 12
% 3.66/1.26 % binary 2
% 3.66/1.26 % lits 82
% 3.66/1.26 % lits eq 30
% 3.66/1.26 % fd_pure 0
% 3.66/1.26 % fd_pseudo 0
% 3.66/1.26 % fd_cond 4
% 3.66/1.26 % fd_pseudo_cond 4
% 3.66/1.26 % AC symbols 0
% 3.66/1.26
% 3.66/1.26 % ------ Schedule dynamic 5 is on
% 3.66/1.26
% 3.66/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.66/1.26
% 3.66/1.26
% 3.66/1.26 % ------
% 3.66/1.26 % Current options:
% 3.66/1.26 % ------
% 3.66/1.26
% 3.66/1.26
% 3.66/1.26 %
% 3.66/1.26
% 3.66/1.26 % ------ Proving...
% 3.66/1.26 %
% 3.66/1.26
% 3.66/1.26 % SZS status Theorem for theBenchmark.p
% 3.66/1.26
% 3.66/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.66/1.27
% 3.66/1.27
%------------------------------------------------------------------------------