%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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:56:21 PM UTC 2026
% Result : Theorem 6.70s 6.99s
% Output : CNFRefutation 6.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 74 ( 18 unt; 3 def)
% Number of atoms : 281 ( 55 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 289 ( 117 ~; 122 |; 36 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 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; 4 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 155 ( 0 sgn 147 !; 8 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( X2 = fiber(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord1) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f15,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f30,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f32,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_wellord1) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f50,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( X2 = fiber(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f53,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(ennf_transformation,[],[f15]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f56,plain,
? [X0,X1,X2] :
( relation(X2)
& ~ subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
inference(ennf_transformation,[],[f33]) ).
fof(f65,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ( fiber(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) )
& ( ~ in(ordered_pair(X3,X1),X0)
| X1 = X3
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) )
& ( ~ in(X3,X2)
| ~ in(ordered_pair(X3,X1),X0)
| X1 = X3 ) )
| X2 = fiber(X0,X1) ) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f66,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ( fiber(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) )
& ( ~ in(ordered_pair(X3,X1),X0)
| X1 = X3
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) )
& ( ~ in(X3,X2)
| ~ in(ordered_pair(X3,X1),X0)
| X1 = X3 ) )
| X2 = fiber(X0,X1) ) ) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ( fiber(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( in(ordered_pair(X4,X1),X0)
& X1 != X4 ) )
& ( ~ in(ordered_pair(X4,X1),X0)
| X1 = X4
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( in(ordered_pair(X3,X1),X0)
& X3 != X1 ) )
& ( ~ in(X3,X2)
| ~ in(ordered_pair(X3,X1),X0)
| X1 = X3 ) )
| X2 = fiber(X0,X1) ) ) ),
inference(rectify,[],[f66]) ).
fof(f68,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ( fiber(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( in(ordered_pair(X4,X1),X0)
& X1 != X4 ) )
& ( ~ in(ordered_pair(X4,X1),X0)
| X1 = X4
| in(X4,X2) ) ) )
& ( ( ( in(sK0(X0,X1,X2),X2)
| ( in(ordered_pair(sK0(X0,X1,X2),X1),X0)
& sK0(X0,X1,X2) != X1 ) )
& ( ~ in(sK0(X0,X1,X2),X2)
| ~ in(ordered_pair(sK0(X0,X1,X2),X1),X0)
| sK0(X0,X1,X2) = X1 ) )
| X2 = fiber(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f67]) ).
fof(f69,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,[],[f51]) ).
fof(f70,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,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK1(X0,X1),X0)
& ~ in(sK1(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f70]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ( ( ~ in(X0,relation_restriction(X2,X1))
| ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) )
& ( ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2)
| in(X0,relation_restriction(X2,X1)) ) ) ),
inference(nnf_transformation,[],[f54]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ( ( ~ in(X0,relation_restriction(X2,X1))
| ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) )
& ( ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2)
| in(X0,relation_restriction(X2,X1)) ) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
( relation(sK10)
& ~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10)],[f56]) ).
fof(f86,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f88,plain,
! [X2,X0,X1,X4] :
( ~ relation(X0)
| fiber(X0,X1) != X2
| ~ in(X4,X2)
| in(ordered_pair(X4,X1),X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f89,plain,
! [X2,X0,X1,X4] :
( ~ relation(X0)
| fiber(X0,X1) != X2
| ~ in(X4,X2)
| X1 != X4 ),
inference(cnf_transformation,[],[f68]) ).
fof(f90,plain,
! [X2,X0,X1,X4] :
( ~ relation(X0)
| fiber(X0,X1) != X2
| ~ in(ordered_pair(X4,X1),X0)
| X1 = X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f95,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f96,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f97,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f99,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f53]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_restriction(X2,X1))
| in(X0,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f118,plain,
relation(sK10),
inference(cnf_transformation,[],[f80]) ).
fof(f119,plain,
~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),
inference(cnf_transformation,[],[f80]) ).
fof(f131,plain,
! [X2,X0,X1,X4] :
( ~ relation(X0)
| fiber(X0,X1) != X2
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| X1 = X4
| in(X4,X2) ),
inference(definition_unfolding,[],[f90,f97]) ).
fof(f132,plain,
! [X2,X0,X1,X4] :
( ~ relation(X0)
| fiber(X0,X1) != X2
| ~ in(X4,X2)
| in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0) ),
inference(definition_unfolding,[],[f88,f97]) ).
fof(f134,plain,
! [X0,X1,X4] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| X1 = X4
| in(X4,fiber(X0,X1)) ),
inference(equality_resolution,[],[f131]) ).
fof(f135,plain,
! [X2,X0,X4] :
( ~ relation(X0)
| fiber(X0,X4) != X2
| ~ in(X4,X2) ),
inference(equality_resolution,[],[f89]) ).
fof(f136,plain,
! [X0,X4] :
( ~ relation(X0)
| ~ in(X4,fiber(X0,X4)) ),
inference(equality_resolution,[],[f135]) ).
fof(f137,plain,
! [X0,X1,X4] :
( ~ relation(X0)
| ~ in(X4,fiber(X0,X1))
| in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0) ),
inference(equality_resolution,[],[f132]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f86]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,fiber(X2,X1))
| ( X0 = X1 )
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ~ relation(X1)
| ~ in(X0,fiber(X1,X0)) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),X1)
| ~ relation(X1)
| ~ in(X0,fiber(X1,X2)) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f96]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f95]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ relation(X1)
| ~ in(X0,relation_restriction(X1,X2)) ),
inference(cnf_transformation,[],[f115]) ).
tcf(c_82,negated_conjecture,
~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),
inference(cnf_transformation,[],[f119]) ).
tcf(c_83,negated_conjecture,
relation(sK10),
inference(cnf_transformation,[],[f118]) ).
tcf(c_489,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X2)),X1)
| ~ relation(X1)
| ~ in(X0,fiber(X1,X2)) ),
inference(demodulation,[status(thm)],[c_58,c_51]) ).
tcf(c_507,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,fiber(X2,X1))
| ( X0 = X1 )
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2) ),
inference(demodulation,[status(thm)],[c_56,c_51]) ).
tcf(c_1479,definition,
iPr_def_10 = relation_restriction(sK10,sK8),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1480,definition,
iPr_def_11 = fiber(iPr_def_10,sK9),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1481,definition,
iPr_def_12 = fiber(sK10,sK9),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1482,negated_conjecture,
relation(sK10),
inference(demodulation,[status(thm)],[c_83]) ).
tcf(c_1483,negated_conjecture,
~ subset(iPr_def_11,iPr_def_12),
inference(demodulation,[status(thm)],[c_82,c_1481,c_1479,c_1480]) ).
tcf(c_2245,plain,
( relation(iPr_def_10)
| ~ relation(sK10) ),
inference(superposition,[status(thm)],[c_1479,c_63]) ).
tcf(c_2246,plain,
relation(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_2245,c_1482]) ).
tcf(c_2322,plain,
( ~ relation(iPr_def_10)
| ~ in(sK9,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1480,c_57]) ).
tcf(c_2323,plain,
~ in(sK9,iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_2322,c_2246]) ).
tcf(c_2372,plain,
! [X0: $i] :
( in(X0,sK10)
| ~ relation(sK10)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1479,c_79]) ).
tcf(c_2373,plain,
! [X0: $i] :
( in(X0,sK10)
| ~ in(X0,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2372,c_1482]) ).
tcf(c_2529,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK10)
| ~ relation(iPr_def_10)
| ~ in(X0,fiber(iPr_def_10,X1)) ),
inference(superposition,[status(thm)],[c_489,c_2373]) ).
tcf(c_2533,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK10)
| ~ in(X0,fiber(iPr_def_10,X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2529,c_2246]) ).
tcf(c_2719,plain,
! [X0: $i,X1: $i] :
( in(X0,fiber(sK10,X1))
| ( X0 = X1 )
| ~ relation(sK10)
| ~ in(X0,fiber(iPr_def_10,X1)) ),
inference(superposition,[status(thm)],[c_2533,c_507]) ).
tcf(c_2728,plain,
! [X0: $i,X1: $i] :
( in(X0,fiber(sK10,X1))
| ( X0 = X1 )
| ~ in(X0,fiber(iPr_def_10,X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2719,c_1482]) ).
tcf(c_2893,plain,
! [X0: $i,X1: $i] :
( subset(fiber(iPr_def_10,X0),X1)
| in(sK1(fiber(iPr_def_10,X0),X1),fiber(sK10,X0))
| ( sK1(fiber(iPr_def_10,X0),X1) = X0 ) ),
inference(superposition,[status(thm)],[c_60,c_2728]) ).
tcf(c_3088,plain,
! [X0: $i] :
( subset(fiber(iPr_def_10,X0),fiber(sK10,X0))
| ( sK1(fiber(iPr_def_10,X0),fiber(sK10,X0)) = X0 ) ),
inference(superposition,[status(thm)],[c_2893,c_59]) ).
tcf(c_8280,plain,
( subset(fiber(iPr_def_10,sK9),iPr_def_12)
| ( sK1(fiber(iPr_def_10,sK9),fiber(sK10,sK9)) = sK9 ) ),
inference(superposition,[status(thm)],[c_1481,c_3088]) ).
tcf(c_8284,plain,
( subset(iPr_def_11,iPr_def_12)
| ( sK1(iPr_def_11,iPr_def_12) = sK9 ) ),
inference(light_normalisation,[status(thm)],[c_8280,c_1480,c_1481]) ).
tcf(c_8285,plain,
sK1(iPr_def_11,iPr_def_12) = sK9,
inference(forward_subsumption_resolution,[status(thm)],[c_8284,c_1483]) ).
tcf(c_8307,plain,
( subset(iPr_def_11,iPr_def_12)
| in(sK9,iPr_def_11) ),
inference(superposition,[status(thm)],[c_8285,c_60]) ).
tcf(c_8316,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8307,c_1483,c_2323]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.59 % Computer : n017.cluster.edu
% 0.13/5.59 % Model : x86_64 x86_64
% 0.13/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.59 % Memory : 8046.5625MB
% 0.13/5.59 % OS : Linux 6.8.0-71-generic
% 0.13/5.59 % CPULimit : 300
% 0.13/5.59 % WCLimit : 300
% 0.13/5.59 % DateTime : Thu Sep 24 13:19:37 UTC 2026
% 0.13/5.59 % CPUTime :
% 0.13/5.59 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.63 Running first-order theorem proving
% 0.16/5.63 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.16/5.64
% 0.16/5.64 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.64
% 0.16/5.64 % Detected problem language: tptp
% 0.16/5.66 % Proving...
% 6.70/6.99 % SZS status Started for theBenchmark.p
% 6.70/6.99 % SZS status Theorem for theBenchmark.p
% 6.70/6.99
% 6.70/6.99 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.70/6.99
% 6.70/6.99 % ------ iProver source info
% 6.70/6.99
% 6.70/6.99 % git: date: 2026-07-19 20:42:38 +0200
% 6.70/6.99 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.70/6.99 % git: non_committed_changes: false
% 6.70/6.99
% 6.70/6.99 % ------ Parsing...
% 6.70/6.99 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.70/6.99
% 6.70/6.99 % ------ Preprocessing... sup_sim: 5 sf_s rm: 6 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 6.70/6.99
% 6.70/6.99 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.70/6.99
% 6.70/6.99 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.70/6.99 % ------ Proving...
% 6.70/6.99 % ------ Problem Properties
% 6.70/6.99
% 6.70/6.99 %
% 6.70/6.99 % clauses 43
% 6.70/6.99 % conjectures 2
% 6.70/6.99 % EPR 19
% 6.70/6.99 % Horn 37
% 6.70/6.99 % unary 19
% 6.70/6.99 % binary 11
% 6.70/6.99 % lits 86
% 6.70/6.99 % lits eq 16
% 6.70/6.99 % fd_pure 0
% 6.70/6.99 % fd_pseudo 0
% 6.70/6.99 % fd_cond 1
% 6.70/6.99 % fd_pseudo_cond 4
% 6.70/6.99 % AC symbols 0
% 6.70/6.99
% 6.70/6.99 % ------ Schedule dynamic 5 is on
% 6.70/6.99
% 6.70/6.99 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.70/6.99
% 6.70/6.99
% 6.70/6.99 % ------
% 6.70/6.99 % Current options:
% 6.70/6.99 % ------
% 6.70/6.99
% 6.70/6.99
% 6.70/6.99 %
% 6.70/6.99
% 6.70/6.99 % ------ Proving...
% 6.70/6.99 %
% 6.70/6.99
% 6.70/6.99 % SZS status Theorem for theBenchmark.p
% 6.70/6.99
% 6.70/6.99 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.70/6.99
% 6.70/6.99
%------------------------------------------------------------------------------