%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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:33 PM UTC 2026
% Result : Theorem 4.11s 1.28s
% Output : CNFRefutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 68 ( 2 unt; 0 def)
% Number of atoms : 266 ( 52 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 327 ( 129 ~; 136 |; 53 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 6 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 158 ( 0 sgn 145 !; 13 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f16,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f20,axiom,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f23,conjecture,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f26,plain,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X3] : in(X3,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f28,plain,
? [X0,X1] :
( disjoint(X0,X1)
<~> set_difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f24]) ).
fof(f29,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X3] : ~ in(X3,set_intersection2(X0,X1)) )
& ( ? [X2] : in(X2,set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f35,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) = X0 )
& ( ~ disjoint(X0,X1)
| set_difference(X0,X1) != X0 ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f36,plain,
( ( disjoint(sK0,sK1)
| sK0 = set_difference(sK0,sK1) )
& ( ~ disjoint(sK0,sK1)
| sK0 != set_difference(sK0,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f35]) ).
fof(f37,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,[],[f6]) ).
fof(f38,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,[],[f37]) ).
fof(f39,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,[],[f38]) ).
fof(f40,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(sK2(X0,X1,X2),X2)
| ( ~ in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) ) )
& ( ~ in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f39]) ).
fof(f41,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X3] : ~ in(X3,set_intersection2(X0,X1)) )
& ( in(sK3(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f29]) ).
fof(f42,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set )
& ( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(rectify,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f45]) ).
fof(f49,plain,
( disjoint(sK0,sK1)
| sK0 = set_difference(sK0,sK1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f50,plain,
( ~ disjoint(sK0,sK1)
| sK0 != set_difference(sK0,sK1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f53,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| ~ in(X4,X2)
| ~ in(X4,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f57,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X0)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f59,plain,
! [X3,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X3,set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f60,plain,
! [X0,X1] :
( in(sK3(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f61,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f62,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f42]) ).
fof(f63,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f46]) ).
fof(f82,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f53]) ).
fof(f83,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f70]) ).
fof(f84,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f69]) ).
fof(f85,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f68]) ).
tcf(c_49,negated_conjecture,
( ~ disjoint(sK0,sK1)
| ( set_difference(sK0,sK1) != sK0 ) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_50,negated_conjecture,
( disjoint(sK0,sK1)
| ( set_difference(sK0,sK1) = sK0 ) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK2(X0,X1,X2),X1)
| ( set_difference(X0,X1) = X2 )
| ~ in(sK2(X0,X1,X2),X2)
| ~ in(sK2(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X0)
| ( set_difference(X0,X1) = X2 ) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ in(X0,X2)
| ~ in(X0,set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK3(X0,X1),set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ disjoint(X1,X2)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| ( set_intersection2(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = empty_set )
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_intersection2(X1,X2))
| ~ in(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_1111,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK3(X0,X1),X1) ),
inference(superposition,[status(thm)],[c_59,c_73]) ).
tcf(c_1112,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK3(X0,X1),X0) ),
inference(superposition,[status(thm)],[c_59,c_72]) ).
tcf(c_1161,plain,
( ( set_intersection2(sK0,sK1) = empty_set )
| ( set_difference(sK0,sK1) = sK0 ) ),
inference(superposition,[status(thm)],[c_50,c_63]) ).
tcf(c_1259,plain,
! [X0: $i] :
( ( set_intersection2(sK0,sK1) = empty_set )
| ~ in(X0,sK1)
| ~ in(X0,sK0) ),
inference(superposition,[status(thm)],[c_1161,c_58]) ).
tcf(c_1274,plain,
! [X0: $i] :
( disjoint(X0,sK1)
| ( set_intersection2(sK0,sK1) = empty_set )
| ~ in(sK3(X0,sK1),sK0) ),
inference(superposition,[status(thm)],[c_1111,c_1259]) ).
tcf(c_1317,plain,
( disjoint(sK0,sK1)
| ( set_intersection2(sK0,sK1) = empty_set ) ),
inference(superposition,[status(thm)],[c_1112,c_1274]) ).
tcf(c_1340,plain,
( disjoint(sK0,sK1)
| ( set_intersection2(sK0,sK1) != empty_set ) ),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_1348,plain,
( disjoint(sK1,sK0)
| ~ disjoint(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_1603,plain,
( in(sK2(sK0,sK1,sK0),sK1)
| ( set_difference(sK0,sK1) = sK0 )
| ~ in(sK2(sK0,sK1,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_1605,plain,
( in(sK2(sK0,sK1,sK0),sK0)
| ( set_difference(sK0,sK1) = sK0 ) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_1614,plain,
! [X0: $i] :
( in(sK2(sK0,sK1,sK0),set_intersection2(sK1,X0))
| ~ in(sK2(sK0,sK1,sK0),sK1)
| ~ in(sK2(sK0,sK1,sK0),X0) ),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_1671,negated_conjecture,
disjoint(sK0,sK1),
inference(global_subsumption_just,[status(thm)],[c_50,c_1317,c_1340]) ).
tcf(c_1964,plain,
( in(sK2(sK0,sK1,sK0),set_intersection2(sK1,sK0))
| ~ in(sK2(sK0,sK1,sK0),sK1)
| ~ in(sK2(sK0,sK1,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_1614]) ).
tcf(c_2904,plain,
( ~ disjoint(sK1,sK0)
| ~ in(sK2(sK0,sK1,sK0),set_intersection2(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_2905,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2904,c_1964,c_1671,c_1603,c_1605,c_1348,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 12:58:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.40 Running first-order theorem proving
% 0.02/0.40 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.02/0.41
% 0.02/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.41
% 0.02/0.41 % Detected problem language: tptp
% 0.02/0.42 % Proving...
% 4.11/1.28 % SZS status Started for theBenchmark.p
% 4.11/1.28 % SZS status Theorem for theBenchmark.p
% 4.11/1.28
% 4.11/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.11/1.28
% 4.11/1.28 % ------ iProver source info
% 4.11/1.28
% 4.11/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.11/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.11/1.28 % git: non_committed_changes: false
% 4.11/1.28
% 4.11/1.28 % ------ Parsing...
% 4.11/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.11/1.28
% 4.11/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.11/1.28
% 4.11/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.11/1.28
% 4.11/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.11/1.28 % ------ Proving...
% 4.11/1.28 % ------ Problem Properties
% 4.11/1.28
% 4.11/1.28 %
% 4.11/1.28 % clauses 31
% 4.11/1.28 % conjectures 2
% 4.11/1.28 % EPR 8
% 4.11/1.28 % Horn 23
% 4.11/1.28 % unary 8
% 4.11/1.28 % binary 14
% 4.11/1.28 % lits 65
% 4.11/1.28 % lits eq 17
% 4.11/1.28 % fd_pure 0
% 4.11/1.28 % fd_pseudo 0
% 4.11/1.28 % fd_cond 1
% 4.11/1.28 % fd_pseudo_cond 7
% 4.11/1.28 % AC symbols 0
% 4.11/1.28
% 4.11/1.28 % ------ Schedule dynamic 5 is on
% 4.11/1.28
% 4.11/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.11/1.28
% 4.11/1.28
% 4.11/1.28 % ------
% 4.11/1.28 % Current options:
% 4.11/1.28 % ------
% 4.11/1.28
% 4.11/1.28
% 4.11/1.28 %
% 4.11/1.28
% 4.11/1.28 % ------ Proving...
% 4.11/1.28 %
% 4.11/1.28
% 4.11/1.28 % SZS status Theorem for theBenchmark.p
% 4.11/1.28
% 4.11/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.11/1.28
% 4.11/1.28
%------------------------------------------------------------------------------