%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC332-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:20 PM UTC 2026
% Result : Unsatisfiable 4.33s 1.17s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 45 ( 23 unt; 0 def)
% Number of atoms : 85 ( 23 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 76 ( 36 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause1) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f47,axiom,
! [X0] : ssItem(skaf44(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
fof(f64,axiom,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause64) ).
fof(f80,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
fof(f103,axiom,
! [X0] :
( cons(skaf44(X0),nil) = X0
| ~ ssList(X0)
| ~ singletonP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ~ equalelemsP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f211,plain,
( ~ equalelemsP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f208,f204,f205,f205]) ).
tcf(c_243,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f1]) ).
tcf(c_250,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_289,plain,
! [X0: $i] : ssItem(skaf44(X0)),
inference(cnf_transformation,[],[f47]) ).
tcf(c_306,plain,
! [X0: $i] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_322,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_342,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_343,plain,
! [X0: $i] :
( ( cons(skaf44(X0),nil) = X0 )
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_430,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_431,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_432,negated_conjecture,
segmentP(sk4,sk3),
inference(cnf_transformation,[],[f206]) ).
tcf(c_433,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_434,negated_conjecture,
( ~ equalelemsP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_548,negated_conjecture,
~ equalelemsP(sk3),
inference(global_subsumption_just,[status(thm)],[c_434,c_432,c_434]) ).
tcf(c_2742,plain,
! [X0: $i,X1: $i] :
( singletonP(sk3)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_433,c_342]) ).
tcf(c_2743,plain,
( singletonP(sk3)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(unflattening,[status(thm)],[c_2742]) ).
tcf(c_2744,plain,
( singletonP(sk3)
| ( sk4 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_2743,c_431,c_250,c_2743]) ).
tcf(c_6612,plain,
( singletonP(sk3)
| ( sk4 = nil ) ),
inference(demodulation,[status(thm)],[c_2744]) ).
tcf(c_6613,negated_conjecture,
~ equalelemsP(sk3),
inference(demodulation,[status(thm)],[c_548]) ).
tcf(c_6614,negated_conjecture,
segmentP(sk4,sk3),
inference(demodulation,[status(thm)],[c_432]) ).
tcf(c_6616,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_430]) ).
tcf(c_10590,plain,
( ( sk4 = nil )
| ( cons(skaf44(sk3),nil) = sk3 )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6612,c_343]) ).
tcf(c_10591,plain,
( ( sk4 = nil )
| ( cons(skaf44(sk3),nil) = sk3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10590,c_6616]) ).
tcf(c_10620,plain,
( equalelemsP(sk3)
| ( sk4 = nil )
| ~ ssItem(skaf44(sk3)) ),
inference(superposition,[status(thm)],[c_10591,c_306]) ).
tcf(c_10625,plain,
sk4 = nil,
inference(forward_subsumption_resolution,[status(thm)],[c_10620,c_6613,c_289]) ).
tcf(c_10637,plain,
segmentP(nil,sk3),
inference(demodulation,[status(thm)],[c_6614,c_10625]) ).
tcf(c_10639,plain,
( ( sk3 = nil )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_10637,c_322]) ).
tcf(c_10640,plain,
sk3 = nil,
inference(forward_subsumption_resolution,[status(thm)],[c_10639,c_6616]) ).
tcf(c_10653,plain,
~ equalelemsP(nil),
inference(demodulation,[status(thm)],[c_6613,c_10640]) ).
tcf(c_10655,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10653,c_243]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC332-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.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 17:45:12 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 4.33/1.17 % SZS status Started for theBenchmark.p
% 4.33/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.33/1.17
% 4.33/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.33/1.17
% 4.33/1.17 % ------ iProver source info
% 4.33/1.17
% 4.33/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 4.33/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.33/1.17 % git: non_committed_changes: false
% 4.33/1.17
% 4.33/1.17 % ------ Parsing...% successful
% 4.33/1.17
% 4.33/1.17
% 4.33/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.33/1.17
% 4.33/1.17 % ------ 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 %
% 4.33/1.17
% 4.33/1.17 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.33/1.17
% 4.33/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.33/1.17 % ------ Proving...
% 4.33/1.17 % ------ Problem Properties
% 4.33/1.17
% 4.33/1.17 %
% 4.33/1.17 % clauses 182
% 4.33/1.17 % conjectures 4
% 4.33/1.17 % EPR 57
% 4.33/1.17 % Horn 153
% 4.33/1.17 % unary 62
% 4.33/1.17 % binary 22
% 4.33/1.17 % lits 547
% 4.33/1.17 % lits eq 70
% 4.33/1.17 % fd_pure 0
% 4.33/1.17 % fd_pseudo 0
% 4.33/1.17 % fd_cond 15
% 4.33/1.17 % fd_pseudo_cond 14
% 4.33/1.17 % AC symbols 0
% 4.33/1.17
% 4.33/1.17 % ------ Schedule dynamic 5 is on
% 4.33/1.17
% 4.33/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.33/1.17
% 4.33/1.17
% 4.33/1.17 % ------
% 4.33/1.17 % Current options:
% 4.33/1.17 % ------
% 4.33/1.17
% 4.33/1.17
% 4.33/1.17 %
% 4.33/1.17
% 4.33/1.17 % ------ Proving...
% 4.33/1.17 %
% 4.33/1.17
% 4.33/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.33/1.17
% 4.33/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.33/1.17
% 4.33/1.17
%------------------------------------------------------------------------------