TSTP Solution File: SEU026+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU026+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:03:26 EDT 2023
% Result : Theorem 3.75s 1.18s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 15 unt; 0 def)
% Number of atoms : 188 ( 54 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 228 ( 98 ~; 89 |; 27 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 1 sgn; 31 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( function(function_inverse(X0))
& relation(function_inverse(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(f29,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f33,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> ( subset(relation_rng(X0),relation_dom(X1))
=> relation_dom(X0) = relation_dom(relation_composition(X0,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t46_relat_1) ).
fof(f34,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> ( subset(relation_dom(X0),relation_rng(X1))
=> relation_rng(X0) = relation_rng(relation_composition(X1,X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t47_relat_1) ).
fof(f36,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_funct_1) ).
fof(f37,conjecture,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_rng(X0) = relation_rng(relation_composition(function_inverse(X0),X0))
& relation_rng(X0) = relation_dom(relation_composition(function_inverse(X0),X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t59_funct_1) ).
fof(f38,negated_conjecture,
~ ! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_rng(X0) = relation_rng(relation_composition(function_inverse(X0),X0))
& relation_rng(X0) = relation_dom(relation_composition(function_inverse(X0),X0)) ) ) ),
inference(negated_conjecture,[],[f37]) ).
fof(f43,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f29]) ).
fof(f51,plain,
! [X0] :
( ( function(function_inverse(X0))
& relation(function_inverse(X0)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f52,plain,
! [X0] :
( ( function(function_inverse(X0))
& relation(function_inverse(X0)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f51]) ).
fof(f71,plain,
! [X0] :
( ! [X1] :
( relation_dom(X0) = relation_dom(relation_composition(X0,X1))
| ~ subset(relation_rng(X0),relation_dom(X1))
| ~ relation(X1) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f72,plain,
! [X0] :
( ! [X1] :
( relation_dom(X0) = relation_dom(relation_composition(X0,X1))
| ~ subset(relation_rng(X0),relation_dom(X1))
| ~ relation(X1) )
| ~ relation(X0) ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
! [X0] :
( ! [X1] :
( relation_rng(X0) = relation_rng(relation_composition(X1,X0))
| ~ subset(relation_dom(X0),relation_rng(X1))
| ~ relation(X1) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( relation_rng(X0) = relation_rng(relation_composition(X1,X0))
| ~ subset(relation_dom(X0),relation_rng(X1))
| ~ relation(X1) )
| ~ relation(X0) ),
inference(flattening,[],[f73]) ).
fof(f77,plain,
! [X0] :
( ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) )
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f78,plain,
! [X0] :
( ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) )
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
? [X0] :
( ( relation_rng(X0) != relation_rng(relation_composition(function_inverse(X0),X0))
| relation_rng(X0) != relation_dom(relation_composition(function_inverse(X0),X0)) )
& one_to_one(X0)
& function(X0)
& relation(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f80,plain,
? [X0] :
( ( relation_rng(X0) != relation_rng(relation_composition(function_inverse(X0),X0))
| relation_rng(X0) != relation_dom(relation_composition(function_inverse(X0),X0)) )
& one_to_one(X0)
& function(X0)
& relation(X0) ),
inference(flattening,[],[f79]) ).
fof(f108,plain,
( ? [X0] :
( ( relation_rng(X0) != relation_rng(relation_composition(function_inverse(X0),X0))
| relation_rng(X0) != relation_dom(relation_composition(function_inverse(X0),X0)) )
& one_to_one(X0)
& function(X0)
& relation(X0) )
=> ( ( relation_rng(sK11) != relation_rng(relation_composition(function_inverse(sK11),sK11))
| relation_rng(sK11) != relation_dom(relation_composition(function_inverse(sK11),sK11)) )
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ( relation_rng(sK11) != relation_rng(relation_composition(function_inverse(sK11),sK11))
| relation_rng(sK11) != relation_dom(relation_composition(function_inverse(sK11),sK11)) )
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f80,f108]) ).
fof(f116,plain,
! [X0] :
( relation(function_inverse(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f157,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f43]) ).
fof(f162,plain,
! [X0,X1] :
( relation_dom(X0) = relation_dom(relation_composition(X0,X1))
| ~ subset(relation_rng(X0),relation_dom(X1))
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f163,plain,
! [X0,X1] :
( relation_rng(X0) = relation_rng(relation_composition(X1,X0))
| ~ subset(relation_dom(X0),relation_rng(X1))
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f165,plain,
! [X0] :
( relation_rng(X0) = relation_dom(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f166,plain,
! [X0] :
( relation_dom(X0) = relation_rng(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f167,plain,
relation(sK11),
inference(cnf_transformation,[],[f109]) ).
fof(f168,plain,
function(sK11),
inference(cnf_transformation,[],[f109]) ).
fof(f169,plain,
one_to_one(sK11),
inference(cnf_transformation,[],[f109]) ).
fof(f170,plain,
( relation_rng(sK11) != relation_rng(relation_composition(function_inverse(sK11),sK11))
| relation_rng(sK11) != relation_dom(relation_composition(function_inverse(sK11),sK11)) ),
inference(cnf_transformation,[],[f109]) ).
cnf(c_54,plain,
( ~ function(X0)
| ~ relation(X0)
| relation(function_inverse(X0)) ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_94,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f157]) ).
cnf(c_99,plain,
( ~ subset(relation_rng(X0),relation_dom(X1))
| ~ relation(X0)
| ~ relation(X1)
| relation_dom(relation_composition(X0,X1)) = relation_dom(X0) ),
inference(cnf_transformation,[],[f162]) ).
cnf(c_100,plain,
( ~ subset(relation_dom(X0),relation_rng(X1))
| ~ relation(X0)
| ~ relation(X1)
| relation_rng(relation_composition(X1,X0)) = relation_rng(X0) ),
inference(cnf_transformation,[],[f163]) ).
cnf(c_102,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| relation_rng(function_inverse(X0)) = relation_dom(X0) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_103,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| relation_dom(function_inverse(X0)) = relation_rng(X0) ),
inference(cnf_transformation,[],[f165]) ).
cnf(c_104,negated_conjecture,
( relation_dom(relation_composition(function_inverse(sK11),sK11)) != relation_rng(sK11)
| relation_rng(relation_composition(function_inverse(sK11),sK11)) != relation_rng(sK11) ),
inference(cnf_transformation,[],[f170]) ).
cnf(c_105,negated_conjecture,
one_to_one(sK11),
inference(cnf_transformation,[],[f169]) ).
cnf(c_106,negated_conjecture,
function(sK11),
inference(cnf_transformation,[],[f168]) ).
cnf(c_107,negated_conjecture,
relation(sK11),
inference(cnf_transformation,[],[f167]) ).
cnf(c_131,plain,
( ~ function(sK11)
| ~ relation(sK11)
| relation(function_inverse(sK11)) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_137,plain,
( ~ function(sK11)
| ~ relation(sK11)
| ~ one_to_one(sK11)
| relation_dom(function_inverse(sK11)) = relation_rng(sK11) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_138,plain,
( ~ function(sK11)
| ~ relation(sK11)
| ~ one_to_one(sK11)
| relation_rng(function_inverse(sK11)) = relation_dom(sK11) ),
inference(instantiation,[status(thm)],[c_102]) ).
cnf(c_575,plain,
( X0 != sK11
| ~ function(X0)
| ~ relation(X0)
| relation_rng(function_inverse(X0)) = relation_dom(X0) ),
inference(resolution_lifted,[status(thm)],[c_102,c_105]) ).
cnf(c_576,plain,
( ~ function(sK11)
| ~ relation(sK11)
| relation_rng(function_inverse(sK11)) = relation_dom(sK11) ),
inference(unflattening,[status(thm)],[c_575]) ).
cnf(c_577,plain,
relation_rng(function_inverse(sK11)) = relation_dom(sK11),
inference(global_subsumption_just,[status(thm)],[c_576,c_107,c_106,c_105,c_138]) ).
cnf(c_4434,plain,
subset(relation_dom(X0),relation_dom(X0)),
inference(instantiation,[status(thm)],[c_94]) ).
cnf(c_4436,plain,
subset(relation_dom(sK11),relation_dom(sK11)),
inference(instantiation,[status(thm)],[c_4434]) ).
cnf(c_4543,plain,
( ~ subset(relation_dom(sK11),relation_dom(X0))
| ~ relation(function_inverse(sK11))
| ~ relation(X0)
| relation_dom(relation_composition(function_inverse(sK11),X0)) = relation_dom(function_inverse(sK11)) ),
inference(superposition,[status(thm)],[c_577,c_99]) ).
cnf(c_4566,plain,
( ~ subset(relation_dom(sK11),relation_dom(sK11))
| ~ relation(function_inverse(sK11))
| ~ relation(sK11)
| relation_dom(relation_composition(function_inverse(sK11),sK11)) = relation_dom(function_inverse(sK11)) ),
inference(instantiation,[status(thm)],[c_4543]) ).
cnf(c_4888,plain,
( ~ subset(relation_dom(sK11),relation_dom(X0))
| ~ relation(function_inverse(sK11))
| ~ relation(X0)
| relation_dom(relation_composition(function_inverse(sK11),X0)) = relation_dom(function_inverse(sK11)) ),
inference(superposition,[status(thm)],[c_577,c_99]) ).
cnf(c_4909,plain,
( ~ subset(relation_dom(X0),relation_dom(sK11))
| ~ relation(function_inverse(sK11))
| ~ relation(X0)
| relation_rng(relation_composition(function_inverse(sK11),X0)) = relation_rng(X0) ),
inference(superposition,[status(thm)],[c_577,c_100]) ).
cnf(c_4920,plain,
( ~ subset(relation_dom(sK11),relation_dom(sK11))
| ~ relation(function_inverse(sK11))
| ~ relation(sK11)
| relation_rng(relation_composition(function_inverse(sK11),sK11)) = relation_rng(sK11) ),
inference(instantiation,[status(thm)],[c_4909]) ).
cnf(c_5136,plain,
( ~ subset(relation_dom(sK11),relation_dom(X0))
| ~ relation(X0)
| relation_dom(relation_composition(function_inverse(sK11),X0)) = relation_dom(function_inverse(sK11)) ),
inference(global_subsumption_just,[status(thm)],[c_4888,c_107,c_106,c_131,c_4543]) ).
cnf(c_5139,plain,
( ~ relation(sK11)
| relation_dom(relation_composition(function_inverse(sK11),sK11)) = relation_dom(function_inverse(sK11)) ),
inference(superposition,[status(thm)],[c_94,c_5136]) ).
cnf(c_6033,plain,
relation_dom(relation_composition(function_inverse(sK11),sK11)) = relation_dom(function_inverse(sK11)),
inference(global_subsumption_just,[status(thm)],[c_5139,c_107,c_106,c_131,c_4436,c_4566]) ).
cnf(c_6043,plain,
( relation_rng(relation_composition(function_inverse(sK11),sK11)) != relation_rng(sK11)
| relation_dom(function_inverse(sK11)) != relation_rng(sK11) ),
inference(superposition,[status(thm)],[c_6033,c_104]) ).
cnf(c_6044,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6043,c_4920,c_4436,c_137,c_131,c_105,c_106,c_107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU026+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 23:44:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.75/1.18 % SZS status Started for theBenchmark.p
% 3.75/1.18 % SZS status Theorem for theBenchmark.p
% 3.75/1.18
% 3.75/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.75/1.18
% 3.75/1.18 ------ iProver source info
% 3.75/1.18
% 3.75/1.18 git: date: 2023-05-31 18:12:56 +0000
% 3.75/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.75/1.18 git: non_committed_changes: false
% 3.75/1.18 git: last_make_outside_of_git: false
% 3.75/1.18
% 3.75/1.18 ------ Parsing...
% 3.75/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.75/1.18
% 3.75/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.75/1.18
% 3.75/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.75/1.18
% 3.75/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.75/1.18 ------ Proving...
% 3.75/1.18 ------ Problem Properties
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 clauses 60
% 3.75/1.18 conjectures 3
% 3.75/1.18 EPR 29
% 3.75/1.18 Horn 58
% 3.75/1.18 unary 27
% 3.75/1.18 binary 17
% 3.75/1.18 lits 113
% 3.75/1.18 lits eq 12
% 3.75/1.18 fd_pure 0
% 3.75/1.18 fd_pseudo 0
% 3.75/1.18 fd_cond 1
% 3.75/1.18 fd_pseudo_cond 1
% 3.75/1.18 AC symbols 0
% 3.75/1.18
% 3.75/1.18 ------ Input Options Time Limit: Unbounded
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 ------
% 3.75/1.18 Current options:
% 3.75/1.18 ------
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 ------ Proving...
% 3.75/1.18
% 3.75/1.18
% 3.75/1.18 % SZS status Theorem for theBenchmark.p
% 3.75/1.18
% 3.75/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.18
% 3.75/1.18
%------------------------------------------------------------------------------