TSTP Solution File: SEU252+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU252+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:05:13 EDT 2024
% Result : Theorem 158.35s 21.75s
% Output : CNFRefutation 158.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 76 ( 12 unt; 0 def)
% Number of atoms : 258 ( 6 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 309 ( 127 ~; 116 |; 41 &)
% ( 9 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 145 ( 2 sgn 110 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_2) ).
fof(f56,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f70,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_relat_2) ).
fof(f85,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f142,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
fof(f181,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(f204,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f210,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_field(relation_restriction(X2,X1)))
=> ( in(X0,X1)
& in(X0,relation_field(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_wellord1) ).
fof(f223,conjecture,
! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_wellord1) ).
fof(f224,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
inference(negated_conjecture,[],[f223]) ).
fof(f288,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f351,plain,
! [X0] :
( ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f387,plain,
! [X0] :
( ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f390,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f438,plain,
! [X0] :
( ( reflexive(X0)
<=> ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f142]) ).
fof(f491,plain,
! [X0,X1,X2] :
( ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f204]) ).
fof(f498,plain,
! [X0,X1,X2] :
( ( in(X0,X1)
& in(X0,relation_field(X2)) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(ennf_transformation,[],[f210]) ).
fof(f499,plain,
! [X0,X1,X2] :
( ( in(X0,X1)
& in(X0,relation_field(X2)) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(flattening,[],[f498]) ).
fof(f516,plain,
? [X0,X1] :
( ~ reflexive(relation_restriction(X1,X0))
& reflexive(X1)
& relation(X1) ),
inference(ennf_transformation,[],[f224]) ).
fof(f517,plain,
? [X0,X1] :
( ~ reflexive(relation_restriction(X1,X0))
& reflexive(X1)
& relation(X1) ),
inference(flattening,[],[f516]) ).
fof(f671,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f351]) ).
fof(f672,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f671]) ).
fof(f673,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) )
=> ( ~ in(ordered_pair(sK21(X0,X1),sK21(X0,X1)),X0)
& in(sK21(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f674,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ( ~ in(ordered_pair(sK21(X0,X1),sK21(X0,X1)),X0)
& in(sK21(X0,X1),X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21])],[f672,f673]) ).
fof(f819,plain,
! [X0] :
( ( ( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) )
& ( is_reflexive_in(X0,relation_field(X0))
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f387]) ).
fof(f822,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f438]) ).
fof(f823,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(rectify,[],[f822]) ).
fof(f824,plain,
! [X0] :
( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
=> ( ~ in(ordered_pair(sK79(X0),sK79(X0)),X0)
& in(sK79(X0),relation_field(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f825,plain,
! [X0] :
( ( ( reflexive(X0)
| ( ~ in(ordered_pair(sK79(X0),sK79(X0)),X0)
& in(sK79(X0),relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK79])],[f823,f824]) ).
fof(f877,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) )
& ( ( in(X1,X3)
& in(X0,X2) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f181]) ).
fof(f878,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) )
& ( ( in(X1,X3)
& in(X0,X2) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f877]) ).
fof(f892,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2) )
& ( ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f491]) ).
fof(f893,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2) )
& ( ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(flattening,[],[f892]) ).
fof(f896,plain,
( ? [X0,X1] :
( ~ reflexive(relation_restriction(X1,X0))
& reflexive(X1)
& relation(X1) )
=> ( ~ reflexive(relation_restriction(sK106,sK105))
& reflexive(sK106)
& relation(sK106) ) ),
introduced(choice_axiom,[]) ).
fof(f897,plain,
( ~ reflexive(relation_restriction(sK106,sK105))
& reflexive(sK106)
& relation(sK106) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK105,sK106])],[f517,f896]) ).
fof(f1044,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| in(sK21(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f674]) ).
fof(f1045,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(ordered_pair(sK21(X0,X1),sK21(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f674]) ).
fof(f1176,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f56]) ).
fof(f1225,plain,
! [X0] :
( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f819]) ).
fof(f1229,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f390]) ).
fof(f1303,plain,
! [X2,X0] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0))
| ~ reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f825]) ).
fof(f1390,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f878]) ).
fof(f1426,plain,
! [X2,X0,X1] :
( in(X0,relation_restriction(X2,X1))
| ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f893]) ).
fof(f1432,plain,
! [X2,X0,X1] :
( in(X0,relation_field(X2))
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f499]) ).
fof(f1433,plain,
! [X2,X0,X1] :
( in(X0,X1)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f499]) ).
fof(f1450,plain,
relation(sK106),
inference(cnf_transformation,[],[f897]) ).
fof(f1451,plain,
reflexive(sK106),
inference(cnf_transformation,[],[f897]) ).
fof(f1452,plain,
~ reflexive(relation_restriction(sK106,sK105)),
inference(cnf_transformation,[],[f897]) ).
fof(f1565,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f288]) ).
fof(f1603,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f1176,f1565]) ).
fof(f1634,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(unordered_pair(unordered_pair(sK21(X0,X1),sK21(X0,X1)),unordered_pair(sK21(X0,X1),sK21(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f1045,f1603]) ).
fof(f1704,plain,
! [X2,X0] :
( in(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,X2)),X0)
| ~ in(X2,relation_field(X0))
| ~ reflexive(X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f1303,f1603]) ).
fof(f1728,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) ),
inference(definition_unfolding,[],[f1390,f1603]) ).
cnf(c_128,plain,
( ~ in(unordered_pair(unordered_pair(sK21(X0,X1),sK21(X0,X1)),unordered_pair(sK21(X0,X1),sK21(X0,X1))),X0)
| ~ relation(X0)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f1634]) ).
cnf(c_129,plain,
( ~ relation(X0)
| in(sK21(X0,X1),X1)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f1044]) ).
cnf(c_308,plain,
( ~ is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0)
| reflexive(X0) ),
inference(cnf_transformation,[],[f1225]) ).
cnf(c_313,plain,
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f1229]) ).
cnf(c_389,plain,
( ~ in(X0,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1)
| in(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,X0)),X1) ),
inference(cnf_transformation,[],[f1704]) ).
cnf(c_472,plain,
( ~ in(X0,X1)
| ~ in(X2,X3)
| in(unordered_pair(unordered_pair(X2,X0),unordered_pair(X2,X2)),cartesian_product2(X3,X1)) ),
inference(cnf_transformation,[],[f1728]) ).
cnf(c_508,plain,
( ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2)
| ~ relation(X2)
| in(X0,relation_restriction(X2,X1)) ),
inference(cnf_transformation,[],[f1426]) ).
cnf(c_516,plain,
( ~ in(X0,relation_field(relation_restriction(X1,X2)))
| ~ relation(X1)
| in(X0,X2) ),
inference(cnf_transformation,[],[f1433]) ).
cnf(c_517,plain,
( ~ in(X0,relation_field(relation_restriction(X1,X2)))
| ~ relation(X1)
| in(X0,relation_field(X1)) ),
inference(cnf_transformation,[],[f1432]) ).
cnf(c_534,negated_conjecture,
~ reflexive(relation_restriction(sK106,sK105)),
inference(cnf_transformation,[],[f1452]) ).
cnf(c_535,negated_conjecture,
reflexive(sK106),
inference(cnf_transformation,[],[f1451]) ).
cnf(c_536,negated_conjecture,
relation(sK106),
inference(cnf_transformation,[],[f1450]) ).
cnf(c_7071,plain,
( relation_restriction(sK106,sK105) != X0
| ~ is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(resolution_lifted,[status(thm)],[c_308,c_534]) ).
cnf(c_7072,plain,
( ~ is_reflexive_in(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))
| ~ relation(relation_restriction(sK106,sK105)) ),
inference(unflattening,[status(thm)],[c_7071]) ).
cnf(c_30507,plain,
( ~ relation(sK106)
| relation(relation_restriction(sK106,sK105)) ),
inference(instantiation,[status(thm)],[c_313]) ).
cnf(c_30508,plain,
( ~ in(unordered_pair(unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))),unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))))),relation_restriction(sK106,sK105))
| ~ relation(relation_restriction(sK106,sK105))
| is_reflexive_in(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))) ),
inference(instantiation,[status(thm)],[c_128]) ).
cnf(c_30509,plain,
( ~ relation(relation_restriction(sK106,sK105))
| in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),relation_field(relation_restriction(sK106,sK105)))
| is_reflexive_in(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))) ),
inference(instantiation,[status(thm)],[c_129]) ).
cnf(c_30721,plain,
( ~ in(unordered_pair(unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))),unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))))),cartesian_product2(sK105,sK105))
| ~ in(unordered_pair(unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))),unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))))),sK106)
| ~ relation(sK106)
| in(unordered_pair(unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))),unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))))),relation_restriction(sK106,sK105)) ),
inference(instantiation,[status(thm)],[c_508]) ).
cnf(c_33032,plain,
( ~ in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),relation_field(sK106))
| ~ relation(sK106)
| ~ reflexive(sK106)
| in(unordered_pair(unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))),unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))))),sK106) ),
inference(instantiation,[status(thm)],[c_389]) ).
cnf(c_36782,plain,
( ~ in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),relation_field(relation_restriction(sK106,sK105)))
| ~ relation(sK106)
| in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK105) ),
inference(instantiation,[status(thm)],[c_516]) ).
cnf(c_36853,plain,
( ~ in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),relation_field(relation_restriction(sK106,sK105)))
| ~ relation(sK106)
| in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),relation_field(sK106)) ),
inference(instantiation,[status(thm)],[c_517]) ).
cnf(c_85931,plain,
( ~ in(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK105)
| in(unordered_pair(unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105)))),unordered_pair(sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))),sK21(relation_restriction(sK106,sK105),relation_field(relation_restriction(sK106,sK105))))),cartesian_product2(sK105,sK105)) ),
inference(instantiation,[status(thm)],[c_472]) ).
cnf(c_85932,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_85931,c_36853,c_36782,c_33032,c_30721,c_30508,c_30509,c_30507,c_7072,c_535,c_536]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU252+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n032.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 17:37:38 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 158.35/21.75 % SZS status Started for theBenchmark.p
% 158.35/21.75 % SZS status Theorem for theBenchmark.p
% 158.35/21.75
% 158.35/21.75 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 158.35/21.75
% 158.35/21.75 ------ iProver source info
% 158.35/21.75
% 158.35/21.75 git: date: 2024-05-02 19:28:25 +0000
% 158.35/21.75 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 158.35/21.75 git: non_committed_changes: false
% 158.35/21.75
% 158.35/21.75 ------ Parsing...
% 158.35/21.75 ------ Clausification by vclausify_rel & Parsing by iProver...
% 158.35/21.75
% 158.35/21.75 ------ Preprocessing... sup_sim: 56 sf_s rm: 6 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
% 158.35/21.75
% 158.35/21.75 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 158.35/21.75
% 158.35/21.75 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 158.35/21.75 ------ Proving...
% 158.35/21.75 ------ Problem Properties
% 158.35/21.75
% 158.35/21.75
% 158.35/21.75 clauses 555
% 158.35/21.75 conjectures 3
% 158.35/21.75 EPR 85
% 158.35/21.75 Horn 427
% 158.35/21.75 unary 83
% 158.35/21.75 binary 148
% 158.35/21.75 lits 1607
% 158.35/21.75 lits eq 264
% 158.35/21.75 fd_pure 0
% 158.35/21.75 fd_pseudo 0
% 158.35/21.75 fd_cond 21
% 158.35/21.75 fd_pseudo_cond 99
% 158.35/21.75 AC symbols 0
% 158.35/21.75
% 158.35/21.75 ------ Input Options Time Limit: Unbounded
% 158.35/21.75
% 158.35/21.75
% 158.35/21.75 ------
% 158.35/21.75 Current options:
% 158.35/21.75 ------
% 158.35/21.75
% 158.35/21.75
% 158.35/21.75
% 158.35/21.75
% 158.35/21.75 ------ Proving...
% 158.35/21.75
% 158.35/21.75
% 158.35/21.75 % SZS status Theorem for theBenchmark.p
% 158.35/21.75
% 158.35/21.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 158.35/21.75
% 158.35/21.76
%------------------------------------------------------------------------------