%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC324+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 : n016.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:18 PM UTC 2026
% Result : Theorem 26.25s 4.25s
% Output : CNFRefutation 26.25s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f159ERROR: Could not build tree for root c_49125ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) != X2
& ssList(X7) )
& ssItem(X6) )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) != X2
& ssList(X7) )
& ssItem(X6) )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| 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] :
( ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X4] :
( ! [X5] :
( app(X5,X4) != X0
| app(X4,X5) != X1
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ),
inference(ennf_transformation,[],[f20]) ).
fof(f103,plain,
! [X0] :
( ~ ssList(X0)
| ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ),
inference(flattening,[],[f102]) ).
fof(f107,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f115,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f117,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != sK3
| app(X7,cons(X6,nil)) = sK2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK0
| app(X4,X5) != sK1
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| ( cons(sK7(X0),sK6(X0)) = X0
& ssItem(sK7(X0))
& ssList(sK6(X0)) )
| nil = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f103]) ).
fof(f123,plain,
ssList(sK1),
inference(cnf_transformation,[],[f117]) ).
fof(f125,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f117]) ).
fof(f126,plain,
! [X6,X7] :
( app(cons(X6,nil),X7) != sK3
| app(X7,cons(X6,nil)) = sK2
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f117]) ).
fof(f127,plain,
! [X4,X5] :
( app(X5,X4) != sK0
| app(X4,X5) != sK1
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f117]) ).
fof(f128,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f117]) ).
fof(f134,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f137,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK7(X0),sK6(X0)) = X0
| nil = X0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f138,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK7(X0))
| nil = X0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f139,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK6(X0))
| nil = X0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f143,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f151,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f115]) ).
fof(f153,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f154,plain,
! [X4,X5] :
( app(X5,X4) != sK2
| app(X4,X5) != sK3
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f127,f129,f128]) ).
fof(f155,plain,
ssList(sK3),
inference(definition_unfolding,[],[f123,f129]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ~ ssList(X0)
| ( app(X1,X0) != sK2 )
| ( app(X0,X1) != sK3 ) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] :
( ( app(X1,cons(X0,nil)) = sK2 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sK3 ) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_52,negated_conjecture,
( ( sK2 = nil )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_54,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f155]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_62,plain,
! [X0: $i] :
( ssList(sK6(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_63,plain,
! [X0: $i] :
( ssItem(sK7(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_64,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(sK7(X0),sK6(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_70,plain,
( ( app(nil,nil) = nil )
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f159]) ).
tcf(c_76,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
tcf(c_78,plain,
ssList(nil),
inference(cnf_transformation,[],[f153]) ).
tcf(c_79,plain,
( ( app(nil,nil) = nil )
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_94,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_70,c_78,c_79]) ).
tcf(c_742,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_744,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1169,plain,
( ~ ssList(nil)
| ( sK3 != nil )
| ( app(nil,nil) != sK2 ) ),
inference(superposition,[status(thm)],[c_94,c_50]) ).
tcf(c_1170,plain,
( ~ ssList(nil)
| ( sK2 != nil )
| ( sK3 != nil ) ),
inference(light_normalisation,[status(thm)],[c_1169,c_94]) ).
tcf(c_1171,plain,
( ( sK2 != nil )
| ( sK3 != nil ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1170,c_78]) ).
tcf(c_1209,plain,
sK3 != nil,
inference(global_subsumption_just,[status(thm)],[c_1171,c_52,c_1171]) ).
tcf(c_1271,plain,
( ( sK3 = nil )
| ( cons(sK7(sK3),sK6(sK3)) = sK3 ) ),
inference(superposition,[status(thm)],[c_54,c_64]) ).
tcf(c_1279,plain,
cons(sK7(sK3),sK6(sK3)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_1271,c_1209]) ).
tcf(c_1583,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( app(X0,X1) = sK3 )
| ( sK3 != X2 )
| ( app(X0,X1) != X2 ) ),
inference(instantiation,[status(thm)],[c_744]) ).
tcf(c_1908,plain,
( ssItem(sK7(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_1909,plain,
( ssList(sK6(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_1921,plain,
! [X0: $i,X1: $i] :
( ( sK3 = X0 )
| ( sK3 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_744]) ).
tcf(c_3283,plain,
! [X0: $i] :
( ( app(X0,cons(sK7(sK3),nil)) = sK2 )
| ~ ssList(X0)
| ~ ssItem(sK7(sK3))
| ( app(cons(sK7(sK3),nil),X0) != sK3 ) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_3287,plain,
! [X0: $i] :
( ( app(cons(sK7(sK3),nil),X0) = cons(sK7(sK3),X0) )
| ~ ssList(X0)
| ~ ssItem(sK7(sK3)) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_3289,plain,
! [X0: $i] :
( ssList(cons(sK7(sK3),X0))
| ~ ssList(X0)
| ~ ssItem(sK7(sK3)) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_3290,plain,
( ssList(cons(sK7(sK3),nil))
| ~ ssList(nil)
| ~ ssItem(sK7(sK3)) ),
inference(instantiation,[status(thm)],[c_3289]) ).
tcf(c_3878,plain,
! [X0: $i] :
( ( sK3 = X0 )
| ( sK3 != sK3 )
| ( X0 != sK3 ) ),
inference(instantiation,[status(thm)],[c_1921]) ).
tcf(c_3879,plain,
sK3 = sK3,
inference(instantiation,[status(thm)],[c_742]) ).
tcf(c_10157,plain,
( ( sK3 = cons(sK7(sK3),sK6(sK3)) )
| ( sK3 != sK3 )
| ( cons(sK7(sK3),sK6(sK3)) != sK3 ) ),
inference(instantiation,[status(thm)],[c_3878]) ).
tcf(c_22920,plain,
! [X0: $i,X1: $i] :
( ( app(X0,X1) = sK3 )
| ( sK3 != cons(sK7(sK3),sK6(sK3)) )
| ( app(X0,X1) != cons(sK7(sK3),sK6(sK3)) ) ),
inference(instantiation,[status(thm)],[c_1583]) ).
tcf(c_35662,plain,
( ( app(cons(sK7(sK3),nil),sK6(sK3)) = sK3 )
| ( sK3 != cons(sK7(sK3),sK6(sK3)) )
| ( app(cons(sK7(sK3),nil),sK6(sK3)) != cons(sK7(sK3),sK6(sK3)) ) ),
inference(instantiation,[status(thm)],[c_22920]) ).
tcf(c_35663,plain,
( ( app(cons(sK7(sK3),nil),sK6(sK3)) = cons(sK7(sK3),sK6(sK3)) )
| ~ ssItem(sK7(sK3))
| ~ ssList(sK6(sK3)) ),
inference(instantiation,[status(thm)],[c_3287]) ).
tcf(c_49116,plain,
( ~ ssList(sK6(sK3))
| ~ ssList(cons(sK7(sK3),nil))
| ( app(sK6(sK3),cons(sK7(sK3),nil)) != sK2 )
| ( app(cons(sK7(sK3),nil),sK6(sK3)) != sK3 ) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_49124,plain,
( ( app(sK6(sK3),cons(sK7(sK3),nil)) = sK2 )
| ~ ssItem(sK7(sK3))
| ~ ssList(sK6(sK3))
| ( app(cons(sK7(sK3),nil),sK6(sK3)) != sK3 ) ),
inference(instantiation,[status(thm)],[c_3283]) ).
tcf(c_49125,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_49124,c_49116,c_35663,c_35662,c_10157,c_3879,c_3290,c_1908,c_1909,c_1279,c_1209,c_78,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC324+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.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 17:42:44 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 26.25/4.25 % SZS status Started for theBenchmark.p
% 26.25/4.25 % SZS status Theorem for theBenchmark.p
% 26.25/4.25
% 26.25/4.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 26.25/4.25
% 26.25/4.25 % ------ iProver source info
% 26.25/4.25
% 26.25/4.25 % git: date: 2026-07-19 20:42:38 +0200
% 26.25/4.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 26.25/4.25 % git: non_committed_changes: false
% 26.25/4.25
% 26.25/4.25 % ------ Parsing...
% 26.25/4.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 26.25/4.25
% 26.25/4.25 % ------ 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 %
% 26.25/4.25
% 26.25/4.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 26.25/4.25
% 26.25/4.25 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 26.25/4.25 % ------ Proving...
% 26.25/4.25 % ------ Problem Properties
% 26.25/4.25
% 26.25/4.25 %
% 26.25/4.25 % clauses 28
% 26.25/4.25 % conjectures 5
% 26.25/4.25 % EPR 7
% 26.25/4.25 % Horn 25
% 26.25/4.25 % unary 7
% 26.25/4.25 % binary 3
% 26.25/4.25 % lits 83
% 26.25/4.25 % lits eq 31
% 26.25/4.25 % fd_pure 0
% 26.25/4.25 % fd_pseudo 0
% 26.25/4.25 % fd_cond 4
% 26.25/4.25 % fd_pseudo_cond 4
% 26.25/4.25 % AC symbols 0
% 26.25/4.25
% 26.25/4.25 % ------ Schedule dynamic 5 is on
% 26.25/4.25
% 26.25/4.25 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 26.25/4.25
% 26.25/4.25
% 26.25/4.25 % ------
% 26.25/4.25 % Current options:
% 26.25/4.25 % ------
% 26.25/4.25
% 26.25/4.25
% 26.25/4.25 %
% 26.25/4.25
% 26.25/4.25 % ------ Proving...
% 26.25/4.25 %
% 26.25/4.25
% 26.25/4.25 % SZS status Theorem for theBenchmark.p
% 26.25/4.25
% 26.25/4.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 26.25/4.26
% 26.25/4.26
%------------------------------------------------------------------------------