TSTP Solution File: SEU223+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:54 EDT 2023
% Result : Theorem 2.05s 1.17s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 9 unt; 0 def)
% Number of atoms : 190 ( 51 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 243 ( 97 ~; 87 |; 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(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/sandbox2/benchmark/theBenchmark.p',fc13_relat_1) ).
fof(f23,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f24,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(f38,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(f39,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,[],[f38]) ).
fof(f40,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(f52,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,[],[f12]) ).
fof(f53,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,[],[f52]) ).
fof(f64,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f65,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f66,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f65]) ).
fof(f72,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,[],[f39]) ).
fof(f73,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,[],[f72]) ).
fof(f74,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,[],[f40]) ).
fof(f75,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,[],[f74]) ).
fof(f98,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(sK13,sK11),sK12) != apply(sK13,sK12)
& in(sK12,relation_dom(relation_dom_restriction(sK13,sK11)))
& function(sK13)
& relation(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
( apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12)
& in(sK12,relation_dom(relation_dom_restriction(sK13,sK11)))
& function(sK13)
& relation(sK13) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13])],[f73,f98]) ).
fof(f100,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,[],[f75]) ).
fof(f101,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,[],[f100]) ).
fof(f102,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,[],[f101]) ).
fof(f103,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK14(X1,X2)) != apply(X2,sK14(X1,X2))
& in(sK14(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK14(X1,X2)) != apply(X2,sK14(X1,X2))
& in(sK14(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,[sK14])],[f102,f103]) ).
fof(f121,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f133,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f135,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f158,plain,
relation(sK13),
inference(cnf_transformation,[],[f99]) ).
fof(f159,plain,
function(sK13),
inference(cnf_transformation,[],[f99]) ).
fof(f160,plain,
in(sK12,relation_dom(relation_dom_restriction(sK13,sK11))),
inference(cnf_transformation,[],[f99]) ).
fof(f161,plain,
apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12),
inference(cnf_transformation,[],[f99]) ).
fof(f163,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,[],[f104]) ).
fof(f166,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,[],[f163]) ).
cnf(c_64,plain,
( ~ relation(X0)
| ~ relation_empty_yielding(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_75,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_76,plain,
( ~ relation(X0)
| ~ function(X0)
| function(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_100,negated_conjecture,
apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12),
inference(cnf_transformation,[],[f161]) ).
cnf(c_101,negated_conjecture,
in(sK12,relation_dom(relation_dom_restriction(sK13,sK11))),
inference(cnf_transformation,[],[f160]) ).
cnf(c_102,negated_conjecture,
function(sK13),
inference(cnf_transformation,[],[f159]) ).
cnf(c_103,negated_conjecture,
relation(sK13),
inference(cnf_transformation,[],[f158]) ).
cnf(c_106,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,[],[f166]) ).
cnf(c_135,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_64,c_75]) ).
cnf(c_240,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_106,c_135]) ).
cnf(c_280,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_240,c_76]) ).
cnf(c_1826,plain,
( ~ relation(sK13)
| ~ function(sK13)
| apply(relation_dom_restriction(sK13,sK11),sK12) = apply(sK13,sK12) ),
inference(superposition,[status(thm)],[c_101,c_280]) ).
cnf(c_1835,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1826,c_100,c_102,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 17:21:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.05/1.17 % SZS status Started for theBenchmark.p
% 2.05/1.17 % SZS status Theorem for theBenchmark.p
% 2.05/1.17
% 2.05/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.05/1.17
% 2.05/1.17 ------ iProver source info
% 2.05/1.17
% 2.05/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.05/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.05/1.17 git: non_committed_changes: false
% 2.05/1.17 git: last_make_outside_of_git: false
% 2.05/1.17
% 2.05/1.17 ------ Parsing...
% 2.05/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.05/1.17
% 2.05/1.17 ------ Preprocessing... sup_sim: 0 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
% 2.05/1.17
% 2.05/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.05/1.17
% 2.05/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.05/1.17 ------ Proving...
% 2.05/1.17 ------ Problem Properties
% 2.05/1.17
% 2.05/1.17
% 2.05/1.17 clauses 50
% 2.05/1.17 conjectures 4
% 2.05/1.17 EPR 26
% 2.05/1.17 Horn 47
% 2.05/1.17 unary 28
% 2.05/1.17 binary 11
% 2.05/1.17 lits 92
% 2.05/1.17 lits eq 13
% 2.05/1.17 fd_pure 0
% 2.05/1.17 fd_pseudo 0
% 2.05/1.17 fd_cond 1
% 2.05/1.17 fd_pseudo_cond 3
% 2.05/1.17 AC symbols 0
% 2.05/1.17
% 2.05/1.17 ------ Schedule dynamic 5 is on
% 2.05/1.17
% 2.05/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.05/1.17
% 2.05/1.17
% 2.05/1.17 ------
% 2.05/1.17 Current options:
% 2.05/1.17 ------
% 2.05/1.17
% 2.05/1.17
% 2.05/1.17
% 2.05/1.17
% 2.05/1.17 ------ Proving...
% 2.05/1.17
% 2.05/1.17
% 2.05/1.17 % SZS status Theorem for theBenchmark.p
% 2.05/1.17
% 2.05/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.05/1.17
% 2.05/1.17
%------------------------------------------------------------------------------