%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU131+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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 02:55:31 PM UTC 2026
% Result : Theorem 0.70s 1.20s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 82 ( 8 unt; 1 def)
% Number of atoms : 312 ( 71 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 342 ( 132 ~; 143 |; 53 &)
% ( 10 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 166 ( 0 sgn 152 !; 14 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f20,conjecture,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f21,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f26,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f32,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f52,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f55,plain,
? [X0,X1] :
( set_difference(X0,X1) = empty_set
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f57,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(ennf_transformation,[],[f26]) ).
fof(f63,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(ennf_transformation,[],[f32]) ).
fof(f75,plain,
! [X0] :
( ( empty_set != X0
| ! [X1] : ~ in(X1,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f76,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(rectify,[],[f75]) ).
fof(f77,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( in(sK0(X0),X0)
| X0 = empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f76]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(rectify,[],[f79]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ( ( in(sK1(X0,X1,X2),X2)
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0) )
& ( ~ in(sK1(X0,X1,X2),X2)
| ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f80]) ).
fof(f82,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f52]) ).
fof(f83,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f82]) ).
fof(f84,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f83]) ).
fof(f89,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(flattening,[],[f89]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( ~ in(X4,X1)
& in(X4,X0) ) )
& ( in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(rectify,[],[f90]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( ~ in(X4,X1)
& in(X4,X0) ) )
& ( in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ( ( in(sK4(X0,X1,X2),X2)
| ( ~ in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) ) )
& ( ~ in(sK4(X0,X1,X2),X2)
| in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f91]) ).
fof(f93,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set )
& ( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f94,plain,
? [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| subset(X0,X1) )
& ( empty_set != set_difference(X0,X1)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f55]) ).
fof(f95,plain,
( ( empty_set = set_difference(sK5,sK6)
| subset(sK5,sK6) )
& ( empty_set != set_difference(sK5,sK6)
| ~ subset(sK5,sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f94]) ).
fof(f108,plain,
! [X2,X0] :
( empty_set != X0
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f77]) ).
fof(f109,plain,
! [X0] :
( in(sK0(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f77]) ).
fof(f112,plain,
! [X2,X0,X1,X4] :
( set_union2(X0,X1) != X2
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f81]) ).
fof(f117,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f118,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f125,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| ~ in(X4,X2)
| ~ in(X4,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f126,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f127,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f92]) ).
fof(f132,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f138,plain,
( empty_set = set_difference(sK5,sK6)
| subset(sK5,sK6) ),
inference(cnf_transformation,[],[f95]) ).
fof(f139,plain,
( empty_set != set_difference(sK5,sK6)
| ~ subset(sK5,sK6) ),
inference(cnf_transformation,[],[f95]) ).
fof(f144,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f57]) ).
fof(f150,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f63]) ).
fof(f170,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f108]) ).
fof(f171,plain,
! [X0,X1,X4] :
( ~ in(X4,X0)
| in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f112]) ).
fof(f177,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f127]) ).
fof(f178,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f126]) ).
fof(f179,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f125]) ).
tcf(c_55,plain,
! [X0: $i] :
( in(sK0(X0),X0)
| ( X0 = empty_set ) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_56,plain,
! [X0: $i] : ~ in(X0,empty_set),
inference(cnf_transformation,[],[f170]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_union2(X1,X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| in(X0,set_difference(X1,X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f177]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f178]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ in(X0,X2)
| ~ in(X0,set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f179]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| ( set_intersection2(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_85,negated_conjecture,
( ~ subset(sK5,sK6)
| ( set_difference(sK5,sK6) != empty_set ) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_86,negated_conjecture,
( subset(sK5,sK6)
| ( set_difference(sK5,sK6) = empty_set ) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X1 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = X0 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_1567,definition,
iPr_def_10 = set_difference(sK5,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1568,negated_conjecture,
( subset(sK5,sK6)
| ( iPr_def_10 = empty_set ) ),
inference(demodulation,[status(thm)],[c_86,c_1567]) ).
tcf(c_1569,negated_conjecture,
( ~ subset(sK5,sK6)
| ( iPr_def_10 != empty_set ) ),
inference(demodulation,[status(thm)],[c_85]) ).
tcf(c_2891,plain,
! [X0: $i] :
( in(X0,sK5)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1567,c_76]) ).
tcf(c_2916,plain,
! [X0: $i] :
( ~ in(X0,iPr_def_10)
| ~ in(X0,sK6) ),
inference(superposition,[status(thm)],[c_1567,c_77]) ).
tcf(c_2937,plain,
( in(sK0(iPr_def_10),sK5)
| ( empty_set = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_55,c_2891]) ).
tcf(c_2956,plain,
( ( empty_set = iPr_def_10 )
| ~ in(sK0(iPr_def_10),sK6) ),
inference(superposition,[status(thm)],[c_55,c_2916]) ).
tcf(c_3140,plain,
( ( empty_set = iPr_def_10 )
| ( set_union2(sK5,sK6) = sK6 ) ),
inference(superposition,[status(thm)],[c_1568,c_91]) ).
tcf(c_3172,plain,
( ( empty_set = iPr_def_10 )
| ( set_intersection2(sK5,sK6) = sK5 ) ),
inference(superposition,[status(thm)],[c_1568,c_97]) ).
tcf(c_3233,plain,
! [X0: $i] :
( in(X0,sK6)
| ( empty_set = iPr_def_10 )
| ~ in(X0,sK5) ),
inference(superposition,[status(thm)],[c_3140,c_60]) ).
tcf(c_3248,plain,
( disjoint(sK5,sK6)
| ( empty_set = iPr_def_10 )
| ( empty_set != sK5 ) ),
inference(superposition,[status(thm)],[c_3172,c_78]) ).
tcf(c_3284,plain,
( in(sK0(iPr_def_10),sK6)
| ( empty_set = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2937,c_3233]) ).
tcf(c_3330,plain,
empty_set = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_3248,c_2956,c_3284]) ).
tcf(c_3353,plain,
! [X0: $i] : ~ in(X0,iPr_def_10),
inference(demodulation,[status(thm)],[c_56,c_3330]) ).
tcf(c_3356,plain,
( ~ subset(sK5,sK6)
| ( iPr_def_10 != iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_1569,c_3330]) ).
tcf(c_3366,plain,
~ subset(sK5,sK6),
inference(equality_resolution_simp,[status(thm)],[c_3356]) ).
tcf(c_3659,plain,
! [X0: $i] :
( in(X0,iPr_def_10)
| in(X0,sK6)
| ~ in(X0,sK5) ),
inference(superposition,[status(thm)],[c_1567,c_75]) ).
tcf(c_3668,plain,
! [X0: $i] :
( in(X0,sK6)
| ~ in(X0,sK5) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3659,c_3353]) ).
tcf(c_3719,plain,
! [X0: $i] :
( subset(sK5,X0)
| in(sK2(sK5,X0),sK6) ),
inference(superposition,[status(thm)],[c_64,c_3668]) ).
tcf(c_6954,plain,
subset(sK5,sK6),
inference(superposition,[status(thm)],[c_3719,c_63]) ).
tcf(c_6955,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6954,c_3366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU131+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 12:49:53 UTC 2026
% 0.14/0.38 % CPUTime :
% 0.14/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.14/0.43
% 0.14/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.43
% 0.14/0.43 % Detected problem language: tptp
% 0.14/0.44 % Proving...
% 0.70/1.20 % SZS status Started for theBenchmark.p
% 0.70/1.20 % SZS status Theorem for theBenchmark.p
% 0.70/1.20
% 0.70/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.70/1.20
% 0.70/1.20 % ------ iProver source info
% 0.70/1.20
% 0.70/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 0.70/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.70/1.20 % git: non_committed_changes: false
% 0.70/1.20
% 0.70/1.20 % ------ Parsing...
% 0.70/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.70/1.20
% 0.70/1.20 % ------ 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 %
% 0.70/1.20
% 0.70/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.70/1.20
% 0.70/1.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.70/1.20 % ------ Proving...
% 0.70/1.20 % ------ Problem Properties
% 0.70/1.20
% 0.70/1.20 %
% 0.70/1.20 % clauses 65
% 0.70/1.20 % conjectures 2
% 0.70/1.20 % EPR 18
% 0.70/1.20 % Horn 50
% 0.70/1.20 % unary 17
% 0.70/1.20 % binary 27
% 0.70/1.20 % lits 137
% 0.70/1.20 % lits eq 31
% 0.70/1.20 % fd_pure 0
% 0.70/1.20 % fd_pseudo 0
% 0.70/1.20 % fd_cond 3
% 0.70/1.20 % fd_pseudo_cond 13
% 0.70/1.20 % AC symbols 0
% 0.70/1.20
% 0.70/1.20 % ------ Schedule dynamic 5 is on
% 0.70/1.20
% 0.70/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.70/1.20
% 0.70/1.20
% 0.70/1.20 % ------
% 0.70/1.20 % Current options:
% 0.70/1.20 % ------
% 0.70/1.20
% 0.70/1.20
% 0.70/1.20 %
% 0.70/1.20
% 0.70/1.20 % ------ Proving...
% 0.70/1.20 %
% 0.70/1.20
% 0.70/1.20 % SZS status Theorem for theBenchmark.p
% 0.70/1.20
% 0.70/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.70/1.20
% 0.70/1.20
%------------------------------------------------------------------------------