%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU212+2 : 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 : n014.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:55 PM UTC 2026
% Result : Theorem 4.20s 1.32s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 71 ( 15 unt; 0 def)
% Number of atoms : 245 ( 67 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 288 ( 114 ~; 116 |; 39 &)
% ( 10 <=>; 7 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 126 ( 0 sgn 106 !; 20 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f14,axiom,
! [X0] :
( relation(X0)
<=> ! [X1] :
~ ( ! [X2,X3] : X1 != ordered_pair(X2,X3)
& in(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_1) ).
fof(f27,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1,X2] :
( ( ~ in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> X2 = empty_set ) )
& ( in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f34,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(f147,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(ordered_pair(X0,X1),X2)
=> ( in(X1,relation_rng(X2))
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_relat_1) ).
fof(f195,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f206,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( X1 = apply(X2,X0)
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_funct_1) ).
fof(f207,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( X1 = apply(X2,X0)
& in(X0,relation_dom(X2)) ) ) ),
inference(negated_conjecture,[status(cth)],[f206]) ).
fof(f239,plain,
! [X0] :
( relation(X0)
<=> ! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f245,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ! [X1,X2] :
( ( in(X1,relation_dom(X0))
| ( X2 = apply(X0,X1)
<=> X2 = empty_set ) )
& ( ~ in(X1,relation_dom(X0))
| ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) ) ) ) ),
inference(ennf_transformation,[],[f27]) ).
fof(f246,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ! [X1,X2] :
( ( in(X1,relation_dom(X0))
| ( X2 = apply(X0,X1)
<=> X2 = empty_set ) )
& ( ~ in(X1,relation_dom(X0))
| ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) ) ) ) ),
inference(flattening,[],[f245]) ).
fof(f331,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ~ in(ordered_pair(X0,X1),X2)
| ( in(X1,relation_rng(X2))
& in(X0,relation_dom(X2)) ) ),
inference(ennf_transformation,[],[f147]) ).
fof(f332,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ~ in(ordered_pair(X0,X1),X2)
| ( in(X1,relation_rng(X2))
& in(X0,relation_dom(X2)) ) ),
inference(flattening,[],[f331]) ).
fof(f386,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& ( in(ordered_pair(X0,X1),X2)
<~> ( X1 = apply(X2,X0)
& in(X0,relation_dom(X2)) ) ) ),
inference(ennf_transformation,[],[f207]) ).
fof(f387,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& ( in(ordered_pair(X0,X1),X2)
<~> ( X1 = apply(X2,X0)
& in(X0,relation_dom(X2)) ) ) ),
inference(flattening,[],[f386]) ).
fof(f418,plain,
! [X0] :
( ( ~ relation(X0)
| ! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
| ~ in(X1,X0) ) )
& ( ? [X1] :
( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) )
| relation(X0) ) ),
inference(nnf_transformation,[],[f239]) ).
fof(f419,plain,
! [X0] :
( ( ~ relation(X0)
| ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X0) ) )
& ( ? [X1] :
( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) )
| relation(X0) ) ),
inference(rectify,[],[f418]) ).
fof(f420,plain,
! [X0] :
( ( ~ relation(X0)
| ! [X4] :
( ordered_pair(sK13(X4),sK14(X4)) = X4
| ~ in(X4,X0) ) )
& ( ( ! [X2,X3] : ordered_pair(X2,X3) != sK12(X0)
& in(sK12(X0),X0) )
| relation(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14]),skolemize(X1,sK12(X0)),skolemize(X5,sK13(X4)),skolemize(X6,sK14(X4))],[f419]) ).
fof(f458,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ! [X1,X2] :
( ( in(X1,relation_dom(X0))
| ( ( apply(X0,X1) != X2
| X2 = empty_set )
& ( empty_set != X2
| X2 = apply(X0,X1) ) ) )
& ( ~ in(X1,relation_dom(X0))
| ( ( apply(X0,X1) != X2
| in(ordered_pair(X1,X2),X0) )
& ( ~ in(ordered_pair(X1,X2),X0)
| X2 = apply(X0,X1) ) ) ) ) ),
inference(nnf_transformation,[],[f246]) ).
fof(f530,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& ( in(ordered_pair(X0,X1),X2)
| ( X1 = apply(X2,X0)
& in(X0,relation_dom(X2)) ) )
& ( ~ in(ordered_pair(X0,X1),X2)
| apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2)) ) ),
inference(nnf_transformation,[],[f387]) ).
fof(f531,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& ( in(ordered_pair(X0,X1),X2)
| ( X1 = apply(X2,X0)
& in(X0,relation_dom(X2)) ) )
& ( ~ in(ordered_pair(X0,X1),X2)
| apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2)) ) ),
inference(flattening,[],[f530]) ).
fof(f532,plain,
( function(sK71)
& relation(sK71)
& ( in(ordered_pair(sK69,sK70),sK71)
| ( sK70 = apply(sK71,sK69)
& in(sK69,relation_dom(sK71)) ) )
& ( ~ in(ordered_pair(sK69,sK70),sK71)
| sK70 != apply(sK71,sK69)
| ~ in(sK69,relation_dom(sK71)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK69,sK70,sK71]),skolemize(X0,sK69),skolemize(X1,sK70),skolemize(X2,sK71)],[f531]) ).
fof(f538,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f574,plain,
! [X0,X4] :
( ~ relation(X0)
| ordered_pair(sK13(X4),sK14(X4)) = X4
| ~ in(X4,X0) ),
inference(cnf_transformation,[],[f420]) ).
fof(f637,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| apply(X0,X1) != X2
| in(ordered_pair(X1,X2),X0) ),
inference(cnf_transformation,[],[f458]) ).
fof(f638,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| ~ in(ordered_pair(X1,X2),X0)
| apply(X0,X1) = X2 ),
inference(cnf_transformation,[],[f458]) ).
fof(f661,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f34]) ).
fof(f801,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(ordered_pair(X0,X1),X2)
| in(X0,relation_dom(X2)) ),
inference(cnf_transformation,[],[f332]) ).
fof(f869,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f195]) ).
fof(f886,plain,
function(sK71),
inference(cnf_transformation,[],[f532]) ).
fof(f887,plain,
relation(sK71),
inference(cnf_transformation,[],[f532]) ).
fof(f888,plain,
( in(ordered_pair(sK69,sK70),sK71)
| sK70 = apply(sK71,sK69) ),
inference(cnf_transformation,[],[f532]) ).
fof(f889,plain,
( in(ordered_pair(sK69,sK70),sK71)
| in(sK69,relation_dom(sK71)) ),
inference(cnf_transformation,[],[f532]) ).
fof(f890,plain,
( ~ in(ordered_pair(sK69,sK70),sK71)
| sK70 != apply(sK71,sK69)
| ~ in(sK69,relation_dom(sK71)) ),
inference(cnf_transformation,[],[f532]) ).
fof(f903,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f661,f869]) ).
fof(f932,plain,
! [X0,X4] :
( ~ relation(X0)
| unordered_pair(unordered_pair(sK13(X4),sK14(X4)),unordered_pair(sK13(X4),sK13(X4))) = X4
| ~ in(X4,X0) ),
inference(definition_unfolding,[],[f574,f903]) ).
fof(f954,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X0)
| apply(X0,X1) = X2 ),
inference(definition_unfolding,[],[f638,f903]) ).
fof(f955,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| apply(X0,X1) != X2
| in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X0) ),
inference(definition_unfolding,[],[f637,f903]) ).
fof(f1005,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2)
| in(X0,relation_dom(X2)) ),
inference(definition_unfolding,[],[f801,f903]) ).
fof(f1029,plain,
( ~ in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71)
| sK70 != apply(sK71,sK69)
| ~ in(sK69,relation_dom(sK71)) ),
inference(definition_unfolding,[],[f890,f903]) ).
fof(f1030,plain,
( in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71)
| in(sK69,relation_dom(sK71)) ),
inference(definition_unfolding,[],[f889,f903]) ).
fof(f1031,plain,
( in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71)
| sK70 = apply(sK71,sK69) ),
inference(definition_unfolding,[],[f888,f903]) ).
fof(f1084,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| in(unordered_pair(unordered_pair(X1,apply(X0,X1)),unordered_pair(X1,X1)),X0) ),
inference(equality_resolution,[],[f955]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f538]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i] :
( ( unordered_pair(unordered_pair(sK13(X0),sK14(X0)),unordered_pair(sK13(X0),sK13(X0))) = X0 )
| ~ relation(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f932]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(X2,X0) = X1 )
| ~ relation(X2)
| ~ function(X2)
| ~ in(X0,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2) ),
inference(cnf_transformation,[],[f954]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(unordered_pair(X0,apply(X1,X0)),unordered_pair(X0,X0)),X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X0,relation_dom(X1)) ),
inference(cnf_transformation,[],[f1084]) ).
tcf(c_314,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2) ),
inference(cnf_transformation,[],[f1005]) ).
tcf(c_398,negated_conjecture,
( ~ in(sK69,relation_dom(sK71))
| ~ in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71)
| ( apply(sK71,sK69) != sK70 ) ),
inference(cnf_transformation,[],[f1029]) ).
tcf(c_399,negated_conjecture,
( in(sK69,relation_dom(sK71))
| in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71) ),
inference(cnf_transformation,[],[f1030]) ).
tcf(c_400,negated_conjecture,
( in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71)
| ( apply(sK71,sK69) = sK70 ) ),
inference(cnf_transformation,[],[f1031]) ).
tcf(c_401,negated_conjecture,
relation(sK71),
inference(cnf_transformation,[],[f887]) ).
tcf(c_402,negated_conjecture,
function(sK71),
inference(cnf_transformation,[],[f886]) ).
tcf(c_532,plain,
( in(sK69,relation_dom(sK71))
| in(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)),sK71) ),
inference(demodulation,[status(thm)],[c_399,c_53]) ).
tcf(c_570,plain,
( in(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)),sK71)
| ( apply(sK71,sK69) = sK70 ) ),
inference(demodulation,[status(thm)],[c_400,c_53]) ).
tcf(c_620,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,X1)),X2) ),
inference(superposition,[status(thm)],[c_53,c_314]) ).
tcf(c_730,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(X2,X0) = X1 )
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2) ),
inference(global_subsumption_just,[status(thm)],[c_150,c_314,c_150]) ).
tcf(c_744,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(X2,X0) = X1 )
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,X1)),X2) ),
inference(superposition,[status(thm)],[c_53,c_730]) ).
tcf(c_860,plain,
( in(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)),sK71)
| ( apply(sK71,sK69) = sK70 ) ),
inference(demodulation,[status(thm)],[c_400,c_53]) ).
tcf(c_1005,plain,
( in(sK69,relation_dom(sK71))
| ~ relation(sK71) ),
inference(superposition,[status(thm)],[c_532,c_620]) ).
tcf(c_1100,plain,
! [X0: $i,X1: $i] :
( ( unordered_pair(unordered_pair(sK13(X0),sK13(X0)),unordered_pair(sK13(X0),sK14(X0))) = X0 )
| ~ relation(X1)
| ~ in(X0,X1) ),
inference(demodulation,[status(thm)],[c_91,c_53]) ).
tcf(c_1110,plain,
( ( apply(sK71,sK69) = sK70 )
| ( unordered_pair(unordered_pair(sK13(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70))),sK13(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)))),unordered_pair(sK13(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70))),sK14(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70))))) = unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)) )
| ~ relation(sK71) ),
inference(superposition,[status(thm)],[c_860,c_1100]) ).
tcf(c_1141,plain,
( ( apply(sK71,sK69) != sK70 )
| ~ in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71) ),
inference(global_subsumption_just,[status(thm)],[c_398,c_401,c_398,c_1005]) ).
tcf(c_1142,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(sK69,sK70),unordered_pair(sK69,sK69)),sK71)
| ( apply(sK71,sK69) != sK70 ) ),
inference(renaming,[status(thm)],[c_1141]) ).
tcf(c_1145,plain,
( ~ in(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)),sK71)
| ( apply(sK71,sK69) != sK70 ) ),
inference(demodulation,[status(thm)],[c_1142,c_53]) ).
tcf(c_1176,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,apply(X1,X0))),X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X0,relation_dom(X1)) ),
inference(demodulation,[status(thm)],[c_151,c_53]) ).
tcf(c_1645,plain,
( ( apply(sK71,sK69) = sK70 )
| ~ relation(sK71)
| ~ function(sK71) ),
inference(superposition,[status(thm)],[c_570,c_744]) ).
tcf(c_2029,plain,
apply(sK71,sK69) = sK70,
inference(global_subsumption_just,[status(thm)],[c_1110,c_402,c_401,c_1645]) ).
tcf(c_2031,plain,
( in(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)),sK71)
| ~ relation(sK71)
| ~ function(sK71)
| ~ in(sK69,relation_dom(sK71)) ),
inference(superposition,[status(thm)],[c_2029,c_1176]) ).
tcf(c_2032,plain,
~ in(unordered_pair(unordered_pair(sK69,sK69),unordered_pair(sK69,sK70)),sK71),
inference(superposition,[status(thm)],[c_2029,c_1145]) ).
tcf(c_2034,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2031,c_2032,c_1005,c_401,c_402]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU212+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n014.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 13:12:03 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 4.20/1.32 % SZS status Started for theBenchmark.p
% 4.20/1.32 % SZS status Theorem for theBenchmark.p
% 4.20/1.32
% 4.20/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.20/1.32
% 4.20/1.32 % ------ iProver source info
% 4.20/1.32
% 4.20/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.20/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.20/1.32 % git: non_committed_changes: false
% 4.20/1.32
% 4.20/1.32 % ------ Parsing...
% 4.20/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.20/1.32 % ------ Proving...
% 4.20/1.32 % ------ Problem Properties
% 4.20/1.32
% 4.20/1.32 %
% 4.20/1.32 % clauses 366
% 4.20/1.32 % conjectures 5
% 4.20/1.32 % EPR 44
% 4.20/1.32 % Horn 296
% 4.20/1.32 % unary 64
% 4.20/1.32 % binary 117
% 4.20/1.32 % lits 966
% 4.20/1.32 % lits eq 180
% 4.20/1.32 % fd_pure 0
% 4.20/1.32 % fd_pseudo 0
% 4.20/1.32 % fd_cond 14
% 4.20/1.32 % fd_pseudo_cond 70
% 4.20/1.32 % AC symbols 0
% 4.20/1.32
% 4.20/1.32 % ------ Input Options Time Limit: Unbounded
% 4.20/1.32
% 4.20/1.32
% 4.20/1.32 % ------
% 4.20/1.32 % Current options:
% 4.20/1.32 % ------
% 4.20/1.32
% 4.20/1.32
% 4.20/1.32 %
% 4.20/1.32
% 4.20/1.32 % ------ Proving...
% 4.20/1.32 %
% 4.20/1.32
% 4.20/1.32 % SZS status Theorem for theBenchmark.p
% 4.20/1.32
% 4.20/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.20/1.33
% 4.20/1.33
%------------------------------------------------------------------------------