%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU225+3 : 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 : n007.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:12 PM UTC 2026
% Result : Theorem 4.30s 1.29s
% Output : CNFRefutation 4.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 9 unt; 0 def)
% Number of atoms : 296 ( 77 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 386 ( 154 ~; 155 |; 51 &)
% ( 12 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn 124 !; 9 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,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(f9,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f12,axiom,
! [X0,X1] :
( ( relation_empty_yielding(X0)
& relation(X0) )
=> ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc13_relat_1) ).
fof(f19,axiom,
! [X0,X1] :
( ( function(X0)
& relation(X0) )
=> ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l82_funct_1) ).
fof(f42,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( X1 = relation_dom_restriction(X2,X0)
<=> ( ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_funct_1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f58,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,[],[f7]) ).
fof(f59,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,[],[f58]) ).
fof(f60,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f61,plain,
! [X0,X1] :
( ~ relation_empty_yielding(X0)
| ~ relation(X0)
| ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f62,plain,
! [X0,X1] :
( ~ relation_empty_yielding(X0)
| ~ relation(X0)
| ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
inference(flattening,[],[f61]) ).
fof(f65,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f66,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
inference(flattening,[],[f65]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ function(X2)
| ~ relation(X2)
| ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ function(X2)
| ~ relation(X2)
| ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) ) ),
inference(flattening,[],[f70]) ).
fof(f80,plain,
! [X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ! [X2] :
( ~ function(X2)
| ~ relation(X2)
| ( X1 = relation_dom_restriction(X2,X0)
<=> ( ! [X3] :
( ~ in(X3,relation_dom(X1))
| apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f81,plain,
! [X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ! [X2] :
( ~ function(X2)
| ~ relation(X2)
| ( X1 = relation_dom_restriction(X2,X0)
<=> ( ! [X3] :
( ~ in(X3,relation_dom(X1))
| apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
inference(flattening,[],[f80]) ).
fof(f83,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& in(X1,X0)
& apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1) ),
inference(ennf_transformation,[],[f45]) ).
fof(f84,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& in(X1,X0)
& apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1) ),
inference(flattening,[],[f83]) ).
fof(f87,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,[],[f59]) ).
fof(f89,plain,
! [X0,X1,X2] :
( ~ function(X2)
| ~ relation(X2)
| ( ( ~ in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ( in(X1,X0)
& in(X1,relation_dom(X2)) ) )
& ( ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) ) ),
inference(nnf_transformation,[],[f71]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ function(X2)
| ~ relation(X2)
| ( ( ~ in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ( in(X1,X0)
& in(X1,relation_dom(X2)) ) )
& ( ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) ) ),
inference(flattening,[],[f89]) ).
fof(f101,plain,
! [X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ! [X2] :
( ~ function(X2)
| ~ relation(X2)
| ( ( relation_dom_restriction(X2,X0) != X1
| ( ! [X3] :
( ~ in(X3,relation_dom(X1))
| apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
& ( ? [X3] :
( in(X3,relation_dom(X1))
& apply(X1,X3) != apply(X2,X3) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| X1 = relation_dom_restriction(X2,X0) ) ) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f102,plain,
! [X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ! [X2] :
( ~ function(X2)
| ~ relation(X2)
| ( ( relation_dom_restriction(X2,X0) != X1
| ( ! [X3] :
( ~ in(X3,relation_dom(X1))
| apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
& ( ? [X3] :
( in(X3,relation_dom(X1))
& apply(X1,X3) != apply(X2,X3) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| X1 = relation_dom_restriction(X2,X0) ) ) ) ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
! [X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ! [X2] :
( ~ function(X2)
| ~ relation(X2)
| ( ( relation_dom_restriction(X2,X0) != X1
| ( ! [X4] :
( ~ in(X4,relation_dom(X1))
| apply(X1,X4) = apply(X2,X4) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
& ( ? [X3] :
( in(X3,relation_dom(X1))
& apply(X1,X3) != apply(X2,X3) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| X1 = relation_dom_restriction(X2,X0) ) ) ) ),
inference(rectify,[],[f102]) ).
fof(f104,plain,
! [X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ! [X2] :
( ~ function(X2)
| ~ relation(X2)
| ( ( relation_dom_restriction(X2,X0) != X1
| ( ! [X4] :
( ~ in(X4,relation_dom(X1))
| apply(X1,X4) = apply(X2,X4) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
& ( ( in(sK11(X1,X2),relation_dom(X1))
& apply(X1,sK11(X1,X2)) != apply(X2,sK11(X1,X2)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| X1 = relation_dom_restriction(X2,X0) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X1,X2))],[f103]) ).
fof(f105,plain,
( function(sK14)
& relation(sK14)
& in(sK13,sK12)
& apply(relation_dom_restriction(sK14,sK12),sK13) != apply(sK14,sK13) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14]),skolemize(X0,sK12),skolemize(X1,sK13),skolemize(X2,sK14)],[f84]) ).
fof(f113,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| in(X1,relation_dom(X0))
| apply(X0,X1) != X2
| empty_set = X2 ),
inference(cnf_transformation,[],[f87]) ).
fof(f118,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f124,plain,
! [X0,X1] :
( ~ relation_empty_yielding(X0)
| ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f131,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| function(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f66]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ function(X2)
| ~ relation(X2)
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| in(X1,relation_dom(relation_dom_restriction(X2,X0))) ),
inference(cnf_transformation,[],[f90]) ).
fof(f168,plain,
! [X2,X0,X1,X4] :
( ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| relation_dom_restriction(X2,X0) != X1
| ~ in(X4,relation_dom(X1))
| apply(X1,X4) = apply(X2,X4) ),
inference(cnf_transformation,[],[f104]) ).
fof(f173,plain,
function(sK14),
inference(cnf_transformation,[],[f105]) ).
fof(f174,plain,
relation(sK14),
inference(cnf_transformation,[],[f105]) ).
fof(f175,plain,
in(sK13,sK12),
inference(cnf_transformation,[],[f105]) ).
fof(f176,plain,
apply(relation_dom_restriction(sK14,sK12),sK13) != apply(sK14,sK13),
inference(cnf_transformation,[],[f105]) ).
fof(f184,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| in(X1,relation_dom(X0))
| apply(X0,X1) = empty_set ),
inference(equality_resolution,[],[f113]) ).
fof(f186,plain,
! [X2,X0,X4] :
( ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4) ),
inference(equality_resolution,[],[f168]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( in(X1,relation_dom(X0))
| ( apply(X0,X1) = empty_set )
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( function(relation_dom_restriction(X0,X1))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X0,X2)
| ~ in(X0,relation_dom(X1)) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) )
| ~ relation(X1)
| ~ function(X1)
| ~ relation(relation_dom_restriction(X1,X2))
| ~ function(relation_dom_restriction(X1,X2))
| ~ in(X0,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_113,negated_conjecture,
apply(relation_dom_restriction(sK14,sK12),sK13) != apply(sK14,sK13),
inference(cnf_transformation,[],[f176]) ).
tcf(c_114,negated_conjecture,
in(sK13,sK12),
inference(cnf_transformation,[],[f175]) ).
tcf(c_115,negated_conjecture,
relation(sK14),
inference(cnf_transformation,[],[f174]) ).
tcf(c_116,negated_conjecture,
function(sK14),
inference(cnf_transformation,[],[f173]) ).
tcf(c_155,plain,
! [X0: $i,X1: $i] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(global_subsumption_just,[status(thm)],[c_63,c_58]) ).
tcf(c_266,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) )
| ~ relation(X1)
| ~ function(X1)
| ~ function(relation_dom_restriction(X1,X2))
| ~ in(X0,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_111,c_155]) ).
tcf(c_306,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) )
| ~ relation(X1)
| ~ function(X1)
| ~ in(X0,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_266,c_72]) ).
tcf(c_702,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1345,plain,
( ( apply(relation_dom_restriction(sK14,sK12),sK13) = apply(sK14,sK13) )
| ~ relation(sK14)
| ~ function(sK14)
| ~ in(sK13,relation_dom(relation_dom_restriction(sK14,sK12))) ),
inference(instantiation,[status(thm)],[c_306]) ).
tcf(c_1347,plain,
! [X0: $i] :
( ( apply(relation_dom_restriction(sK14,sK12),sK13) = apply(sK14,sK13) )
| ( apply(sK14,sK13) != X0 )
| ( apply(relation_dom_restriction(sK14,sK12),sK13) != X0 ) ),
inference(instantiation,[status(thm)],[c_702]) ).
tcf(c_1348,plain,
( ( apply(relation_dom_restriction(sK14,sK12),sK13) = apply(sK14,sK13) )
| ( apply(sK14,sK13) != empty_set )
| ( apply(relation_dom_restriction(sK14,sK12),sK13) != empty_set ) ),
inference(instantiation,[status(thm)],[c_1347]) ).
tcf(c_1358,plain,
( relation(relation_dom_restriction(sK14,sK12))
| ~ relation(sK14) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_1364,plain,
( in(sK13,relation_dom(relation_dom_restriction(sK14,sK12)))
| ~ relation(sK14)
| ~ function(sK14)
| ~ in(sK13,sK12)
| ~ in(sK13,relation_dom(sK14)) ),
inference(instantiation,[status(thm)],[c_79]) ).
tcf(c_1426,plain,
( function(relation_dom_restriction(sK14,sK12))
| ~ relation(sK14)
| ~ function(sK14) ),
inference(instantiation,[status(thm)],[c_72]) ).
tcf(c_1443,plain,
( in(sK13,relation_dom(relation_dom_restriction(sK14,sK12)))
| ( apply(relation_dom_restriction(sK14,sK12),sK13) = empty_set )
| ~ relation(relation_dom_restriction(sK14,sK12))
| ~ function(relation_dom_restriction(sK14,sK12)) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_1583,plain,
( in(sK13,relation_dom(sK14))
| ( apply(sK14,sK13) = empty_set )
| ~ relation(sK14)
| ~ function(sK14) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_1584,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1583,c_1443,c_1426,c_1364,c_1358,c_1348,c_1345,c_113,c_114,c_115,c_116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU225+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 13:15:08 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 4.30/1.29 % SZS status Started for theBenchmark.p
% 4.30/1.29 % SZS status Theorem for theBenchmark.p
% 4.30/1.29
% 4.30/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.30/1.29
% 4.30/1.29 % ------ iProver source info
% 4.30/1.29
% 4.30/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 4.30/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.30/1.29 % git: non_committed_changes: false
% 4.30/1.29
% 4.30/1.29 % ------ Parsing...
% 4.30/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.30/1.29
% 4.30/1.29 % ------ Preprocessing... sup_sim: 2 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 4.30/1.29
% 4.30/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.30/1.29
% 4.30/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.30/1.29 % ------ Proving...
% 4.30/1.29 % ------ Problem Properties
% 4.30/1.29
% 4.30/1.29 %
% 4.30/1.29 % clauses 59
% 4.30/1.29 % conjectures 4
% 4.30/1.29 % EPR 27
% 4.30/1.29 % Horn 55
% 4.30/1.29 % unary 31
% 4.30/1.29 % binary 11
% 4.30/1.29 % lits 121
% 4.30/1.29 % lits eq 16
% 4.30/1.29 % fd_pure 0
% 4.30/1.29 % fd_pseudo 0
% 4.30/1.29 % fd_cond 1
% 4.30/1.29 % fd_pseudo_cond 4
% 4.30/1.29 % AC symbols 0
% 4.30/1.29
% 4.30/1.29 % ------ Input Options Time Limit: Unbounded
% 4.30/1.29
% 4.30/1.29
% 4.30/1.29 % ------
% 4.30/1.29 % Current options:
% 4.30/1.29 % ------
% 4.30/1.29
% 4.30/1.29
% 4.30/1.29 %
% 4.30/1.29
% 4.30/1.29 % ------ Proving...
% 4.30/1.29 %
% 4.30/1.29
% 4.30/1.29 % SZS status Theorem for theBenchmark.p
% 4.30/1.29
% 4.30/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.30/1.29
% 4.30/1.29
%------------------------------------------------------------------------------