%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET931+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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:49:09 PM UTC 2026
% Result : Theorem 2.05s 6.30s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 9
% Syntax : Number of formulae : 91 ( 31 unt; 4 def)
% Number of atoms : 366 ( 211 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 251 ( 87 ~; 128 |; 30 &)
% ( 5 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 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; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 1 sgn 69 !; 9 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f3,axiom,
! [X0,X1,X2] :
( subset(X0,unordered_pair(X1,X2))
<=> ~ ( X0 != unordered_pair(X1,X2)
& X0 != singleton(X2)
& X0 != singleton(X1)
& X0 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l46_zfmisc_1) ).
fof(f6,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f7,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( set_difference(X0,unordered_pair(X1,X2)) = empty_set
<=> ~ ( X0 != unordered_pair(X1,X2)
& X0 != singleton(X2)
& X0 != singleton(X1)
& X0 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t75_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( set_difference(X0,unordered_pair(X1,X2)) = empty_set
<=> ~ ( X0 != unordered_pair(X1,X2)
& X0 != singleton(X2)
& X0 != singleton(X1)
& X0 != empty_set ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f6]) ).
fof(f11,plain,
! [X0,X1,X2] :
( subset(X0,unordered_pair(X1,X2))
<=> ( unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
? [X0,X1,X2] :
( set_difference(X0,unordered_pair(X1,X2)) = empty_set
<~> ( unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( ~ subset(X0,unordered_pair(X1,X2))
| unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 )
& ( ( unordered_pair(X1,X2) != X0
& singleton(X2) != X0
& singleton(X1) != X0
& empty_set != X0 )
| subset(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( ~ subset(X0,unordered_pair(X1,X2))
| unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 )
& ( ( unordered_pair(X1,X2) != X0
& singleton(X2) != X0
& singleton(X1) != X0
& empty_set != X0 )
| subset(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( ( empty_set != set_difference(X0,X1)
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f18,plain,
? [X0,X1,X2] :
( ( set_difference(X0,unordered_pair(X1,X2)) = empty_set
| unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 )
& ( empty_set != set_difference(X0,unordered_pair(X1,X2))
| ( unordered_pair(X1,X2) != X0
& singleton(X2) != X0
& singleton(X1) != X0
& empty_set != X0 ) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ( set_difference(X0,unordered_pair(X1,X2)) = empty_set
| unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 )
& ( empty_set != set_difference(X0,unordered_pair(X1,X2))
| ( unordered_pair(X1,X2) != X0
& singleton(X2) != X0
& singleton(X1) != X0
& empty_set != X0 ) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
( ( empty_set = set_difference(sK2,unordered_pair(sK3,sK4))
| sK2 = unordered_pair(sK3,sK4)
| sK2 = singleton(sK4)
| sK2 = singleton(sK3)
| empty_set = sK2 )
& ( empty_set != set_difference(sK2,unordered_pair(sK3,sK4))
| ( sK2 != unordered_pair(sK3,sK4)
& sK2 != singleton(sK4)
& sK2 != singleton(sK3)
& empty_set != sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f19]) ).
fof(f22,plain,
empty(empty_set),
inference(cnf_transformation,[],[f2]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ subset(X0,unordered_pair(X1,X2))
| unordered_pair(X1,X2) = X0
| singleton(X2) = X0
| singleton(X1) = X0
| empty_set = X0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X2,X0,X1] :
( singleton(X2) != X0
| subset(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f26,plain,
! [X2,X0,X1] :
( singleton(X1) != X0
| subset(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X2,X0,X1] :
( empty_set != X0
| subset(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f30,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
! [X0,X1] :
( empty_set != set_difference(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f33,plain,
( empty_set = set_difference(sK2,unordered_pair(sK3,sK4))
| sK2 = unordered_pair(sK3,sK4)
| sK2 = singleton(sK4)
| sK2 = singleton(sK3)
| empty_set = sK2 ),
inference(cnf_transformation,[],[f20]) ).
fof(f34,plain,
( empty_set != set_difference(sK2,unordered_pair(sK3,sK4))
| sK2 != unordered_pair(sK3,sK4) ),
inference(cnf_transformation,[],[f20]) ).
fof(f35,plain,
( empty_set != set_difference(sK2,unordered_pair(sK3,sK4))
| sK2 != singleton(sK4) ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
( empty_set != set_difference(sK2,unordered_pair(sK3,sK4))
| sK2 != singleton(sK3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
( empty_set != set_difference(sK2,unordered_pair(sK3,sK4))
| empty_set != sK2 ),
inference(cnf_transformation,[],[f20]) ).
fof(f38,plain,
! [X2,X1] : subset(empty_set,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f27]) ).
fof(f39,plain,
! [X2,X1] : subset(singleton(X1),unordered_pair(X1,X2)),
inference(equality_resolution,[],[f26]) ).
fof(f40,plain,
! [X2,X1] : subset(singleton(X2),unordered_pair(X1,X2)),
inference(equality_resolution,[],[f25]) ).
tcf(c_50,plain,
empty(empty_set),
inference(cnf_transformation,[],[f22]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : subset(empty_set,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : subset(singleton(X0),unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f39]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] : subset(singleton(X0),unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f40]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = empty_set )
| ( singleton(X2) = X0 )
| ( singleton(X1) = X0 )
| ( unordered_pair(X1,X2) = X0 )
| ~ subset(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_58,plain,
! [X0: $i] : subset(X0,X0),
inference(cnf_transformation,[],[f30]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) = empty_set )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ( set_difference(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_61,negated_conjecture,
( ( empty_set != sK2 )
| ( set_difference(sK2,unordered_pair(sK3,sK4)) != empty_set ) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_62,negated_conjecture,
( ( singleton(sK3) != sK2 )
| ( set_difference(sK2,unordered_pair(sK3,sK4)) != empty_set ) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_63,negated_conjecture,
( ( singleton(sK4) != sK2 )
| ( set_difference(sK2,unordered_pair(sK3,sK4)) != empty_set ) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_64,negated_conjecture,
( ( unordered_pair(sK3,sK4) != sK2 )
| ( set_difference(sK2,unordered_pair(sK3,sK4)) != empty_set ) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_65,negated_conjecture,
( ( empty_set = sK2 )
| ( singleton(sK4) = sK2 )
| ( singleton(sK3) = sK2 )
| ( unordered_pair(sK3,sK4) = sK2 )
| ( set_difference(sK2,unordered_pair(sK3,sK4)) = empty_set ) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_609,definition,
iPr_def_10 = unordered_pair(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_610,definition,
iPr_def_11 = set_difference(sK2,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_611,definition,
iPr_def_12 = singleton(sK3),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_612,definition,
iPr_def_13 = singleton(sK4),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_613,negated_conjecture,
( ( iPr_def_13 = sK2 )
| ( iPr_def_12 = sK2 )
| ( iPr_def_11 = empty_set )
| ( iPr_def_10 = sK2 )
| ( empty_set = sK2 ) ),
inference(demodulation,[status(thm)],[c_65,c_612,c_611,c_609,c_610]) ).
tcf(c_614,negated_conjecture,
( ( iPr_def_11 != empty_set )
| ( iPr_def_10 != sK2 ) ),
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_615,negated_conjecture,
( ( iPr_def_13 != sK2 )
| ( iPr_def_11 != empty_set ) ),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_616,negated_conjecture,
( ( iPr_def_12 != sK2 )
| ( iPr_def_11 != empty_set ) ),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_617,negated_conjecture,
( ( iPr_def_11 != empty_set )
| ( empty_set != sK2 ) ),
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_1028,plain,
subset(empty_set,iPr_def_10),
inference(superposition,[status(thm)],[c_609,c_51]) ).
tcf(c_1035,plain,
( subset(sK2,iPr_def_10)
| ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( empty_set = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_613,c_1028]) ).
tcf(c_1043,plain,
subset(singleton(sK3),iPr_def_10),
inference(superposition,[status(thm)],[c_609,c_52]) ).
tcf(c_1044,plain,
subset(iPr_def_12,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_1043,c_611]) ).
tcf(c_1071,plain,
subset(singleton(sK4),iPr_def_10),
inference(superposition,[status(thm)],[c_609,c_53]) ).
tcf(c_1072,plain,
subset(iPr_def_13,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_1071,c_612]) ).
tcf(c_1096,plain,
! [X0: $i,X1: $i] : set_difference(empty_set,unordered_pair(X0,X1)) = empty_set,
inference(superposition,[status(thm)],[c_51,c_59]) ).
tcf(c_1099,plain,
! [X0: $i] : set_difference(X0,X0) = empty_set,
inference(superposition,[status(thm)],[c_58,c_59]) ).
tcf(c_1102,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( empty_set = iPr_def_11 )
| ( set_difference(sK2,iPr_def_10) = empty_set ) ),
inference(superposition,[status(thm)],[c_1035,c_59]) ).
tcf(c_1105,plain,
set_difference(iPr_def_12,iPr_def_10) = empty_set,
inference(superposition,[status(thm)],[c_1044,c_59]) ).
tcf(c_1108,plain,
set_difference(iPr_def_13,iPr_def_10) = empty_set,
inference(superposition,[status(thm)],[c_1072,c_59]) ).
tcf(c_1109,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( empty_set = iPr_def_11 ) ),
inference(light_normalisation,[status(thm)],[c_1102,c_610]) ).
tcf(c_1122,plain,
( subset(sK2,iPr_def_10)
| ( empty_set != iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_610,c_60]) ).
tcf(c_1145,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ( singleton(sK4) = X0 )
| ( singleton(sK3) = X0 )
| ( unordered_pair(sK3,sK4) = X0 )
| ~ subset(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_609,c_55]) ).
tcf(c_1162,plain,
! [X0: $i] :
( ( X0 = iPr_def_13 )
| ( X0 = iPr_def_12 )
| ( X0 = iPr_def_10 )
| ( X0 = empty_set )
| ~ subset(X0,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_1145,c_609,c_611,c_612]) ).
tcf(c_1199,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( sK2 != iPr_def_11 )
| ( empty_set != iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_1109,c_617]) ).
tcf(c_1244,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( sK2 != iPr_def_11 ) ),
inference(global_subsumption_just,[status(thm)],[c_1199,c_1109,c_1199]) ).
tcf(c_1342,plain,
( subset(sK2,iPr_def_10)
| ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1109,c_1122]) ).
tcf(c_1412,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( empty_set = sK2 ) ),
inference(superposition,[status(thm)],[c_1342,c_1162]) ).
tcf(c_1430,plain,
! [X0: $i,X1: $i] :
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( set_difference(sK2,unordered_pair(X0,X1)) = sK2 ) ),
inference(superposition,[status(thm)],[c_1412,c_1096]) ).
tcf(c_1431,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_11 )
| ( sK2 = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1412,c_1109]) ).
tcf(c_1463,plain,
( ( sK2 = iPr_def_13 )
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 ) ),
inference(global_subsumption_just,[status(thm)],[c_1430,c_1244,c_1431]) ).
tcf(c_1471,plain,
( ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( set_difference(iPr_def_13,iPr_def_10) = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_1463,c_610]) ).
tcf(c_1472,plain,
( ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( empty_set = iPr_def_11 ) ),
inference(light_normalisation,[status(thm)],[c_1471,c_1108]) ).
tcf(c_1488,plain,
( empty(iPr_def_11)
| ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1472,c_50]) ).
tcf(c_1492,plain,
( ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 )
| ( sK2 != iPr_def_13 ) ),
inference(superposition,[status(thm)],[c_1472,c_615]) ).
tcf(c_1521,plain,
( ( sK2 = iPr_def_10 )
| ( sK2 = iPr_def_12 ) ),
inference(global_subsumption_just,[status(thm)],[c_1488,c_1463,c_1492]) ).
tcf(c_1522,plain,
( ( sK2 = iPr_def_12 )
| ( sK2 = iPr_def_10 ) ),
inference(renaming,[status(thm)],[c_1521]) ).
tcf(c_1527,plain,
( ( sK2 = iPr_def_10 )
| ( set_difference(iPr_def_12,iPr_def_10) = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_1522,c_610]) ).
tcf(c_1528,plain,
( ( sK2 = iPr_def_10 )
| ( empty_set = iPr_def_11 ) ),
inference(light_normalisation,[status(thm)],[c_1527,c_1105]) ).
tcf(c_1541,plain,
( empty(iPr_def_11)
| ( sK2 = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1528,c_50]) ).
tcf(c_1544,plain,
( ( sK2 = iPr_def_10 )
| ( sK2 != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_1528,c_616]) ).
tcf(c_1568,plain,
sK2 = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_1541,c_1522,c_1544]) ).
tcf(c_1572,plain,
set_difference(iPr_def_10,iPr_def_10) = iPr_def_11,
inference(demodulation,[status(thm)],[c_610,c_1568]) ).
tcf(c_1577,plain,
( ( iPr_def_10 != iPr_def_10 )
| ( empty_set != iPr_def_11 ) ),
inference(demodulation,[status(thm)],[c_614,c_1568]) ).
tcf(c_1578,plain,
empty_set != iPr_def_11,
inference(equality_resolution_simp,[status(thm)],[c_1577]) ).
tcf(c_1579,plain,
empty_set = iPr_def_11,
inference(demodulation,[status(thm)],[c_1572,c_1099]) ).
tcf(c_1580,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1579,c_1578]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET931+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n004.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 12:23:56 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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.14/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.45 % Proving...
% 2.05/6.30 % SZS status Started for theBenchmark.p
% 2.05/6.30 % SZS status Theorem for theBenchmark.p
% 2.05/6.30
% 2.05/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.05/6.30
% 2.05/6.30 % ------ iProver source info
% 2.05/6.30
% 2.05/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.05/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.05/6.30 % git: non_committed_changes: false
% 2.05/6.30
% 2.05/6.30 % ------ Parsing...
% 2.05/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.05/6.30
% 2.05/6.30 % ------ 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 %
% 2.05/6.30
% 2.05/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.05/6.30
% 2.05/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.05/6.30 % ------ Proving...
% 2.05/6.30 % ------ Problem Properties
% 2.05/6.30
% 2.05/6.30 %
% 2.05/6.30 % clauses 20
% 2.05/6.30 % conjectures 5
% 2.05/6.30 % EPR 9
% 2.05/6.30 % Horn 18
% 2.05/6.30 % unary 12
% 2.05/6.30 % binary 6
% 2.05/6.30 % lits 34
% 2.05/6.30 % lits eq 24
% 2.05/6.30 % fd_pure 0
% 2.05/6.30 % fd_pseudo 0
% 2.05/6.30 % fd_cond 0
% 2.05/6.30 % fd_pseudo_cond 1
% 2.05/6.30 % AC symbols 0
% 2.05/6.30
% 2.05/6.30 % ------ Schedule dynamic 5 is on
% 2.05/6.30
% 2.05/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.05/6.30
% 2.05/6.30
% 2.05/6.30 % ------
% 2.05/6.30 % Current options:
% 2.05/6.30 % ------
% 2.05/6.30
% 2.05/6.30
% 2.05/6.30 %
% 2.05/6.30
% 2.05/6.30 % ------ Proving...
% 2.05/6.30 %
% 2.05/6.30
% 2.05/6.30 % SZS status Theorem for theBenchmark.p
% 2.05/6.30
% 2.05/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.08/6.30
% 2.08/6.30
%------------------------------------------------------------------------------