%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET964+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 : n012.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:13 PM UTC 2026
% Result : Theorem 2.52s 6.45s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of formulae : 70 ( 11 unt; 0 def)
% Number of atoms : 240 ( 47 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 279 ( 109 ~; 118 |; 45 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 182 ( 0 sgn 163 !; 19 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = cartesian_product2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( X3 = ordered_pair(X4,X5)
& in(X5,X1)
& in(X4,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f13,conjecture,
! [X0,X1,X2] :
~ ( ~ subset(X1,X2)
& ( subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2))
| subset(cartesian_product2(X1,X0),cartesian_product2(X2,X0)) )
& X0 != empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( ~ subset(X1,X2)
& ( subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2))
| subset(cartesian_product2(X1,X0),cartesian_product2(X2,X0)) )
& X0 != empty_set ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ~ subset(X1,X2)
& ( subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2))
| subset(cartesian_product2(X1,X0),cartesian_product2(X2,X0)) )
& X0 != empty_set ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f19,plain,
( ~ subset(sK1,sK2)
& ( subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| subset(cartesian_product2(sK1,sK0),cartesian_product2(sK2,sK0)) )
& empty_set != sK0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f16]) ).
fof(f20,plain,
! [X0] :
( ( empty_set != X0
| ! [X1] : ~ in(X1,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(rectify,[],[f20]) ).
fof(f22,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( in(sK3(X0),X0)
| X0 = empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3(X0))],[f21]) ).
fof(f23,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,[],[f17]) ).
fof(f24,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,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK4(X0,X1),X0)
& ~ in(sK4(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f24]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ( in(X1,X3)
& in(X0,X2) ) )
& ( ~ in(X1,X3)
| ~ in(X0,X2)
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ( in(X1,X3)
& in(X0,X2) ) )
& ( ~ in(X1,X3)
| ~ in(X0,X2)
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ? [X4,X5] :
( X3 = ordered_pair(X4,X5)
& in(X5,X1)
& in(X4,X0) ) )
& ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ? [X4,X5] :
( X3 = ordered_pair(X4,X5)
& in(X5,X1)
& in(X4,X0) ) )
& ( ~ in(X3,X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) ) ) )
| X2 = cartesian_product2(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) != X2
| ! [X8] :
( ( ~ in(X8,X2)
| ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) ) )
& ( ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) )
| in(X8,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) ) )
& ( ~ in(X3,X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) ) ) )
| X2 = cartesian_product2(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) != X2
| ! [X8] :
( ( ~ in(X8,X2)
| ( ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8
& in(sK9(X0,X1,X8),X1)
& in(sK8(X0,X1,X8),X0) ) )
& ( ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) )
| in(X8,X2) ) ) )
& ( ( ( in(sK5(X0,X1,X2),X2)
| ( sK5(X0,X1,X2) = ordered_pair(sK6(X0,X1,X2),sK7(X0,X1,X2))
& in(sK7(X0,X1,X2),X1)
& in(sK6(X0,X1,X2),X0) ) )
& ( ~ in(sK5(X0,X1,X2),X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != sK5(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) ) ) )
| X2 = cartesian_product2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9]),skolemize(X3,sK5(X0,X1,X2)),skolemize(X6,sK6(X0,X1,X2)),skolemize(X7,sK7(X0,X1,X2)),skolemize(X11,sK8(X0,X1,X8)),skolemize(X12,sK9(X0,X1,X8))],[f29]) ).
fof(f33,plain,
~ subset(sK1,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
( subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| subset(cartesian_product2(sK1,sK0),cartesian_product2(sK2,sK0)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
empty_set != sK0,
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0] :
( empty_set != X0
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0] :
( in(sK3(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X0,X1] :
( in(sK4(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X1,X3) ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X0,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f48,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| in(sK8(X0,X1,X8),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,plain,
! [X2,X10,X0,X1,X8,X9] :
( cartesian_product2(X0,X1) != X2
| ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0)
| in(X8,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f52,plain,
! [X2,X0,X1] :
( in(sK5(X0,X1,X2),X2)
| in(sK6(X0,X1,X2),X0)
| cartesian_product2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f30]) ).
fof(f58,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f37]) ).
fof(f59,plain,
! [X2,X10,X0,X1,X9] :
( cartesian_product2(X0,X1) != X2
| ~ in(X10,X1)
| ~ in(X9,X0)
| in(ordered_pair(X9,X10),X2) ),
inference(equality_resolution,[],[f49]) ).
fof(f60,plain,
! [X10,X0,X1,X9] :
( ~ in(X10,X1)
| ~ in(X9,X0)
| in(ordered_pair(X9,X10),cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f59]) ).
fof(f61,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| in(sK8(X0,X1,X8),X0) ),
inference(equality_resolution,[],[f48]) ).
tcf(c_49,negated_conjecture,
empty_set != sK0,
inference(cnf_transformation,[],[f35]) ).
tcf(c_50,negated_conjecture,
( subset(cartesian_product2(sK1,sK0),cartesian_product2(sK2,sK0))
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2)) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_51,negated_conjecture,
~ subset(sK1,sK2),
inference(cnf_transformation,[],[f33]) ).
tcf(c_53,plain,
! [X0: $i] :
( in(sK3(X0),X0)
| ( X0 = empty_set ) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_54,plain,
! [X0: $i] : ~ in(X0,empty_set),
inference(cnf_transformation,[],[f58]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK4(X0,X1),X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X2,X1)
| ~ in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(X1,X3)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK6(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X2)
| ( cartesian_product2(X0,X1) = X2 ) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(ordered_pair(X0,X2),cartesian_product2(X1,X3))
| ~ in(X2,X3)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK8(X1,X2,X0),X1)
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_825,plain,
! [X0: $i] :
( in(X0,cartesian_product2(sK2,sK0))
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| ~ in(X0,cartesian_product2(sK1,sK0)) ),
inference(superposition,[status(thm)],[c_50,c_58]) ).
tcf(c_969,plain,
! [X0: $i,X1: $i] :
( in(X0,sK2)
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| ~ in(ordered_pair(X0,X1),cartesian_product2(sK1,sK0)) ),
inference(superposition,[status(thm)],[c_825,c_60]) ).
tcf(c_1011,plain,
! [X0: $i,X1: $i] : ~ in(X0,cartesian_product2(empty_set,X1)),
inference(superposition,[status(thm)],[c_67,c_54]) ).
tcf(c_1079,plain,
! [X0: $i] : cartesian_product2(empty_set,X0) = empty_set,
inference(superposition,[status(thm)],[c_53,c_1011]) ).
tcf(c_1115,plain,
! [X0: $i,X1: $i] :
( in(X0,sK2)
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| ~ in(X1,sK0)
| ~ in(X0,sK1) ),
inference(superposition,[status(thm)],[c_66,c_969]) ).
tcf(c_1128,plain,
! [X0: $i] :
( in(X0,sK2)
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| ( empty_set = sK0 )
| ~ in(X0,sK1) ),
inference(superposition,[status(thm)],[c_53,c_1115]) ).
tcf(c_1136,plain,
! [X0: $i] :
( in(X0,sK2)
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| ~ in(X0,sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1128,c_49]) ).
tcf(c_1150,plain,
! [X0: $i] :
( subset(X0,sK2)
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2))
| ~ in(sK4(X0,sK2),sK1) ),
inference(superposition,[status(thm)],[c_1136,c_56]) ).
tcf(c_1200,plain,
( subset(sK1,sK2)
| subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2)) ),
inference(superposition,[status(thm)],[c_57,c_1150]) ).
tcf(c_1201,plain,
subset(cartesian_product2(sK0,sK1),cartesian_product2(sK0,sK2)),
inference(forward_subsumption_resolution,[status(thm)],[c_1200,c_51]) ).
tcf(c_1202,plain,
! [X0: $i] :
( in(X0,cartesian_product2(sK0,sK2))
| ~ in(X0,cartesian_product2(sK0,sK1)) ),
inference(superposition,[status(thm)],[c_1201,c_58]) ).
tcf(c_1212,plain,
! [X0: $i,X1: $i] :
( in(ordered_pair(X0,X1),cartesian_product2(sK0,sK2))
| ~ in(X1,sK1)
| ~ in(X0,sK0) ),
inference(superposition,[status(thm)],[c_66,c_1202]) ).
tcf(c_1238,plain,
! [X0: $i,X1: $i] :
( in(sK5(empty_set,X0,X1),X1)
| ( cartesian_product2(empty_set,X0) = X1 ) ),
inference(superposition,[status(thm)],[c_63,c_54]) ).
tcf(c_1246,plain,
! [X0: $i,X1: $i] :
( in(sK5(empty_set,X1,X0),X0)
| ( X0 = empty_set ) ),
inference(light_normalisation,[status(thm)],[c_1238,c_1079]) ).
tcf(c_1436,plain,
! [X0: $i,X1: $i] :
( in(X1,sK2)
| ~ in(X1,sK1)
| ~ in(X0,sK0) ),
inference(superposition,[status(thm)],[c_1212,c_61]) ).
tcf(c_1626,plain,
! [X0: $i] :
( in(X0,sK2)
| ( empty_set = sK0 )
| ~ in(X0,sK1) ),
inference(superposition,[status(thm)],[c_1246,c_1436]) ).
tcf(c_1631,plain,
! [X0: $i] :
( in(X0,sK2)
| ~ in(X0,sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1626,c_49]) ).
tcf(c_1642,plain,
! [X0: $i] :
( subset(sK1,X0)
| in(sK4(sK1,X0),sK2) ),
inference(superposition,[status(thm)],[c_57,c_1631]) ).
tcf(c_1752,plain,
subset(sK1,sK2),
inference(superposition,[status(thm)],[c_1642,c_56]) ).
tcf(c_1754,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1752,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET964+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.05/5.74 % Computer : n012.cluster.edu
% 0.05/5.74 % Model : x86_64 x86_64
% 0.05/5.74 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/5.74 % Memory : 8046.5625MB
% 0.05/5.74 % OS : Linux 6.8.0-71-generic
% 0.05/5.74 % CPULimit : 300
% 0.05/5.74 % WCLimit : 300
% 0.05/5.74 % DateTime : Thu Sep 24 12:27:41 UTC 2026
% 0.05/5.74 % CPUTime :
% 0.05/5.74 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.05/5.77 Running first-order theorem proving
% 0.05/5.77 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.05/5.78
% 0.05/5.78 % ======== iProver multi-core TPTP/SMT =========
% 0.05/5.78
% 0.05/5.78 % Detected problem language: tptp
% 0.05/5.79 % Proving...
% 2.52/6.45 % SZS status Started for theBenchmark.p
% 2.52/6.45 % SZS status Theorem for theBenchmark.p
% 2.52/6.45
% 2.52/6.45 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.52/6.45
% 2.52/6.45 % ------ iProver source info
% 2.52/6.45
% 2.52/6.45 % git: date: 2026-07-19 20:42:38 +0200
% 2.52/6.45 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.52/6.45 % git: non_committed_changes: false
% 2.52/6.45
% 2.52/6.45 % ------ Parsing...
% 2.52/6.45 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.52/6.45
% 2.52/6.45 % ------ 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.52/6.45
% 2.52/6.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.52/6.45
% 2.52/6.45 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.52/6.45 % ------ Proving...
% 2.52/6.45 % ------ Problem Properties
% 2.52/6.45
% 2.52/6.45 %
% 2.52/6.45 % clauses 24
% 2.52/6.45 % conjectures 3
% 2.52/6.45 % EPR 9
% 2.52/6.45 % Horn 18
% 2.52/6.45 % unary 8
% 2.52/6.45 % binary 10
% 2.52/6.45 % lits 48
% 2.52/6.45 % lits eq 9
% 2.52/6.45 % fd_pure 0
% 2.52/6.45 % fd_pseudo 0
% 2.52/6.45 % fd_cond 1
% 2.52/6.45 % fd_pseudo_cond 4
% 2.52/6.45 % AC symbols 0
% 2.52/6.45
% 2.52/6.45 % ------ Schedule dynamic 5 is on
% 2.52/6.45
% 2.52/6.45 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.52/6.45
% 2.52/6.45
% 2.52/6.45 % ------
% 2.52/6.45 % Current options:
% 2.52/6.45 % ------
% 2.52/6.45
% 2.52/6.45
% 2.52/6.45 %
% 2.52/6.45
% 2.52/6.45 % ------ Proving...
% 2.52/6.45 %
% 2.52/6.45
% 2.52/6.45 % SZS status Theorem for theBenchmark.p
% 2.52/6.45
% 2.52/6.45 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.52/6.45
% 2.52/6.45
%------------------------------------------------------------------------------