%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET951+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:11 PM UTC 2026
% Result : Theorem 3.06s 1.21s
% Output : CNFRefutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 62 ( 12 unt; 0 def)
% Number of atoms : 236 ( 67 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 297 ( 123 ~; 115 |; 54 &)
% ( 4 <=>; 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 178 ( 0 sgn 158 !; 20 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
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,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(f11,conjecture,
! [X0,X1,X2,X3,X4] :
~ ( ! [X5,X6] :
~ ( in(X6,set_intersection2(X2,X4))
& in(X5,set_intersection2(X1,X3))
& X0 = ordered_pair(X5,X6) )
& in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
~ ( ! [X5,X6] :
~ ( in(X6,set_intersection2(X2,X4))
& in(X5,set_intersection2(X1,X3))
& X0 = ordered_pair(X5,X6) )
& in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,axiom,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f15,plain,
? [X0,X1,X2,X3,X4] :
( ! [X5,X6] :
( ~ in(X6,set_intersection2(X2,X4))
| ~ in(X5,set_intersection2(X1,X3))
| ordered_pair(X5,X6) != X0 )
& in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
inference(ennf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| ( X1 = X3
& X0 = X2 ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f18,plain,
( ! [X5,X6] :
( ~ in(X6,set_intersection2(sK2,sK4))
| ~ in(X5,set_intersection2(sK1,sK3))
| ordered_pair(X5,X6) != sK0 )
& in(sK0,set_intersection2(cartesian_product2(sK1,sK2),cartesian_product2(sK3,sK4))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f15]) ).
fof(f19,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(f20,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,[],[f19]) ).
fof(f21,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,[],[f20]) ).
fof(f22,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(sK5(X0,X1,X2),X2)
| ( in(sK5(X0,X1,X2),X1)
& in(sK5(X0,X1,X2),X0) ) )
& ( ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X1)
| ~ in(sK5(X0,X1,X2),X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f21]) ).
fof(f23,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(f24,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,[],[f23]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) != X2
| ! [X8] :
( ( ~ in(X8,X2)
| ( ordered_pair(sK9(X0,X1,X8),sK10(X0,X1,X8)) = X8
& in(sK10(X0,X1,X8),X1)
& in(sK9(X0,X1,X8),X0) ) )
& ( ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) )
| in(X8,X2) ) ) )
& ( ( ( in(sK6(X0,X1,X2),X2)
| ( sK6(X0,X1,X2) = ordered_pair(sK7(X0,X1,X2),sK8(X0,X1,X2))
& in(sK8(X0,X1,X2),X1)
& in(sK7(X0,X1,X2),X0) ) )
& ( ~ in(sK6(X0,X1,X2),X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != sK6(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) ) ) )
| X2 = cartesian_product2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10]),skolemize(X3,sK6(X0,X1,X2)),skolemize(X6,sK7(X0,X1,X2)),skolemize(X7,sK8(X0,X1,X2)),skolemize(X11,sK9(X0,X1,X8)),skolemize(X12,sK10(X0,X1,X8))],[f24]) ).
fof(f26,plain,
! [X6,X5] :
( ~ in(X6,set_intersection2(sK2,sK4))
| ~ in(X5,set_intersection2(sK1,sK3))
| ordered_pair(X5,X6) != sK0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
in(sK0,set_intersection2(cartesian_product2(sK1,sK2),cartesian_product2(sK3,sK4))),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f29,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f30,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| ordered_pair(sK9(X0,X1,X8),sK10(X0,X1,X8)) = X8 ),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| in(sK10(X0,X1,X8),X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| in(sK9(X0,X1,X8),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X1 = X3 ),
inference(cnf_transformation,[],[f17]) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X0 = X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f47,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f30]) ).
fof(f48,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f29]) ).
fof(f49,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f28]) ).
fof(f52,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| in(sK9(X0,X1,X8),X0) ),
inference(equality_resolution,[],[f39]) ).
fof(f53,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| in(sK10(X0,X1,X8),X1) ),
inference(equality_resolution,[],[f38]) ).
fof(f54,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| ordered_pair(sK9(X0,X1,X8),sK10(X0,X1,X8)) = X8 ),
inference(equality_resolution,[],[f37]) ).
tcf(c_49,negated_conjecture,
in(sK0,set_intersection2(cartesian_product2(sK1,sK2),cartesian_product2(sK3,sK4))),
inference(cnf_transformation,[],[f27]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ in(X1,set_intersection2(sK2,sK4))
| ~ in(X0,set_intersection2(sK1,sK3))
| ( ordered_pair(X0,X1) != sK0 ) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_intersection2(X1,X2))
| ~ in(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK9(X1,X2,X0),X1)
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK10(X1,X2,X0),X2)
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ordered_pair(sK9(X1,X2,X0),sK10(X1,X2,X0)) = X0 )
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ( ordered_pair(X0,X1) != ordered_pair(X2,X3) ) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X3 )
| ( ordered_pair(X0,X1) != ordered_pair(X2,X3) ) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_590,plain,
in(sK0,cartesian_product2(sK1,sK2)),
inference(superposition,[status(thm)],[c_49,c_55]) ).
tcf(c_599,plain,
in(sK0,cartesian_product2(sK3,sK4)),
inference(superposition,[status(thm)],[c_49,c_56]) ).
tcf(c_842,plain,
( in(sK10(sK1,sK2,sK0),sK2)
| ~ in(sK0,cartesian_product2(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_843,plain,
( in(sK9(sK1,sK2,sK0),sK1)
| ~ in(sK0,cartesian_product2(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_1164,plain,
ordered_pair(sK9(sK1,sK2,sK0),sK10(sK1,sK2,sK0)) = sK0,
inference(superposition,[status(thm)],[c_590,c_67]) ).
tcf(c_1165,plain,
ordered_pair(sK9(sK3,sK4,sK0),sK10(sK3,sK4,sK0)) = sK0,
inference(superposition,[status(thm)],[c_599,c_67]) ).
tcf(c_1371,plain,
( ~ in(sK10(sK1,sK2,sK0),set_intersection2(sK2,sK4))
| ~ in(sK9(sK1,sK2,sK0),set_intersection2(sK1,sK3)) ),
inference(superposition,[status(thm)],[c_1164,c_50]) ).
tcf(c_1375,plain,
! [X0: $i,X1: $i] :
( ( sK10(sK1,sK2,sK0) = X1 )
| ( ordered_pair(X0,X1) != sK0 ) ),
inference(superposition,[status(thm)],[c_1164,c_69]) ).
tcf(c_1376,plain,
! [X0: $i,X1: $i] :
( ( sK9(sK1,sK2,sK0) = X0 )
| ( ordered_pair(X0,X1) != sK0 ) ),
inference(superposition,[status(thm)],[c_1164,c_68]) ).
tcf(c_1489,plain,
sK10(sK1,sK2,sK0) = sK10(sK3,sK4,sK0),
inference(superposition,[status(thm)],[c_1165,c_1375]) ).
tcf(c_1490,plain,
ordered_pair(sK9(sK3,sK4,sK0),sK10(sK1,sK2,sK0)) = sK0,
inference(demodulation,[status(thm)],[c_1165,c_1489]) ).
tcf(c_1514,plain,
( in(sK10(sK1,sK2,sK0),sK4)
| ~ in(sK0,cartesian_product2(sK3,sK4)) ),
inference(superposition,[status(thm)],[c_1489,c_66]) ).
tcf(c_1516,plain,
in(sK10(sK1,sK2,sK0),sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_1514,c_599]) ).
tcf(c_1522,plain,
( ~ in(sK9(sK1,sK2,sK0),sK3)
| ~ in(sK9(sK1,sK2,sK0),sK1)
| ~ in(sK10(sK1,sK2,sK0),set_intersection2(sK2,sK4)) ),
inference(superposition,[status(thm)],[c_54,c_1371]) ).
tcf(c_1541,plain,
( ~ in(sK9(sK1,sK2,sK0),sK3)
| ~ in(sK10(sK1,sK2,sK0),set_intersection2(sK2,sK4)) ),
inference(global_subsumption_just,[status(thm)],[c_1522,c_590,c_843,c_1522]) ).
tcf(c_1547,plain,
( ~ in(sK10(sK1,sK2,sK0),sK4)
| ~ in(sK10(sK1,sK2,sK0),sK2)
| ~ in(sK9(sK1,sK2,sK0),sK3) ),
inference(superposition,[status(thm)],[c_54,c_1541]) ).
tcf(c_1548,plain,
( ~ in(sK10(sK1,sK2,sK0),sK2)
| ~ in(sK9(sK1,sK2,sK0),sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1547,c_1516]) ).
tcf(c_1582,plain,
sK9(sK1,sK2,sK0) = sK9(sK3,sK4,sK0),
inference(superposition,[status(thm)],[c_1490,c_1376]) ).
tcf(c_1646,plain,
~ in(sK9(sK1,sK2,sK0),sK3),
inference(global_subsumption_just,[status(thm)],[c_1548,c_590,c_842,c_1548]) ).
tcf(c_1656,plain,
( in(sK9(sK1,sK2,sK0),sK3)
| ~ in(sK0,cartesian_product2(sK3,sK4)) ),
inference(superposition,[status(thm)],[c_1582,c_65]) ).
tcf(c_1658,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1656,c_1646,c_599]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET951+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.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 12:26:06 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 3.06/1.21 % SZS status Started for theBenchmark.p
% 3.06/1.21 % SZS status Theorem for theBenchmark.p
% 3.06/1.21
% 3.06/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.06/1.21
% 3.06/1.21 % ------ iProver source info
% 3.06/1.21
% 3.06/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 3.06/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.06/1.21 % git: non_committed_changes: false
% 3.06/1.21
% 3.06/1.21 % ------ Parsing...
% 3.06/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.06/1.21
% 3.06/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.06/1.21
% 3.06/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.06/1.21
% 3.06/1.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.06/1.21 % ------ Proving...
% 3.06/1.21 % ------ Problem Properties
% 3.06/1.21
% 3.06/1.21 %
% 3.06/1.21 % clauses 21
% 3.06/1.21 % conjectures 2
% 3.06/1.21 % EPR 1
% 3.06/1.21 % Horn 16
% 3.06/1.21 % unary 3
% 3.06/1.21 % binary 8
% 3.06/1.21 % lits 52
% 3.06/1.21 % lits eq 17
% 3.06/1.21 % fd_pure 0
% 3.06/1.21 % fd_pseudo 0
% 3.06/1.21 % fd_cond 0
% 3.06/1.21 % fd_pseudo_cond 9
% 3.06/1.21 % AC symbols 0
% 3.06/1.21
% 3.06/1.21 % ------ Schedule dynamic 5 is on
% 3.06/1.21
% 3.06/1.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.06/1.21
% 3.06/1.21
% 3.06/1.21 % ------
% 3.06/1.21 % Current options:
% 3.06/1.21 % ------
% 3.06/1.21
% 3.06/1.21
% 3.06/1.21 %
% 3.06/1.21
% 3.06/1.21 % ------ Proving...
% 3.06/1.21 %
% 3.06/1.21
% 3.06/1.21 % SZS status Theorem for theBenchmark.p
% 3.06/1.21
% 3.06/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.11/1.21
% 4.11/1.21
%------------------------------------------------------------------------------