%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU212+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 : n009.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 2.47s 1.28s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 82 ( 27 unt; 5 def)
% Number of atoms : 296 ( 70 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 311 ( 124 ~; 129 |; 38 &)
% ( 12 <=>; 6 =>; 0 <=; 2 <~>)
% 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 : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 130 ( 0 sgn 110 !; 20 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f5,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(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f7,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(f35,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(f36,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)],[f35]) ).
fof(f42,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,[],[f5]) ).
fof(f43,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,[],[f42]) ).
fof(f44,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f54,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,[],[f36]) ).
fof(f55,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,[],[f54]) ).
fof(f56,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,[],[f43]) ).
fof(f57,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( relation_dom(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| ? [X3] : in(ordered_pair(X2,X3),X0) )
& ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| ? [X3] : in(ordered_pair(X2,X3),X0) )
& ( ~ in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) ) )
| X1 = relation_dom(X0) ) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f58,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( relation_dom(X0) != X1
| ! [X5] :
( ( ~ in(X5,X1)
| ? [X7] : in(ordered_pair(X5,X7),X0) )
& ( ! [X6] : ~ in(ordered_pair(X5,X6),X0)
| in(X5,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| ? [X4] : in(ordered_pair(X2,X4),X0) )
& ( ~ in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) ) )
| X1 = relation_dom(X0) ) ) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( relation_dom(X0) != X1
| ! [X5] :
( ( ~ in(X5,X1)
| in(ordered_pair(X5,sK2(X0,X5)),X0) )
& ( ! [X6] : ~ in(ordered_pair(X5,X6),X0)
| in(X5,X1) ) ) )
& ( ( ( in(sK0(X0,X1),X1)
| in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0) )
& ( ~ in(sK0(X0,X1),X1)
| ! [X3] : ~ in(ordered_pair(sK0(X0,X1),X3),X0) ) )
| X1 = relation_dom(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X0,X1)),skolemize(X4,sK1(X0,X1)),skolemize(X7,sK2(X0,X5))],[f58]) ).
fof(f67,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,[],[f55]) ).
fof(f68,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,[],[f67]) ).
fof(f69,plain,
( function(sK12)
& relation(sK12)
& ( in(ordered_pair(sK10,sK11),sK12)
| ( sK11 = apply(sK12,sK10)
& in(sK10,relation_dom(sK12)) ) )
& ( ~ in(ordered_pair(sK10,sK11),sK12)
| sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f68]) ).
fof(f73,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f76,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,[],[f56]) ).
fof(f77,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,[],[f56]) ).
fof(f79,plain,
! [X0,X1,X6,X5] :
( ~ relation(X0)
| relation_dom(X0) != X1
| ~ in(ordered_pair(X5,X6),X0)
| in(X5,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f82,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f109,plain,
function(sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f110,plain,
relation(sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f111,plain,
( in(ordered_pair(sK10,sK11),sK12)
| sK11 = apply(sK12,sK10) ),
inference(cnf_transformation,[],[f69]) ).
fof(f112,plain,
( in(ordered_pair(sK10,sK11),sK12)
| in(sK10,relation_dom(sK12)) ),
inference(cnf_transformation,[],[f69]) ).
fof(f113,plain,
( ~ in(ordered_pair(sK10,sK11),sK12)
| sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12)) ),
inference(cnf_transformation,[],[f69]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| apply(X0,X1) = X2 ),
inference(definition_unfolding,[],[f77,f82]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| apply(X0,X1) != X2
| in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0) ),
inference(definition_unfolding,[],[f76,f82]) ).
fof(f118,plain,
! [X0,X1,X6,X5] :
( ~ relation(X0)
| relation_dom(X0) != X1
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| in(X5,X1) ),
inference(definition_unfolding,[],[f79,f82]) ).
fof(f121,plain,
( ~ in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12)) ),
inference(definition_unfolding,[],[f113,f82]) ).
fof(f122,plain,
( in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| in(sK10,relation_dom(sK12)) ),
inference(definition_unfolding,[],[f112,f82]) ).
fof(f123,plain,
( in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| sK11 = apply(sK12,sK10) ),
inference(definition_unfolding,[],[f111,f82]) ).
fof(f124,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| in(unordered_pair(unordered_pair(X1,apply(X0,X1)),singleton(X1)),X0) ),
inference(equality_resolution,[],[f115]) ).
fof(f127,plain,
! [X0,X6,X5] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| in(X5,relation_dom(X0)) ),
inference(equality_resolution,[],[f118]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f73]) ).
tcf(c_53,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),singleton(X0)),X2) ),
inference(cnf_transformation,[],[f114]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(unordered_pair(X0,apply(X1,X0)),singleton(X0)),X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X0,relation_dom(X1)) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_87,negated_conjecture,
( ~ in(sK10,relation_dom(sK12))
| ~ in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| ( apply(sK12,sK10) != sK11 ) ),
inference(cnf_transformation,[],[f121]) ).
tcf(c_88,negated_conjecture,
( in(sK10,relation_dom(sK12))
| in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_89,negated_conjecture,
( in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| ( apply(sK12,sK10) = sK11 ) ),
inference(cnf_transformation,[],[f123]) ).
tcf(c_90,negated_conjecture,
relation(sK12),
inference(cnf_transformation,[],[f110]) ).
tcf(c_91,negated_conjecture,
function(sK12),
inference(cnf_transformation,[],[f109]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(X2,X0) = X1 )
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2) ),
inference(global_subsumption_just,[status(thm)],[c_53,c_59,c_53]) ).
tcf(c_316,plain,
( in(sK10,relation_dom(sK12))
| in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12) ),
inference(demodulation,[status(thm)],[c_88,c_52]) ).
tcf(c_323,plain,
( in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| ( apply(sK12,sK10) = sK11 ) ),
inference(demodulation,[status(thm)],[c_89,c_52]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2) ),
inference(demodulation,[status(thm)],[c_59,c_52]) ).
tcf(c_358,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(X2,X0) = X1 )
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2) ),
inference(demodulation,[status(thm)],[c_115,c_52]) ).
tcf(c_371,plain,
( ~ in(sK10,relation_dom(sK12))
| ~ in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| ( apply(sK12,sK10) != sK11 ) ),
inference(demodulation,[status(thm)],[c_87,c_52]) ).
tcf(c_381,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,apply(X1,X0))),X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X0,relation_dom(X1)) ),
inference(demodulation,[status(thm)],[c_54,c_52]) ).
tcf(c_495,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X0,X1))),X0)
| ~ relation(X0)
| ~ in(X1,relation_dom(X0))
| ( X0 != sK12 ) ),
inference(resolution_lifted,[status(thm)],[c_381,c_91]) ).
tcf(c_496,plain,
! [X0: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,apply(sK12,X0))),sK12)
| ~ relation(sK12)
| ~ in(X0,relation_dom(sK12)) ),
inference(unflattening,[status(thm)],[c_495]) ).
tcf(c_498,plain,
! [X0: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,apply(sK12,X0))),sK12)
| ~ in(X0,relation_dom(sK12)) ),
inference(global_subsumption_just,[status(thm)],[c_496,c_90,c_496]) ).
tcf(c_546,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( apply(X0,X1) = X2 )
| ~ relation(X0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X0)
| ( X0 != sK12 ) ),
inference(resolution_lifted,[status(thm)],[c_358,c_91]) ).
tcf(c_547,plain,
! [X0: $i,X1: $i] :
( ( apply(sK12,X0) = X1 )
| ~ relation(sK12)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12) ),
inference(unflattening,[status(thm)],[c_546]) ).
tcf(c_549,plain,
! [X0: $i,X1: $i] :
( ( apply(sK12,X0) = X1 )
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12) ),
inference(global_subsumption_just,[status(thm)],[c_547,c_90,c_547]) ).
tcf(c_573,plain,
apply(sK12,sK10) = sK11,
inference(backward_subsumption_resolution,[status(thm)],[c_323,c_549]) ).
tcf(c_575,plain,
( ~ in(sK10,relation_dom(sK12))
| ~ in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12) ),
inference(backward_subsumption_resolution,[status(thm)],[c_371,c_549]) ).
tcf(c_917,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X1,relation_dom(X0))
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X0)
| ( X0 != sK12 ) ),
inference(resolution_lifted,[status(thm)],[c_330,c_90]) ).
tcf(c_918,plain,
! [X0: $i,X1: $i] :
( in(X0,relation_dom(sK12))
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12) ),
inference(unflattening,[status(thm)],[c_917]) ).
tcf(c_1000,plain,
in(sK10,relation_dom(sK12)),
inference(backward_subsumption_resolution,[status(thm)],[c_316,c_918]) ).
tcf(c_1002,plain,
~ in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12),
inference(backward_subsumption_resolution,[status(thm)],[c_575,c_918]) ).
tcf(c_1639,definition,
iPr_def_10 = singleton(sK10),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1640,definition,
iPr_def_11 = unordered_pair(sK10,sK11),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1641,definition,
iPr_def_12 = unordered_pair(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1642,definition,
iPr_def_13 = relation_dom(sK12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_1643,definition,
iPr_def_14 = apply(sK12,sK10),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_1644,plain,
~ in(iPr_def_12,sK12),
inference(demodulation,[status(thm)],[c_1002,c_1640,c_1639,c_1641]) ).
tcf(c_1645,plain,
in(sK10,iPr_def_13),
inference(demodulation,[status(thm)],[c_1000,c_1642]) ).
tcf(c_1646,plain,
iPr_def_14 = sK11,
inference(demodulation,[status(thm)],[c_573,c_1643]) ).
tcf(c_1649,plain,
! [X0: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,apply(sK12,X0))),sK12)
| ~ in(X0,iPr_def_13) ),
inference(demodulation,[status(thm)],[c_498]) ).
tcf(c_2065,plain,
( in(unordered_pair(iPr_def_10,unordered_pair(sK10,apply(sK12,sK10))),sK12)
| ~ in(sK10,iPr_def_13) ),
inference(superposition,[status(thm)],[c_1639,c_1649]) ).
tcf(c_2066,plain,
( in(unordered_pair(iPr_def_10,unordered_pair(sK10,iPr_def_14)),sK12)
| ~ in(sK10,iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_2065,c_1643]) ).
tcf(c_2067,plain,
in(unordered_pair(iPr_def_10,unordered_pair(sK10,iPr_def_14)),sK12),
inference(forward_subsumption_resolution,[status(thm)],[c_2066,c_1645]) ).
tcf(c_2072,plain,
in(unordered_pair(iPr_def_10,unordered_pair(iPr_def_14,sK10)),sK12),
inference(demodulation,[status(thm)],[c_2067,c_52]) ).
tcf(c_2085,plain,
unordered_pair(sK10,iPr_def_14) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_1640,c_1646]) ).
tcf(c_2086,plain,
unordered_pair(iPr_def_14,sK10) = iPr_def_11,
inference(demodulation,[status(thm)],[c_2085,c_52]) ).
tcf(c_2087,plain,
in(unordered_pair(iPr_def_10,iPr_def_11),sK12),
inference(demodulation,[status(thm)],[c_2072,c_2086]) ).
tcf(c_2088,plain,
in(iPr_def_12,sK12),
inference(light_normalisation,[status(thm)],[c_2087,c_1641]) ).
tcf(c_2089,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2088,c_1644]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU212+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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 13:11:58 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.41 Running first-order theorem proving
% 0.10/0.41 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.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.47/1.28 % SZS status Started for theBenchmark.p
% 2.47/1.28 % SZS status Theorem for theBenchmark.p
% 2.47/1.28
% 2.47/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.47/1.28
% 2.47/1.28 % ------ iProver source info
% 2.47/1.28
% 2.47/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.47/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.47/1.28 % git: non_committed_changes: false
% 2.47/1.28
% 2.47/1.28 % ------ Parsing...
% 2.47/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.47/1.28
% 2.47/1.28 % ------ Preprocessing... sup_sim: 9 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 %
% 2.47/1.28
% 2.47/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.47/1.28
% 2.47/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.47/1.28 % ------ Proving...
% 2.47/1.28 % ------ Problem Properties
% 2.47/1.28
% 2.47/1.28 %
% 2.47/1.28 % clauses 43
% 2.47/1.28 % conjectures 1
% 2.47/1.28 % EPR 19
% 2.47/1.28 % Horn 39
% 2.47/1.28 % unary 22
% 2.47/1.28 % binary 15
% 2.47/1.28 % lits 72
% 2.47/1.28 % lits eq 16
% 2.47/1.28 % fd_pure 0
% 2.47/1.28 % fd_pseudo 0
% 2.47/1.28 % fd_cond 1
% 2.47/1.28 % fd_pseudo_cond 5
% 2.47/1.28 % AC symbols 0
% 2.47/1.28
% 2.47/1.28 % ------ Schedule dynamic 5 is on
% 2.47/1.28
% 2.47/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.47/1.28
% 2.47/1.28
% 2.47/1.28 % ------
% 2.47/1.28 % Current options:
% 2.47/1.28 % ------
% 2.47/1.28
% 2.47/1.28
% 2.47/1.28 %
% 2.47/1.28
% 2.47/1.28 % ------ Proving...
% 2.47/1.28 %
% 2.47/1.28
% 2.47/1.28 % SZS status Theorem for theBenchmark.p
% 2.47/1.28
% 2.47/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.47/1.28
% 2.47/1.28
%------------------------------------------------------------------------------