TSTP Solution File: SEU223+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:53 EDT 2023
% Result : Theorem 1.71s 1.20s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 9 unt; 0 def)
% Number of atoms : 191 ( 51 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 245 ( 98 ~; 88 |; 44 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 4 sgn; 65 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,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/sandbox2/benchmark/theBenchmark.p',fc13_relat_1) ).
fof(f30,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f32,axiom,
! [X0,X1] :
( ( function(X0)
& relation(X0) )
=> ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t70_funct_1) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f38,axiom,
! [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) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f42,plain,
! [X0,X1] :
( ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f43,plain,
! [X0,X1] :
( ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(flattening,[],[f42]) ).
fof(f56,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f57,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f58,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f57]) ).
fof(f63,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f64,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f66,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f65]) ).
fof(f85,plain,
( ? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) )
=> ( apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10)
& in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
( apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10)
& in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
& function(sK11)
& relation(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f64,f85]) ).
fof(f87,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(nnf_transformation,[],[f66]) ).
fof(f88,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(rectify,[],[f88]) ).
fof(f90,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK12(X1,X2)) != apply(X2,sK12(X1,X2))
& in(sK12(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK12(X1,X2)) != apply(X2,sK12(X1,X2))
& in(sK12(X1,X2),relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f89,f90]) ).
fof(f94,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f128,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f132,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f136,plain,
relation(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f137,plain,
function(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f138,plain,
in(sK10,relation_dom(relation_dom_restriction(sK11,sK9))),
inference(cnf_transformation,[],[f86]) ).
fof(f139,plain,
apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10),
inference(cnf_transformation,[],[f86]) ).
fof(f141,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f144,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f141]) ).
cnf(c_52,plain,
( ~ relation_empty_yielding(X0)
| ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_83,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_86,plain,
( ~ relation(X0)
| ~ function(X0)
| function(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_91,negated_conjecture,
apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10),
inference(cnf_transformation,[],[f139]) ).
cnf(c_92,negated_conjecture,
in(sK10,relation_dom(relation_dom_restriction(sK11,sK9))),
inference(cnf_transformation,[],[f138]) ).
cnf(c_93,negated_conjecture,
function(sK11),
inference(cnf_transformation,[],[f137]) ).
cnf(c_94,negated_conjecture,
relation(sK11),
inference(cnf_transformation,[],[f136]) ).
cnf(c_97,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_121,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_83]) ).
cnf(c_210,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_121]) ).
cnf(c_246,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_210,c_86]) ).
cnf(c_1528,plain,
( ~ in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
| ~ relation(sK11)
| ~ function(sK11)
| apply(relation_dom_restriction(sK11,sK9),sK10) = apply(sK11,sK10) ),
inference(instantiation,[status(thm)],[c_246]) ).
cnf(c_1529,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1528,c_91,c_92,c_93,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 16:08:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.71/1.20 % SZS status Started for theBenchmark.p
% 1.71/1.20 % SZS status Theorem for theBenchmark.p
% 1.71/1.20
% 1.71/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.71/1.20
% 1.71/1.20 ------ iProver source info
% 1.71/1.20
% 1.71/1.20 git: date: 2023-05-31 18:12:56 +0000
% 1.71/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.71/1.20 git: non_committed_changes: false
% 1.71/1.20 git: last_make_outside_of_git: false
% 1.71/1.20
% 1.71/1.20 ------ Parsing...
% 1.71/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.71/1.20
% 1.71/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 1.71/1.20
% 1.71/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.71/1.20
% 1.71/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.71/1.20 ------ Proving...
% 1.71/1.20 ------ Problem Properties
% 1.71/1.20
% 1.71/1.20
% 1.71/1.20 clauses 40
% 1.71/1.20 conjectures 4
% 1.71/1.20 EPR 24
% 1.71/1.20 Horn 38
% 1.71/1.20 unary 23
% 1.71/1.20 binary 9
% 1.71/1.20 lits 74
% 1.71/1.20 lits eq 13
% 1.71/1.20 fd_pure 0
% 1.71/1.20 fd_pseudo 0
% 1.71/1.20 fd_cond 1
% 1.71/1.20 fd_pseudo_cond 3
% 1.71/1.20 AC symbols 0
% 1.71/1.20
% 1.71/1.20 ------ Schedule dynamic 5 is on
% 1.71/1.20
% 1.71/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.71/1.20
% 1.71/1.20
% 1.71/1.20 ------
% 1.71/1.20 Current options:
% 1.71/1.20 ------
% 1.71/1.20
% 1.71/1.20
% 1.71/1.20
% 1.71/1.20
% 1.71/1.20 ------ Proving...
% 1.71/1.20
% 1.71/1.20
% 1.71/1.20 % SZS status Theorem for theBenchmark.p
% 1.71/1.20
% 1.71/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.71/1.20
% 1.71/1.20
%------------------------------------------------------------------------------