TSTP Solution File: SEU192+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU192+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 : Thu Aug 31 17:04:33 EDT 2023
% Result : Theorem 112.58s 15.87s
% Output : CNFRefutation 112.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 8 unt; 0 def)
% Number of atoms : 357 ( 31 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 474 ( 192 ~; 199 |; 59 &)
% ( 10 <=>; 13 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 229 ( 7 sgn; 147 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( relation(X2)
=> ( relation_dom_restriction(X0,X1) = X2
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_relat_1) ).
fof(f21,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation_dom(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f27,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(f56,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f117,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(f165,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f173,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,relation_dom(X2))
& in(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t86_relat_1) ).
fof(f174,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,relation_dom(X2))
& in(X0,X1) ) ) ),
inference(negated_conjecture,[],[f173]) ).
fof(f197,plain,
! [X0] :
( ! [X1,X2] :
( ( relation_dom_restriction(X0,X1) = X2
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( relation_dom(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f219,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f266,plain,
! [X0,X1,X2] :
( ( in(X1,relation_rng(X2))
& in(X0,relation_dom(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(ennf_transformation,[],[f117]) ).
fof(f267,plain,
! [X0,X1,X2] :
( ( in(X1,relation_rng(X2))
& in(X0,relation_dom(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(flattening,[],[f266]) ).
fof(f318,plain,
? [X0,X1,X2] :
( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<~> ( in(X0,relation_dom(X2))
& in(X0,X1) ) )
& relation(X2) ),
inference(ennf_transformation,[],[f174]) ).
fof(f334,plain,
! [X0] :
( ! [X1,X2] :
( ( ( relation_dom_restriction(X0,X1) = X2
| ? [X3,X4] :
( ( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1) )
& ( ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) )
| ~ in(ordered_pair(X3,X4),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f197]) ).
fof(f335,plain,
! [X0] :
( ! [X1,X2] :
( ( ( relation_dom_restriction(X0,X1) = X2
| ? [X3,X4] :
( ( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1) )
& ( ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) )
| ~ in(ordered_pair(X3,X4),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(flattening,[],[f334]) ).
fof(f336,plain,
! [X0] :
( ! [X1,X2] :
( ( ( relation_dom_restriction(X0,X1) = X2
| ? [X3,X4] :
( ( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X2)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(X5,X1) )
& ( ( in(ordered_pair(X5,X6),X0)
& in(X5,X1) )
| ~ in(ordered_pair(X5,X6),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(rectify,[],[f335]) ).
fof(f337,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( ( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) )
| in(ordered_pair(X3,X4),X2) ) )
=> ( ( ~ in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X0)
| ~ in(sK2(X0,X1,X2),X1)
| ~ in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X2) )
& ( ( in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X0)
& in(sK2(X0,X1,X2),X1) )
| in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
! [X0] :
( ! [X1,X2] :
( ( ( relation_dom_restriction(X0,X1) = X2
| ( ( ~ in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X0)
| ~ in(sK2(X0,X1,X2),X1)
| ~ in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X2) )
& ( ( in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X0)
& in(sK2(X0,X1,X2),X1) )
| in(ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2)),X2) ) ) )
& ( ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X2)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(X5,X1) )
& ( ( in(ordered_pair(X5,X6),X0)
& in(X5,X1) )
| ~ in(ordered_pair(X5,X6),X2) ) )
| relation_dom_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f336,f337]) ).
fof(f388,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f202]) ).
fof(f389,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( ? [X7] : in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f388]) ).
fof(f390,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) )
=> ( ( ! [X3] : ~ in(ordered_pair(sK22(X0,X1),X3),X0)
| ~ in(sK22(X0,X1),X1) )
& ( ? [X4] : in(ordered_pair(sK22(X0,X1),X4),X0)
| in(sK22(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f391,plain,
! [X0,X1] :
( ? [X4] : in(ordered_pair(sK22(X0,X1),X4),X0)
=> in(ordered_pair(sK22(X0,X1),sK23(X0,X1)),X0) ),
introduced(choice_axiom,[]) ).
fof(f392,plain,
! [X0,X5] :
( ? [X7] : in(ordered_pair(X5,X7),X0)
=> in(ordered_pair(X5,sK24(X0,X5)),X0) ),
introduced(choice_axiom,[]) ).
fof(f393,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ( ( ! [X3] : ~ in(ordered_pair(sK22(X0,X1),X3),X0)
| ~ in(sK22(X0,X1),X1) )
& ( in(ordered_pair(sK22(X0,X1),sK23(X0,X1)),X0)
| in(sK22(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,sK24(X0,X5)),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24])],[f389,f392,f391,f390]) ).
fof(f476,plain,
? [X0,X1,X2] :
( ( ~ in(X0,relation_dom(X2))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& ( ( in(X0,relation_dom(X2))
& in(X0,X1) )
| in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& relation(X2) ),
inference(nnf_transformation,[],[f318]) ).
fof(f477,plain,
? [X0,X1,X2] :
( ( ~ in(X0,relation_dom(X2))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& ( ( in(X0,relation_dom(X2))
& in(X0,X1) )
| in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& relation(X2) ),
inference(flattening,[],[f476]) ).
fof(f478,plain,
( ? [X0,X1,X2] :
( ( ~ in(X0,relation_dom(X2))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& ( ( in(X0,relation_dom(X2))
& in(X0,X1) )
| in(X0,relation_dom(relation_dom_restriction(X2,X1))) )
& relation(X2) )
=> ( ( ~ in(sK53,relation_dom(sK55))
| ~ in(sK53,sK54)
| ~ in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) )
& ( ( in(sK53,relation_dom(sK55))
& in(sK53,sK54) )
| in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) )
& relation(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f479,plain,
( ( ~ in(sK53,relation_dom(sK55))
| ~ in(sK53,sK54)
| ~ in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) )
& ( ( in(sK53,relation_dom(sK55))
& in(sK53,sK54) )
| in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) )
& relation(sK55) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55])],[f477,f478]) ).
fof(f499,plain,
! [X2,X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X2)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f500,plain,
! [X2,X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X5,X6),X2)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f501,plain,
! [X2,X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X2)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(X5,X1)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f559,plain,
! [X0,X1,X5] :
( in(ordered_pair(X5,sK24(X0,X5)),X0)
| ~ in(X5,X1)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f393]) ).
fof(f581,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f609,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f219]) ).
fof(f690,plain,
! [X2,X0,X1] :
( in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f267]) ).
fof(f759,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f165]) ).
fof(f771,plain,
relation(sK55),
inference(cnf_transformation,[],[f479]) ).
fof(f772,plain,
( in(sK53,sK54)
| in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) ),
inference(cnf_transformation,[],[f479]) ).
fof(f773,plain,
( in(sK53,relation_dom(sK55))
| in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) ),
inference(cnf_transformation,[],[f479]) ).
fof(f774,plain,
( ~ in(sK53,relation_dom(sK55))
| ~ in(sK53,sK54)
| ~ in(sK53,relation_dom(relation_dom_restriction(sK55,sK54))) ),
inference(cnf_transformation,[],[f479]) ).
fof(f785,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f581,f759]) ).
fof(f796,plain,
! [X2,X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X2)
| ~ in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X0)
| ~ in(X5,X1)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f501,f785,f785]) ).
fof(f797,plain,
! [X2,X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X2)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f500,f785,f785]) ).
fof(f798,plain,
! [X2,X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X2)
| relation_dom_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f499,f785]) ).
fof(f818,plain,
! [X0,X1,X5] :
( in(unordered_pair(unordered_pair(X5,sK24(X0,X5)),unordered_pair(X5,X5)),X0)
| ~ in(X5,X1)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f559,f785]) ).
fof(f858,plain,
! [X2,X0,X1] :
( in(X0,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2)
| ~ relation(X2) ),
inference(definition_unfolding,[],[f690,f785]) ).
fof(f889,plain,
! [X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),relation_dom_restriction(X0,X1))
| ~ in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X0)
| ~ in(X5,X1)
| ~ relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f796]) ).
fof(f890,plain,
! [X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),relation_dom_restriction(X0,X1))
| ~ relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f797]) ).
fof(f891,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),unordered_pair(X5,X5)),relation_dom_restriction(X0,X1))
| ~ relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f798]) ).
fof(f922,plain,
! [X0,X5] :
( in(unordered_pair(unordered_pair(X5,sK24(X0,X5)),unordered_pair(X5,X5)),X0)
| ~ in(X5,relation_dom(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f818]) ).
cnf(c_67,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2)
| ~ relation(relation_dom_restriction(X2,X3))
| ~ in(X0,X3)
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),relation_dom_restriction(X2,X3)) ),
inference(cnf_transformation,[],[f889]) ).
cnf(c_68,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),relation_dom_restriction(X2,X3))
| ~ relation(relation_dom_restriction(X2,X3))
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2) ),
inference(cnf_transformation,[],[f890]) ).
cnf(c_69,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),relation_dom_restriction(X2,X3))
| ~ relation(relation_dom_restriction(X2,X3))
| ~ relation(X2)
| in(X0,X3) ),
inference(cnf_transformation,[],[f891]) ).
cnf(c_127,plain,
( ~ in(X0,relation_dom(X1))
| ~ relation(X1)
| in(unordered_pair(unordered_pair(X0,sK24(X1,X0)),unordered_pair(X0,X0)),X1) ),
inference(cnf_transformation,[],[f922]) ).
cnf(c_173,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f609]) ).
cnf(c_255,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2)
| ~ relation(X2)
| in(X0,relation_dom(X2)) ),
inference(cnf_transformation,[],[f858]) ).
cnf(c_333,negated_conjecture,
( ~ in(sK53,relation_dom(relation_dom_restriction(sK55,sK54)))
| ~ in(sK53,relation_dom(sK55))
| ~ in(sK53,sK54) ),
inference(cnf_transformation,[],[f774]) ).
cnf(c_334,negated_conjecture,
( in(sK53,relation_dom(relation_dom_restriction(sK55,sK54)))
| in(sK53,relation_dom(sK55)) ),
inference(cnf_transformation,[],[f773]) ).
cnf(c_335,negated_conjecture,
( in(sK53,relation_dom(relation_dom_restriction(sK55,sK54)))
| in(sK53,sK54) ),
inference(cnf_transformation,[],[f772]) ).
cnf(c_336,negated_conjecture,
relation(sK55),
inference(cnf_transformation,[],[f771]) ).
cnf(c_594,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(prop_impl_just,[status(thm)],[c_173]) ).
cnf(c_1446,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),relation_dom_restriction(X2,X3))
| ~ relation(X2)
| in(X0,X3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_69,c_594]) ).
cnf(c_1447,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),relation_dom_restriction(X2,X3))
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2) ),
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_594]) ).
cnf(c_1448,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2)
| ~ in(X0,X3)
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),relation_dom_restriction(X2,X3)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_67,c_594]) ).
cnf(c_9541,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| in(X0,X2) ),
inference(superposition,[status(thm)],[c_127,c_1446]) ).
cnf(c_9550,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| in(unordered_pair(unordered_pair(X0,sK24(relation_dom_restriction(X1,X2),X0)),unordered_pair(X0,X0)),X1) ),
inference(superposition,[status(thm)],[c_127,c_1447]) ).
cnf(c_9556,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),X2)
| ~ relation(relation_dom_restriction(X2,X3))
| ~ in(X0,X3)
| ~ relation(X2)
| in(X0,relation_dom(relation_dom_restriction(X2,X3))) ),
inference(superposition,[status(thm)],[c_1448,c_255]) ).
cnf(c_9565,plain,
( ~ relation(relation_dom_restriction(sK55,sK54))
| ~ relation(sK55)
| in(sK53,sK54) ),
inference(superposition,[status(thm)],[c_335,c_9541]) ).
cnf(c_9569,plain,
( ~ relation(sK55)
| relation(relation_dom_restriction(sK55,sK54)) ),
inference(instantiation,[status(thm)],[c_173]) ).
cnf(c_9587,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| in(X0,relation_dom(X1)) ),
inference(superposition,[status(thm)],[c_9550,c_255]) ).
cnf(c_9602,plain,
( ~ relation(relation_dom_restriction(sK55,sK54))
| ~ relation(sK55)
| in(sK53,relation_dom(sK55)) ),
inference(superposition,[status(thm)],[c_334,c_9587]) ).
cnf(c_9627,plain,
( ~ in(X0,relation_dom(X1))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ in(X0,X2)
| ~ relation(X1)
| in(X0,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(superposition,[status(thm)],[c_127,c_9556]) ).
cnf(c_9640,plain,
( ~ in(sK53,relation_dom(sK55))
| ~ relation(relation_dom_restriction(sK55,sK54))
| ~ in(sK53,sK54)
| ~ relation(sK55) ),
inference(superposition,[status(thm)],[c_9627,c_333]) ).
cnf(c_9644,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9640,c_9602,c_9569,c_9565,c_336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU192+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.34 % Computer : n019.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Wed Aug 23 17:15:29 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 112.58/15.87 % SZS status Started for theBenchmark.p
% 112.58/15.87 % SZS status Theorem for theBenchmark.p
% 112.58/15.87
% 112.58/15.87 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 112.58/15.87
% 112.58/15.87 ------ iProver source info
% 112.58/15.87
% 112.58/15.87 git: date: 2023-05-31 18:12:56 +0000
% 112.58/15.87 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 112.58/15.87 git: non_committed_changes: false
% 112.58/15.87 git: last_make_outside_of_git: false
% 112.58/15.87
% 112.58/15.87 ------ Parsing...
% 112.58/15.87 ------ Clausification by vclausify_rel & Parsing by iProver...
% 112.58/15.87
% 112.58/15.87 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 112.58/15.87
% 112.58/15.87 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 112.58/15.87
% 112.58/15.87 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 112.58/15.87 ------ Proving...
% 112.58/15.87 ------ Problem Properties
% 112.58/15.87
% 112.58/15.87
% 112.58/15.87 clauses 268
% 112.58/15.87 conjectures 4
% 112.58/15.87 EPR 34
% 112.58/15.87 Horn 211
% 112.58/15.87 unary 46
% 112.58/15.87 binary 95
% 112.58/15.87 lits 679
% 112.58/15.87 lits eq 149
% 112.58/15.87 fd_pure 0
% 112.58/15.87 fd_pseudo 0
% 112.58/15.87 fd_cond 13
% 112.58/15.87 fd_pseudo_cond 57
% 112.58/15.87 AC symbols 0
% 112.58/15.87
% 112.58/15.87 ------ Input Options Time Limit: Unbounded
% 112.58/15.87
% 112.58/15.87
% 112.58/15.87 ------
% 112.58/15.87 Current options:
% 112.58/15.87 ------
% 112.58/15.87
% 112.58/15.87
% 112.58/15.87
% 112.58/15.87
% 112.58/15.87 ------ Proving...
% 112.58/15.87
% 112.58/15.87
% 112.58/15.87 % SZS status Theorem for theBenchmark.p
% 112.58/15.87
% 112.58/15.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 112.58/15.87
% 112.58/15.88
%------------------------------------------------------------------------------