%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET171+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n008.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:46:49 PM UTC 2026
% Result : Theorem 10.54s 2.30s
% Output : CNFRefutation 10.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 59 ( 7 unt; 0 def)
% Number of atoms : 171 ( 19 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 192 ( 80 ~; 90 |; 18 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 93 !; 5 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f8,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f9,conjecture,
! [X0,X1,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_distributes_over_intersection) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
? [X0,X1,X2] : union(X0,intersection(X1,X2)) != intersection(union(X0,X1),union(X0,X2)),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
union(sK0,intersection(sK1,sK2)) != intersection(union(sK0,sK1),union(sK0,sK2)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( ( X0 != X1
| ! [X2] :
( ( ~ member(X2,X0)
| member(X2,X1) )
& ( ~ member(X2,X1)
| member(X2,X0) ) ) )
& ( ? [X2] :
( ( member(X2,X0)
| member(X2,X1) )
& ( ~ member(X2,X0)
| ~ member(X2,X1) ) )
| X0 = X1 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 != X1
| ! [X3] :
( ( ~ member(X3,X0)
| member(X3,X1) )
& ( ~ member(X3,X1)
| member(X3,X0) ) ) )
& ( ? [X2] :
( ( member(X2,X0)
| member(X2,X1) )
& ( ~ member(X2,X0)
| ~ member(X2,X1) ) )
| X0 = X1 ) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 != X1
| ! [X3] :
( ( ~ member(X3,X0)
| member(X3,X1) )
& ( ~ member(X3,X1)
| member(X3,X0) ) ) )
& ( ( ( member(sK3(X0,X1),X0)
| member(sK3(X0,X1),X1) )
& ( ~ member(sK3(X0,X1),X0)
| ~ member(sK3(X0,X1),X1) ) )
| X0 = X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) )
& ( ( ~ member(X2,X1)
& ~ member(X2,X0) )
| member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) )
& ( ( ~ member(X2,X1)
& ~ member(X2,X0) )
| member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ~ member(X2,intersection(X0,X1))
| ( member(X2,X1)
& member(X2,X0) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( ~ member(X2,intersection(X0,X1))
| ( member(X2,X1)
& member(X2,X0) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f19]) ).
fof(f26,plain,
union(sK0,intersection(sK1,sK2)) != intersection(union(sK0,sK1),union(sK0,sK2)),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| member(sK3(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X0)
| ~ member(sK3(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_49,negated_conjecture,
intersection(union(sK0,sK1),union(sK0,sK2)) != union(sK0,intersection(sK1,sK2)),
inference(cnf_transformation,[],[f26]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ member(sK3(X0,X1),X1)
| ~ member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( member(sK3(X0,X1),X1)
| member(sK3(X0,X1),X0)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_718,plain,
( ( intersection(union(sK0,sK1),union(sK0,sK2)) = union(sK0,intersection(sK1,sK2)) )
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_719,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2)))
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2)))
| ( intersection(union(sK0,sK1),union(sK0,sK2)) = union(sK0,intersection(sK1,sK2)) ) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_753,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_754,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_1029,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0)
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2))) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1684,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2)
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1780,plain,
! [X0: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),X0))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_1787,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1)
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_3433,plain,
! [X0: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,X0))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_3714,plain,
! [X0: $i,X1: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(X0,X1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X1)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_3715,plain,
! [X0: $i,X1: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(X1,X0))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_3722,plain,
! [X0: $i,X1: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X1)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(X0,X1)) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_3723,plain,
! [X0: $i,X1: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(X0,X1)) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_5897,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_1780]) ).
tcf(c_9357,plain,
! [X0: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(X0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_3715]) ).
tcf(c_9358,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_9357]) ).
tcf(c_9363,plain,
! [X0: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(X0,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2) ),
inference(instantiation,[status(thm)],[c_3715]) ).
tcf(c_9364,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2) ),
inference(instantiation,[status(thm)],[c_9363]) ).
tcf(c_9369,plain,
! [X0: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(X0,sK1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1) ),
inference(instantiation,[status(thm)],[c_3715]) ).
tcf(c_9370,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1) ),
inference(instantiation,[status(thm)],[c_9369]) ).
tcf(c_9960,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_3722]) ).
tcf(c_9972,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_3723]) ).
tcf(c_12972,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_3433]) ).
tcf(c_18909,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_3433]) ).
tcf(c_18988,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_3433]) ).
tcf(c_20613,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1) ),
inference(instantiation,[status(thm)],[c_3714]) ).
tcf(c_27692,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_20613,c_18988,c_18909,c_12972,c_9972,c_9960,c_9370,c_9364,c_9358,c_5897,c_1787,c_1684,c_1029,c_753,c_754,c_719,c_718,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET171+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n008.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 10:08:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 10.54/2.30 % SZS status Started for theBenchmark.p
% 10.54/2.30 % SZS status Theorem for theBenchmark.p
% 10.54/2.30
% 10.54/2.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.54/2.30
% 10.54/2.30 % ------ iProver source info
% 10.54/2.30
% 10.54/2.30 % git: date: 2026-07-19 20:42:38 +0200
% 10.54/2.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.54/2.30 % git: non_committed_changes: false
% 10.54/2.30
% 10.54/2.30 % ------ Parsing...
% 10.54/2.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.54/2.30
% 10.54/2.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 %
% 10.54/2.30
% 10.54/2.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.54/2.30
% 10.54/2.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.54/2.30 % ------ Proving...
% 10.54/2.30 % ------ Problem Properties
% 10.54/2.30
% 10.54/2.30 %
% 10.54/2.30 % clauses 16
% 10.54/2.30 % conjectures 1
% 10.54/2.30 % EPR 3
% 10.54/2.30 % Horn 13
% 10.54/2.30 % unary 4
% 10.54/2.30 % binary 6
% 10.54/2.30 % lits 34
% 10.54/2.30 % lits eq 6
% 10.54/2.30 % fd_pure 0
% 10.54/2.30 % fd_pseudo 0
% 10.54/2.30 % fd_cond 0
% 10.54/2.30 % fd_pseudo_cond 3
% 10.54/2.30 % AC symbols 0
% 10.54/2.30
% 10.54/2.30 % ------ Schedule dynamic 5 is on
% 10.54/2.30
% 10.54/2.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.54/2.30
% 10.54/2.30
% 10.54/2.30 % ------
% 10.54/2.30 % Current options:
% 10.54/2.30 % ------
% 10.54/2.30
% 10.54/2.30
% 10.54/2.30 %
% 10.54/2.30
% 10.54/2.30 % ------ Proving...
% 10.54/2.30 %
% 10.54/2.30
% 10.54/2.30 % SZS status Theorem for theBenchmark.p
% 10.54/2.30
% 10.54/2.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.54/2.31
% 10.54/2.31
%------------------------------------------------------------------------------