%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC256+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 : n019.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:02 PM UTC 2026
% Result : Theorem 2.42s 21.11s
% Output : CNFRefutation 2.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f209ERROR: Could not build tree for root c_2782ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| singletonP(X0)
| ~ neq(X1,nil)
| 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| singletonP(X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
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] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ~ singletonP(X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ~ singletonP(X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f115,plain,
! [X0] :
( ~ ssList(X0)
| ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f125,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( nil = sK2
& nil = sK3 )
| ( ssItem(sK4)
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = 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)],[f99]) ).
fof(f137,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ singletonP(X0)
| ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
& ( ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) )
| singletonP(X0) ) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f138,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ singletonP(X0)
| ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) ) )
& ( ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) )
| singletonP(X0) ) ) ),
inference(rectify,[],[f137]) ).
fof(f139,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ singletonP(X0)
| ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) ) )
& ( ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) )
| singletonP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X0))],[f138]) ).
fof(f142,plain,
ssList(sK0),
inference(cnf_transformation,[],[f125]) ).
fof(f143,plain,
ssList(sK1),
inference(cnf_transformation,[],[f125]) ).
fof(f146,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f147,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f151,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f152,plain,
~ singletonP(sK0),
inference(cnf_transformation,[],[f125]) ).
fof(f153,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f125]) ).
fof(f154,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f125]) ).
fof(f155,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f125]) ).
fof(f188,plain,
! [X0,X1] :
( ~ ssList(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f198,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f153,f155]) ).
fof(f199,plain,
~ singletonP(sK2),
inference(definition_unfolding,[],[f152,f154]) ).
fof(f200,plain,
ssList(sK3),
inference(definition_unfolding,[],[f143,f155]) ).
fof(f201,plain,
ssList(sK2),
inference(definition_unfolding,[],[f142,f154]) ).
fof(f206,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f188]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f198]) ).
tcf(c_50,negated_conjecture,
~ singletonP(sK2),
inference(cnf_transformation,[],[f199]) ).
tcf(c_51,negated_conjecture,
( ( sK3 = nil )
| ( cons(sK4,nil) = sK2 ) ),
inference(cnf_transformation,[],[f151]) ).
tcf(c_55,negated_conjecture,
( ssItem(sK4)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_56,negated_conjecture,
( ssItem(sK4)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_59,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f200]) ).
tcf(c_60,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f201]) ).
tcf(c_75,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_91,plain,
! [X0: $i] :
( singletonP(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_814,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_75]) ).
tcf(c_815,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_814]) ).
tcf(c_816,plain,
sK3 != nil,
inference(global_subsumption_just,[status(thm)],[c_815,c_59,c_815]) ).
tcf(c_830,plain,
cons(sK4,nil) = sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_816]) ).
tcf(c_833,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_56,c_59,c_55,c_815]) ).
tcf(c_2780,plain,
( singletonP(cons(sK4,nil))
| ~ ssList(sK2)
| ~ ssItem(sK4) ),
inference(superposition,[status(thm)],[c_830,c_91]) ).
tcf(c_2781,plain,
( singletonP(sK2)
| ~ ssList(sK2)
| ~ ssItem(sK4) ),
inference(light_normalisation,[status(thm)],[c_2780,c_830]) ).
tcf(c_2782,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2781,c_50,c_60,c_833]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC256+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/20.40 % Computer : n019.cluster.edu
% 0.13/20.40 % Model : x86_64 x86_64
% 0.13/20.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/20.40 % Memory : 8046.5625MB
% 0.13/20.40 % OS : Linux 6.8.0-71-generic
% 0.04/20.40 % CPULimit : 300
% 0.04/20.40 % WCLimit : 300
% 0.04/20.40 % DateTime : Thu Sep 24 17:15:43 UTC 2026
% 0.04/20.40 % CPUTime :
% 0.04/20.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/20.44 Running first-order theorem proving
% 0.04/20.44 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.04/20.45
% 0.04/20.45 % ======== iProver multi-core TPTP/SMT =========
% 0.04/20.45
% 0.04/20.45 % Detected problem language: tptp
% 0.04/20.46 % Proving...
% 2.42/21.11 % SZS status Started for theBenchmark.p
% 2.42/21.11 % SZS status Theorem for theBenchmark.p
% 2.42/21.11
% 2.42/21.11 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.42/21.11
% 2.42/21.11 % ------ iProver source info
% 2.42/21.11
% 2.42/21.11 % git: date: 2026-07-19 20:42:38 +0200
% 2.42/21.11 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.42/21.11 % git: non_committed_changes: false
% 2.42/21.11
% 2.42/21.11 % ------ Parsing...
% 2.42/21.11 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.42/21.11
% 2.42/21.11 % ------ 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 sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.42/21.11
% 2.42/21.11 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.42/21.11
% 2.42/21.11 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.42/21.11 % ------ Proving...
% 2.42/21.11 % ------ Problem Properties
% 2.42/21.11
% 2.42/21.11 %
% 2.42/21.11 % clauses 45
% 2.42/21.11 % conjectures 5
% 2.42/21.11 % EPR 12
% 2.42/21.11 % Horn 40
% 2.42/21.11 % unary 13
% 2.42/21.11 % binary 3
% 2.42/21.11 % lits 137
% 2.42/21.11 % lits eq 30
% 2.42/21.11 % fd_pure 0
% 2.42/21.11 % fd_pseudo 0
% 2.42/21.11 % fd_cond 4
% 2.42/21.11 % fd_pseudo_cond 5
% 2.42/21.11 % AC symbols 0
% 2.42/21.11
% 2.42/21.11 % ------ Schedule dynamic 5 is on
% 2.42/21.11
% 2.42/21.11 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.42/21.11
% 2.42/21.11
% 2.42/21.11 % ------
% 2.42/21.11 % Current options:
% 2.42/21.11 % ------
% 2.42/21.11
% 2.42/21.11
% 2.42/21.11 %
% 2.42/21.11
% 2.42/21.11 % ------ Proving...
% 2.42/21.11 %
% 2.42/21.11
% 2.42/21.11 % SZS status Theorem for theBenchmark.p
% 2.42/21.11
% 2.42/21.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.42/21.11
% 2.42/21.11
%------------------------------------------------------------------------------