%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU280+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 : n006.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:28 PM UTC 2026
% Result : Theorem 3.44s 1.31s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 83 ( 4 unt; 1 def)
% Number of atoms : 304 ( 74 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 308 ( 104 ~; 134 |; 58 &)
% ( 7 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 139 ( 0 sgn 102 !; 37 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( ordinal(X2)
& in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_xboole_0__e6_22__wellord2) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( ordinal(X2)
& in(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f7,axiom,
! [X0] :
( ! [X1,X2,X3] :
( ( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 )
=> X2 = X3 )
=> ? [X1] :
! [X2] :
( in(X2,X1)
<=> ? [X3] :
( ordinal(X2)
& X3 = X2
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_tarski__e6_22__wellord2__1) ).
fof(f8,plain,
! [X0] :
( ! [X1,X2,X3] :
( ( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 )
=> X2 = X3 )
=> ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) ) ),
inference(rectify,[],[f7]) ).
fof(f9,plain,
? [X0] :
! [X1] :
? [X2] :
( in(X2,X1)
<~> ( ordinal(X2)
& in(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f14,plain,
! [X0] :
( ? [X1,X2,X3] :
( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2
& X2 != X3 )
| ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0] :
( ? [X1,X2,X3] :
( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2
& X2 != X3 )
| ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) ) ),
inference(flattening,[],[f14]) ).
fof(f18,plain,
? [X0] :
! [X1] :
? [X2] :
( ( in(X2,X1)
| ( ordinal(X2)
& in(X2,X0) ) )
& ( ~ in(X2,X1)
| ~ ordinal(X2)
| ~ in(X2,X0) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f19,plain,
? [X0] :
! [X1] :
? [X2] :
( ( in(X2,X1)
| ( ordinal(X2)
& in(X2,X0) ) )
& ( ~ in(X2,X1)
| ~ ordinal(X2)
| ~ in(X2,X0) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X1] :
( ( in(sK2(X1),X1)
| ( ordinal(sK2(X1))
& in(sK2(X1),sK1) ) )
& ( ~ in(sK2(X1),X1)
| ~ ordinal(sK2(X1))
| ~ in(sK2(X1),sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X2,sK2(X1))],[f19]) ).
fof(f25,plain,
! [X0] :
( sP0
| ? [X4] :
! [X5] :
( ( ~ in(X5,X4)
| ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) )
& ( ! [X6] :
( ~ ordinal(X5)
| X5 != X6
| ~ in(X6,X0) )
| in(X5,X4) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f26,plain,
! [X0] :
( sP0
| ? [X1] :
! [X2] :
( ( ~ in(X2,X1)
| ? [X4] :
( ordinal(X2)
& X2 = X4
& in(X4,X0) ) )
& ( ! [X3] :
( ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0) )
| in(X2,X1) ) ) ),
inference(rectify,[],[f25]) ).
fof(f27,plain,
! [X0] :
( sP0
| ! [X2] :
( ( ~ in(X2,sK7(X0))
| ( ordinal(X2)
& sK8(X0,X2) = X2
& in(sK8(X0,X2),X0) ) )
& ( ! [X3] :
( ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0) )
| in(X2,sK7(X0)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X1,sK7(X0)),skolemize(X4,sK8(X0,X2))],[f26]) ).
fof(f28,plain,
! [X1] :
( in(sK2(X1),X1)
| ordinal(sK2(X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
! [X1] :
( in(sK2(X1),X1)
| in(sK2(X1),sK1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X1] :
( ~ in(sK2(X1),X1)
| ~ ordinal(sK2(X1))
| ~ in(sK2(X1),sK1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f43,plain,
! [X2,X0] :
( sP0
| ~ in(X2,sK7(X0))
| ordinal(X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X2,X0] :
( sP0
| ~ in(X2,sK7(X0))
| sK8(X0,X2) = X2 ),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X2,X0] :
( sP0
| ~ in(X2,sK7(X0))
| in(sK8(X0,X2),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f46,plain,
! [X2,X3,X0] :
( sP0
| ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0)
| in(X2,sK7(X0)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X3,X0] :
( sP0
| ~ ordinal(X3)
| ~ in(X3,X0)
| in(X3,sK7(X0)) ),
inference(equality_resolution,[],[f46]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ ordinal(sK2(X0))
| ~ in(sK2(X0),sK1)
| ~ in(sK2(X0),X0) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( in(sK2(X0),sK1)
| in(sK2(X0),X0) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( ordinal(sK2(X0))
| in(sK2(X0),X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( sP0
| in(X0,sK7(X1))
| ~ ordinal(X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( sP0
| in(sK8(X1,X0),X1)
| ~ in(X0,sK7(X1)) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( sP0
| ( sK8(X1,X0) = X0 )
| ~ in(X0,sK7(X1)) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( sP0
| ordinal(X0)
| ~ in(X0,sK7(X1)) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_1224,negated_conjecture,
! [X0: $i] :
( ordinal(sK2(X0))
| in(sK2(X0),X0) ),
inference(demodulation,[status(thm)],[c_51]) ).
tcf(c_1225,negated_conjecture,
! [X0: $i] :
( in(sK2(X0),sK1)
| in(sK2(X0),X0) ),
inference(demodulation,[status(thm)],[c_50]) ).
tcf(c_1226,negated_conjecture,
! [X0: $i] :
( ~ ordinal(sK2(X0))
| ~ in(sK2(X0),sK1)
| ~ in(sK2(X0),X0) ),
inference(demodulation,[status(thm)],[c_49]) ).
tcf(c_1229,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1533,plain,
! [X0: $i,X1: $i] :
( sP0
| ( sK8(X1,X0) = X0 )
| ~ ordinal(X0)
| ~ in(X0,X1) ),
inference(superposition,[status(thm)],[c_64,c_66]) ).
tcf(c_1633,plain,
! [X0: $i] :
( sP0
| in(sK2(X0),X0)
| ( sK8(sK1,sK2(X0)) = sK2(X0) )
| ~ ordinal(sK2(X0)) ),
inference(superposition,[status(thm)],[c_1225,c_1533]) ).
tcf(c_1666,plain,
! [X0: $i] :
( ( sK5 = sK6 )
| ( sK6 != X0 )
| ( sK5 != X0 ) ),
inference(instantiation,[status(thm)],[c_1229]) ).
tcf(c_1729,plain,
( ( sK5 = sK6 )
| ( sK6 != sK4 )
| ( sK5 != sK4 ) ),
inference(instantiation,[status(thm)],[c_1666]) ).
tcf(c_1868,plain,
! [X0: $i,X1: $i] :
( sP0
| ordinal(sK2(X0))
| ~ in(sK2(X0),sK7(X1)) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_1878,plain,
! [X0: $i,X1: $i] :
( sP0
| in(sK2(X0),sK7(X1))
| ~ ordinal(sK2(X0))
| ~ in(sK2(X0),X1) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_1913,plain,
! [X0: $i] :
( in(sK2(sK7(X0)),sK1)
| in(sK2(sK7(X0)),sK7(X0)) ),
inference(instantiation,[status(thm)],[c_1225]) ).
tcf(c_1914,plain,
! [X0: $i] :
( ordinal(sK2(sK7(X0)))
| in(sK2(sK7(X0)),sK7(X0)) ),
inference(instantiation,[status(thm)],[c_1224]) ).
tcf(c_2077,plain,
! [X0: $i] :
( ~ ordinal(sK2(sK7(X0)))
| ~ in(sK2(sK7(X0)),sK1)
| ~ in(sK2(sK7(X0)),sK7(X0)) ),
inference(instantiation,[status(thm)],[c_1226]) ).
tcf(c_2210,plain,
! [X0: $i,X1: $i] :
( sP0
| in(sK2(sK7(X0)),sK7(X1))
| ~ ordinal(sK2(sK7(X0)))
| ~ in(sK2(sK7(X0)),X1) ),
inference(instantiation,[status(thm)],[c_1878]) ).
tcf(c_2471,plain,
! [X0: $i] :
( sP0
| in(sK2(sK7(X0)),sK7(sK1))
| ~ ordinal(sK2(sK7(X0)))
| ~ in(sK2(sK7(X0)),sK1) ),
inference(instantiation,[status(thm)],[c_2210]) ).
tcf(c_2784,plain,
! [X0: $i] :
( sP0
| ordinal(sK2(sK7(X0)))
| ~ in(sK2(sK7(X0)),sK7(sK1)) ),
inference(instantiation,[status(thm)],[c_1868]) ).
tcf(c_2786,plain,
( sP0
| in(sK2(sK7(sK1)),sK7(sK1))
| ~ ordinal(sK2(sK7(sK1)))
| ~ in(sK2(sK7(sK1)),sK1) ),
inference(instantiation,[status(thm)],[c_2471]) ).
tcf(c_2787,plain,
( ~ ordinal(sK2(sK7(sK1)))
| ~ in(sK2(sK7(sK1)),sK1)
| ~ in(sK2(sK7(sK1)),sK7(sK1)) ),
inference(instantiation,[status(thm)],[c_2077]) ).
tcf(c_3114,plain,
( ordinal(sK2(sK7(sK1)))
| in(sK2(sK7(sK1)),sK7(sK1)) ),
inference(instantiation,[status(thm)],[c_1914]) ).
tcf(c_3126,plain,
( sP0
| ordinal(sK2(sK7(sK1)))
| ~ in(sK2(sK7(sK1)),sK7(sK1)) ),
inference(instantiation,[status(thm)],[c_2784]) ).
tcf(c_3139,plain,
( in(sK2(sK7(sK1)),sK1)
| in(sK2(sK7(sK1)),sK7(sK1)) ),
inference(instantiation,[status(thm)],[c_1913]) ).
fof(f16,definition,
( ~ sP0
| ? [X1,X2,X3] :
( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2
& X2 != X3 ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f17,plain,
! [X0] :
( sP0
| ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) ) ),
inference(definition_folding,[],[f15,f16]) ).
fof(f22,plain,
( ~ sP0
| ? [X1,X2,X3] :
( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2
& X2 != X3 ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f23,plain,
( ~ sP0
| ? [X0,X1,X2] :
( ordinal(X2)
& X0 = X2
& ordinal(X1)
& X0 = X1
& X1 != X2 ) ),
inference(rectify,[],[f22]) ).
fof(f24,plain,
( ~ sP0
| ( ordinal(sK6)
& sK4 = sK6
& ordinal(sK5)
& sK4 = sK5
& sK5 != sK6 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f23]) ).
fof(f39,plain,
( ~ sP0
| sK4 = sK6 ),
inference(cnf_transformation,[],[f24]) ).
fof(f40,plain,
( ~ sP0
| ordinal(sK5) ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
( ~ sP0
| sK4 = sK5 ),
inference(cnf_transformation,[],[f24]) ).
fof(f42,plain,
( ~ sP0
| sK5 != sK6 ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_59,plain,
( ~ sP0
| ( sK5 != sK6 ) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_60,plain,
( ( sK5 = sK4 )
| ~ sP0 ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_61,plain,
( ordinal(sK5)
| ~ sP0 ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_62,plain,
( ( sK6 = sK4 )
| ~ sP0 ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_1784,plain,
! [X0: $i] :
( ( sK8(sK1,sK2(X0)) = sK2(X0) )
| in(sK2(X0),X0) ),
inference(global_subsumption_just,[status(thm)],[c_1633,c_62,c_60,c_51,c_59,c_1633,c_1729]) ).
tcf(c_1785,plain,
! [X0: $i] :
( in(sK2(X0),X0)
| ( sK8(sK1,sK2(X0)) = sK2(X0) ) ),
inference(renaming,[status(thm)],[c_1784]) ).
tcf(c_1796,plain,
! [X0: $i] :
( sP0
| ( sK8(sK1,sK2(sK7(X0))) = sK2(sK7(X0)) )
| ( sK8(X0,sK2(sK7(X0))) = sK2(sK7(X0)) ) ),
inference(superposition,[status(thm)],[c_1785,c_66]) ).
tcf(c_1989,plain,
~ sP0,
inference(global_subsumption_just,[status(thm)],[c_61,c_62,c_60,c_59,c_1729]) ).
tcf(c_2007,plain,
! [X0: $i,X1: $i] :
( ~ in(X0,sK7(X1))
| ordinal(X0) ),
inference(global_subsumption_just,[status(thm)],[c_67,c_62,c_60,c_59,c_67,c_1729]) ).
tcf(c_2008,plain,
! [X0: $i,X1: $i] :
( ordinal(X0)
| ~ in(X0,sK7(X1)) ),
inference(renaming,[status(thm)],[c_2007]) ).
tcf(c_2014,plain,
! [X0: $i] : ordinal(sK2(sK7(X0))),
inference(superposition,[status(thm)],[c_1224,c_2008]) ).
tcf(c_2331,plain,
! [X0: $i,X1: $i] :
( ~ in(X0,X1)
| ~ ordinal(X0)
| in(X0,sK7(X1)) ),
inference(global_subsumption_just,[status(thm)],[c_64,c_62,c_60,c_59,c_64,c_1729]) ).
tcf(c_2332,plain,
! [X0: $i,X1: $i] :
( in(X0,sK7(X1))
| ~ ordinal(X0)
| ~ in(X0,X1) ),
inference(renaming,[status(thm)],[c_2331]) ).
tcf(c_2364,plain,
! [X0: $i,X1: $i] :
( ~ in(X0,sK7(X1))
| ( sK8(X1,X0) = X0 ) ),
inference(global_subsumption_just,[status(thm)],[c_66,c_62,c_60,c_59,c_66,c_1729]) ).
tcf(c_2365,plain,
! [X0: $i,X1: $i] :
( ( sK8(X1,X0) = X0 )
| ~ in(X0,sK7(X1)) ),
inference(renaming,[status(thm)],[c_2364]) ).
tcf(c_2371,plain,
! [X0: $i] :
( in(sK2(sK7(X0)),sK1)
| ( sK8(X0,sK2(sK7(X0))) = sK2(sK7(X0)) ) ),
inference(superposition,[status(thm)],[c_1225,c_2365]) ).
tcf(c_2373,plain,
! [X0: $i,X1: $i] :
( ( sK8(X1,X0) = X0 )
| ~ ordinal(X0)
| ~ in(X0,X1) ),
inference(superposition,[status(thm)],[c_2332,c_2365]) ).
tcf(c_2713,plain,
! [X0: $i] :
( ( sK8(sK1,sK2(sK7(X0))) = sK2(sK7(X0)) )
| ( sK8(X0,sK2(sK7(X0))) = sK2(sK7(X0)) )
| ~ ordinal(sK2(sK7(X0))) ),
inference(superposition,[status(thm)],[c_2371,c_2373]) ).
tcf(c_2726,plain,
! [X0: $i] :
( ( sK8(sK1,sK2(sK7(X0))) = sK2(sK7(X0)) )
| ( sK8(X0,sK2(sK7(X0))) = sK2(sK7(X0)) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2713,c_2014]) ).
tcf(c_3499,plain,
! [X0: $i] :
( ( sK8(X0,sK2(sK7(X0))) = sK2(sK7(X0)) )
| ( sK8(sK1,sK2(sK7(X0))) = sK2(sK7(X0)) ) ),
inference(global_subsumption_just,[status(thm)],[c_1796,c_2726]) ).
tcf(c_3500,plain,
! [X0: $i] :
( ( sK8(sK1,sK2(sK7(X0))) = sK2(sK7(X0)) )
| ( sK8(X0,sK2(sK7(X0))) = sK2(sK7(X0)) ) ),
inference(renaming,[status(thm)],[c_3499]) ).
tcf(c_3516,plain,
( ( sK8(sK1,sK2(sK7(sK1))) = sK2(sK7(sK1)) )
| ( sK2(sK7(sK1)) != sK2(sK7(sK1)) ) ),
inference(equality_factoring,[status(thm)],[c_3500]) ).
tcf(c_3518,plain,
sK8(sK1,sK2(sK7(sK1))) = sK2(sK7(sK1)),
inference(equality_resolution_simp,[status(thm)],[c_3516]) ).
tcf(c_3678,plain,
( sP0
| in(sK2(sK7(sK1)),sK1)
| ~ in(sK2(sK7(sK1)),sK7(sK1)) ),
inference(superposition,[status(thm)],[c_3518,c_65]) ).
tcf(c_3726,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3678,c_3139,c_3126,c_3114,c_2787,c_2786,c_1989]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU280+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n006.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 13:31:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 3.44/1.31 % SZS status Started for theBenchmark.p
% 3.44/1.31 % SZS status Theorem for theBenchmark.p
% 3.44/1.31
% 3.44/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.44/1.31
% 3.44/1.31 % ------ iProver source info
% 3.44/1.31
% 3.44/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.44/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.44/1.31 % git: non_committed_changes: false
% 3.44/1.31
% 3.44/1.31 % ------ Parsing...
% 3.44/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.44/1.31
% 3.44/1.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.44/1.31
% 3.44/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.44/1.31
% 3.44/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.44/1.31 % ------ Proving...
% 3.44/1.31 % ------ Problem Properties
% 3.44/1.31
% 3.44/1.31 %
% 3.44/1.31 % clauses 14
% 3.44/1.31 % conjectures 3
% 3.44/1.31 % EPR 7
% 3.44/1.31 % Horn 8
% 3.44/1.31 % unary 1
% 3.44/1.31 % binary 8
% 3.44/1.31 % lits 33
% 3.44/1.31 % lits eq 4
% 3.44/1.31 % fd_pure 0
% 3.44/1.31 % fd_pseudo 0
% 3.44/1.31 % fd_cond 0
% 3.44/1.31 % fd_pseudo_cond 0
% 3.44/1.31 % AC symbols 0
% 3.44/1.31
% 3.44/1.31 % ------ Schedule dynamic 5 is on
% 3.44/1.31
% 3.44/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.44/1.31
% 3.44/1.31
% 3.44/1.31 % ------
% 3.44/1.31 % Current options:
% 3.44/1.31 % ------
% 3.44/1.31
% 3.44/1.31
% 3.44/1.31 %
% 3.44/1.31
% 3.44/1.31 % ------ Proving...
% 3.44/1.31 %
% 3.44/1.31
% 3.44/1.31 % SZS status Theorem for theBenchmark.p
% 3.44/1.31
% 3.44/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.44/1.31
% 3.44/1.31
%------------------------------------------------------------------------------