%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU157+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 : n003.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:39 PM UTC 2026
% Result : Theorem 1.33s 1.17s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 77 ( 17 unt; 4 def)
% Number of atoms : 253 ( 77 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 244 ( 99 ~; 105 |; 34 &)
% ( 4 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 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 : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 181 ( 0 sgn 157 !; 24 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,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(f4,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f10,conjecture,
! [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(f11,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f14,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(f16,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<~> ( in(X1,X3)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| ( X1 = X3
& X0 = X2 ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,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,[],[f3]) ).
fof(f19,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,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) != X2
| ! [X8] :
( ( ~ in(X8,X2)
| ( ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8
& in(sK4(X0,X1,X8),X1)
& in(sK3(X0,X1,X8),X0) ) )
& ( ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) )
| in(X8,X2) ) ) )
& ( ( ( in(sK0(X0,X1,X2),X2)
| ( sK0(X0,X1,X2) = ordered_pair(sK1(X0,X1,X2),sK2(X0,X1,X2))
& in(sK2(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) ) )
& ( ~ in(sK0(X0,X1,X2),X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != sK0(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) ) ) )
| X2 = cartesian_product2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X3,sK0(X0,X1,X2)),skolemize(X6,sK1(X0,X1,X2)),skolemize(X7,sK2(X0,X1,X2)),skolemize(X11,sK3(X0,X1,X8)),skolemize(X12,sK4(X0,X1,X8))],[f19]) ).
fof(f21,plain,
? [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ( in(X1,X3)
& in(X0,X2) ) )
& ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f22,plain,
? [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ( in(X1,X3)
& in(X0,X2) ) )
& ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
( ( in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8))
| ( in(sK6,sK8)
& in(sK5,sK7) ) )
& ( ~ in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8))
| ~ in(sK6,sK8)
| ~ in(sK5,sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7),skolemize(X3,sK8)],[f22]) ).
fof(f27,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f28,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8 ),
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| in(sK4(X0,X1,X8),X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| in(sK3(X0,X1,X8),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f31,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,[],[f20]) ).
fof(f36,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f38,plain,
( in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8))
| in(sK6,sK8) ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
( in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8))
| in(sK5,sK7) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
( ~ in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8))
| ~ in(sK6,sK8)
| ~ in(sK5,sK7) ),
inference(cnf_transformation,[],[f23]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X1 = X3 ),
inference(cnf_transformation,[],[f17]) ).
fof(f44,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X0 = X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f47,plain,
! [X2,X10,X0,X1,X8,X9] :
( cartesian_product2(X0,X1) != X2
| unordered_pair(unordered_pair(X9,X10),singleton(X9)) != X8
| ~ in(X10,X1)
| ~ in(X9,X0)
| in(X8,X2) ),
inference(definition_unfolding,[],[f31,f36]) ).
fof(f48,plain,
! [X2,X0,X1,X8] :
( cartesian_product2(X0,X1) != X2
| ~ in(X8,X2)
| unordered_pair(unordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)),singleton(sK3(X0,X1,X8))) = X8 ),
inference(definition_unfolding,[],[f28,f36]) ).
fof(f50,plain,
( ~ in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8))
| ~ in(sK6,sK8)
| ~ in(sK5,sK7) ),
inference(definition_unfolding,[],[f40,f36]) ).
fof(f51,plain,
( in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8))
| in(sK5,sK7) ),
inference(definition_unfolding,[],[f39,f36]) ).
fof(f52,plain,
( in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8))
| in(sK6,sK8) ),
inference(definition_unfolding,[],[f38,f36]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2))
| X0 = X2 ),
inference(definition_unfolding,[],[f44,f36,f36]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2))
| X1 = X3 ),
inference(definition_unfolding,[],[f43,f36,f36]) ).
fof(f55,plain,
! [X2,X10,X0,X1,X9] :
( cartesian_product2(X0,X1) != X2
| ~ in(X10,X1)
| ~ in(X9,X0)
| in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),X2) ),
inference(equality_resolution,[],[f47]) ).
fof(f56,plain,
! [X10,X0,X1,X9] :
( ~ in(X10,X1)
| ~ in(X9,X0)
| in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f55]) ).
fof(f57,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| in(sK3(X0,X1,X8),X0) ),
inference(equality_resolution,[],[f30]) ).
fof(f58,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| in(sK4(X0,X1,X8),X1) ),
inference(equality_resolution,[],[f29]) ).
fof(f59,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| unordered_pair(unordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)),singleton(sK3(X0,X1,X8))) = X8 ),
inference(equality_resolution,[],[f48]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f27]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),cartesian_product2(X1,X3))
| ~ in(X2,X3)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK3(X1,X2,X0),X1)
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(sK4(X1,X2,X0),X2)
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( unordered_pair(unordered_pair(sK3(X1,X2,X0),sK4(X1,X2,X0)),singleton(sK3(X1,X2,X0))) = X0 )
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_60,negated_conjecture,
( ~ in(sK6,sK8)
| ~ in(sK5,sK7)
| ~ in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_61,negated_conjecture,
( in(sK5,sK7)
| in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_62,negated_conjecture,
( in(sK6,sK8)
| in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2)) ) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X3 )
| ( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2)) ) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_135,plain,
( ~ in(sK6,sK8)
| ~ in(sK5,sK7) ),
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_55]) ).
tcf(c_171,plain,
( in(sK6,sK8)
| in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8)) ),
inference(demodulation,[status(thm)],[c_62,c_50]) ).
tcf(c_178,plain,
( in(sK5,sK7)
| in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8)) ),
inference(demodulation,[status(thm)],[c_61,c_50]) ).
tcf(c_207,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X3 )
| ( unordered_pair(singleton(X0),unordered_pair(X0,X1)) != unordered_pair(singleton(X2),unordered_pair(X2,X3)) ) ),
inference(demodulation,[status(thm)],[c_66,c_50]) ).
tcf(c_214,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ( unordered_pair(singleton(X0),unordered_pair(X0,X1)) != unordered_pair(singleton(X2),unordered_pair(X2,X3)) ) ),
inference(demodulation,[status(thm)],[c_65,c_50]) ).
tcf(c_221,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( unordered_pair(singleton(sK3(X1,X2,X0)),unordered_pair(sK3(X1,X2,X0),sK4(X1,X2,X0))) = X0 )
| ~ in(X0,cartesian_product2(X1,X2)) ),
inference(demodulation,[status(thm)],[c_58,c_50]) ).
tcf(c_277,definition,
iPr_def_10 = singleton(sK5),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_278,definition,
iPr_def_11 = unordered_pair(sK5,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_279,definition,
iPr_def_12 = unordered_pair(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_280,definition,
iPr_def_13 = cartesian_product2(sK7,sK8),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_281,plain,
( in(iPr_def_12,iPr_def_13)
| in(sK5,sK7) ),
inference(demodulation,[status(thm)],[c_178,c_280,c_278,c_277,c_279]) ).
tcf(c_282,plain,
( in(iPr_def_12,iPr_def_13)
| in(sK6,sK8) ),
inference(demodulation,[status(thm)],[c_171]) ).
tcf(c_283,plain,
( ~ in(sK6,sK8)
| ~ in(sK5,sK7) ),
inference(demodulation,[status(thm)],[c_135]) ).
tcf(c_296,plain,
in(iPr_def_12,iPr_def_13),
inference(global_subsumption_just,[status(thm)],[c_281,c_135,c_281,c_282]) ).
tcf(c_538,plain,
in(iPr_def_12,iPr_def_13),
inference(global_subsumption_just,[status(thm)],[c_281,c_296]) ).
tcf(c_701,plain,
! [X0: $i,X1: $i] :
( ( X1 = sK6 )
| ( unordered_pair(singleton(X0),unordered_pair(X0,X1)) != unordered_pair(singleton(sK5),iPr_def_11) ) ),
inference(superposition,[status(thm)],[c_278,c_207]) ).
tcf(c_706,plain,
! [X0: $i,X1: $i] :
( ( X1 = sK6 )
| ( unordered_pair(singleton(X0),unordered_pair(X0,X1)) != iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_701,c_277,c_279]) ).
tcf(c_732,plain,
! [X0: $i,X1: $i] :
( ( X0 = sK5 )
| ( unordered_pair(singleton(X0),unordered_pair(X0,X1)) != unordered_pair(singleton(sK5),iPr_def_11) ) ),
inference(superposition,[status(thm)],[c_278,c_214]) ).
tcf(c_737,plain,
! [X0: $i,X1: $i] :
( ( X0 = sK5 )
| ( unordered_pair(singleton(X0),unordered_pair(X0,X1)) != iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_732,c_277,c_279]) ).
tcf(c_910,plain,
! [X0: $i] :
( ( unordered_pair(singleton(sK3(sK7,sK8,X0)),unordered_pair(sK3(sK7,sK8,X0),sK4(sK7,sK8,X0))) = X0 )
| ~ in(X0,iPr_def_13) ),
inference(superposition,[status(thm)],[c_280,c_221]) ).
tcf(c_2756,plain,
unordered_pair(singleton(sK3(sK7,sK8,iPr_def_12)),unordered_pair(sK3(sK7,sK8,iPr_def_12),sK4(sK7,sK8,iPr_def_12))) = iPr_def_12,
inference(superposition,[status(thm)],[c_538,c_910]) ).
tcf(c_2885,plain,
sK3(sK7,sK8,iPr_def_12) = sK5,
inference(superposition,[status(thm)],[c_2756,c_737]) ).
tcf(c_2886,plain,
sK4(sK7,sK8,iPr_def_12) = sK6,
inference(superposition,[status(thm)],[c_2756,c_706]) ).
tcf(c_3322,plain,
( in(sK5,sK7)
| ~ in(iPr_def_12,cartesian_product2(sK7,sK8)) ),
inference(superposition,[status(thm)],[c_2885,c_56]) ).
tcf(c_3324,plain,
( in(sK5,sK7)
| ~ in(iPr_def_12,iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_3322,c_280]) ).
tcf(c_3325,plain,
in(sK5,sK7),
inference(forward_subsumption_resolution,[status(thm)],[c_3324,c_538]) ).
tcf(c_3332,plain,
~ in(sK6,sK8),
inference(backward_subsumption_resolution,[status(thm)],[c_283,c_3325]) ).
tcf(c_3344,plain,
( in(sK6,sK8)
| ~ in(iPr_def_12,cartesian_product2(sK7,sK8)) ),
inference(superposition,[status(thm)],[c_2886,c_57]) ).
tcf(c_3346,plain,
( in(sK6,sK8)
| ~ in(iPr_def_12,iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_3344,c_280]) ).
tcf(c_3347,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3346,c_3332,c_538]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU157+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 : n003.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.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Thu Sep 24 13:00:36 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/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.03/0.41
% 0.03/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41
% 0.03/0.41 % Detected problem language: tptp
% 0.03/0.42 % Proving...
% 1.33/1.17 % SZS status Started for theBenchmark.p
% 1.33/1.17 % SZS status Theorem for theBenchmark.p
% 1.33/1.17
% 1.33/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.33/1.17
% 1.33/1.17 % ------ iProver source info
% 1.33/1.17
% 1.33/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.33/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.33/1.17 % git: non_committed_changes: false
% 1.33/1.17
% 1.33/1.17 % ------ Parsing...
% 1.33/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.33/1.17
% 1.33/1.17 % ------ Preprocessing... sup_sim: 9 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.33/1.17
% 1.33/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.33/1.17
% 1.33/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.33/1.17 % ------ Proving...
% 1.33/1.17 % ------ Problem Properties
% 1.33/1.17
% 1.33/1.17 %
% 1.33/1.17 % clauses 22
% 1.33/1.17 % conjectures 0
% 1.33/1.17 % EPR 6
% 1.33/1.17 % Horn 17
% 1.33/1.17 % unary 8
% 1.33/1.17 % binary 9
% 1.33/1.17 % lits 43
% 1.33/1.17 % lits eq 16
% 1.33/1.17 % fd_pure 0
% 1.33/1.17 % fd_pseudo 0
% 1.33/1.17 % fd_cond 0
% 1.33/1.17 % fd_pseudo_cond 6
% 1.33/1.17 % AC symbols 0
% 1.33/1.17
% 1.33/1.17 % ------ Schedule dynamic 5 is on
% 1.33/1.17
% 1.33/1.17 % ------ no conjectures: strip conj schedule
% 1.33/1.17
% 1.33/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.33/1.17
% 1.33/1.17
% 1.33/1.17 % ------
% 1.33/1.17 % Current options:
% 1.33/1.17 % ------
% 1.33/1.17
% 1.33/1.17
% 1.33/1.17 %
% 1.33/1.17
% 1.33/1.17 % ------ Proving...
% 1.33/1.17 %
% 1.33/1.17
% 1.33/1.17 % SZS status Theorem for theBenchmark.p
% 1.33/1.17
% 1.33/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.33/1.17
% 1.33/1.17
%------------------------------------------------------------------------------