TSTP Solution File: SEU025+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU025+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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.23s 1.19s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 17 unt; 0 def)
% Number of atoms : 184 ( 53 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 221 ( 95 ~; 85 |; 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 : 47 ( 1 sgn; 31 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( function(function_inverse(X0))
& relation(function_inverse(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(f29,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',t55_funct_1) ).
fof(f37,conjecture,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(relation_composition(X0,function_inverse(X0)))
& relation_dom(X0) = relation_dom(relation_composition(X0,function_inverse(X0))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t58_funct_1) ).
fof(f38,negated_conjecture,
~ ! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(relation_composition(X0,function_inverse(X0)))
& relation_dom(X0) = relation_dom(relation_composition(X0,function_inverse(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_dom(X0) != relation_rng(relation_composition(X0,function_inverse(X0)))
| relation_dom(X0) != relation_dom(relation_composition(X0,function_inverse(X0))) )
& one_to_one(X0)
& function(X0)
& relation(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f80,plain,
? [X0] :
( ( relation_dom(X0) != relation_rng(relation_composition(X0,function_inverse(X0)))
| relation_dom(X0) != relation_dom(relation_composition(X0,function_inverse(X0))) )
& one_to_one(X0)
& function(X0)
& relation(X0) ),
inference(flattening,[],[f79]) ).
fof(f108,plain,
( ? [X0] :
( ( relation_dom(X0) != relation_rng(relation_composition(X0,function_inverse(X0)))
| relation_dom(X0) != relation_dom(relation_composition(X0,function_inverse(X0))) )
& one_to_one(X0)
& function(X0)
& relation(X0) )
=> ( ( relation_dom(sK11) != relation_rng(relation_composition(sK11,function_inverse(sK11)))
| relation_dom(sK11) != relation_dom(relation_composition(sK11,function_inverse(sK11))) )
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ( relation_dom(sK11) != relation_rng(relation_composition(sK11,function_inverse(sK11)))
| relation_dom(sK11) != relation_dom(relation_composition(sK11,function_inverse(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_dom(sK11) != relation_rng(relation_composition(sK11,function_inverse(sK11)))
| relation_dom(sK11) != relation_dom(relation_composition(sK11,function_inverse(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(sK11,function_inverse(sK11))) != relation_dom(sK11)
| relation_rng(relation_composition(sK11,function_inverse(sK11))) != relation_dom(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_568,plain,
( X0 != sK11
| ~ function(X0)
| ~ relation(X0)
| relation_dom(function_inverse(X0)) = relation_rng(X0) ),
inference(resolution_lifted,[status(thm)],[c_103,c_105]) ).
cnf(c_569,plain,
( ~ function(sK11)
| ~ relation(sK11)
| relation_dom(function_inverse(sK11)) = relation_rng(sK11) ),
inference(unflattening,[status(thm)],[c_568]) ).
cnf(c_570,plain,
relation_dom(function_inverse(sK11)) = relation_rng(sK11),
inference(global_subsumption_just,[status(thm)],[c_569,c_107,c_106,c_105,c_137]) ).
cnf(c_4424,plain,
subset(relation_rng(X0),relation_rng(X0)),
inference(instantiation,[status(thm)],[c_94]) ).
cnf(c_4426,plain,
subset(relation_rng(sK11),relation_rng(sK11)),
inference(instantiation,[status(thm)],[c_4424]) ).
cnf(c_4548,plain,
( ~ subset(relation_rng(X0),relation_rng(sK11))
| ~ relation(function_inverse(sK11))
| ~ relation(X0)
| relation_dom(relation_composition(X0,function_inverse(sK11))) = relation_dom(X0) ),
inference(superposition,[status(thm)],[c_570,c_99]) ).
cnf(c_4563,plain,
( ~ subset(relation_rng(sK11),relation_rng(sK11))
| ~ relation(function_inverse(sK11))
| ~ relation(sK11)
| relation_dom(relation_composition(sK11,function_inverse(sK11))) = relation_dom(sK11) ),
inference(instantiation,[status(thm)],[c_4548]) ).
cnf(c_4609,negated_conjecture,
relation_rng(relation_composition(sK11,function_inverse(sK11))) != relation_dom(sK11),
inference(global_subsumption_just,[status(thm)],[c_104,c_107,c_106,c_131,c_104,c_4426,c_4563]) ).
cnf(c_4982,plain,
( ~ subset(relation_rng(sK11),relation_rng(X0))
| ~ relation(function_inverse(sK11))
| ~ relation(X0)
| relation_rng(relation_composition(X0,function_inverse(sK11))) = relation_rng(function_inverse(sK11)) ),
inference(superposition,[status(thm)],[c_570,c_100]) ).
cnf(c_5025,plain,
( ~ subset(relation_rng(sK11),relation_rng(sK11))
| ~ relation(function_inverse(sK11))
| ~ relation(sK11)
| relation_rng(relation_composition(sK11,function_inverse(sK11))) = relation_rng(function_inverse(sK11)) ),
inference(instantiation,[status(thm)],[c_4982]) ).
cnf(c_5567,plain,
( ~ subset(relation_rng(sK11),relation_rng(X0))
| ~ relation(X0)
| relation_rng(relation_composition(X0,function_inverse(sK11))) = relation_rng(function_inverse(sK11)) ),
inference(global_subsumption_just,[status(thm)],[c_4982,c_107,c_106,c_131,c_4982]) ).
cnf(c_5570,plain,
( ~ relation(sK11)
| relation_rng(relation_composition(sK11,function_inverse(sK11))) = relation_rng(function_inverse(sK11)) ),
inference(superposition,[status(thm)],[c_94,c_5567]) ).
cnf(c_6406,plain,
relation_rng(relation_composition(sK11,function_inverse(sK11))) = relation_rng(function_inverse(sK11)),
inference(global_subsumption_just,[status(thm)],[c_5570,c_107,c_106,c_131,c_4426,c_5025]) ).
cnf(c_6416,plain,
relation_rng(function_inverse(sK11)) != relation_dom(sK11),
inference(superposition,[status(thm)],[c_6406,c_4609]) ).
cnf(c_6417,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6416,c_138,c_105,c_106,c_107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU025+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n031.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 17:49:05 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.23/1.19 % SZS status Started for theBenchmark.p
% 3.23/1.19 % SZS status Theorem for theBenchmark.p
% 3.23/1.19
% 3.23/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.23/1.19
% 3.23/1.19 ------ iProver source info
% 3.23/1.19
% 3.23/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.23/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.23/1.19 git: non_committed_changes: false
% 3.23/1.19 git: last_make_outside_of_git: false
% 3.23/1.19
% 3.23/1.19 ------ Parsing...
% 3.23/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.23/1.19
% 3.23/1.19 ------ 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.23/1.19
% 3.23/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.23/1.19
% 3.23/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.23/1.19 ------ Proving...
% 3.23/1.19 ------ Problem Properties
% 3.23/1.19
% 3.23/1.19
% 3.23/1.19 clauses 60
% 3.23/1.19 conjectures 3
% 3.23/1.19 EPR 29
% 3.23/1.19 Horn 58
% 3.23/1.19 unary 27
% 3.23/1.19 binary 17
% 3.23/1.19 lits 113
% 3.23/1.19 lits eq 12
% 3.23/1.19 fd_pure 0
% 3.23/1.19 fd_pseudo 0
% 3.23/1.19 fd_cond 1
% 3.23/1.19 fd_pseudo_cond 1
% 3.23/1.19 AC symbols 0
% 3.23/1.19
% 3.23/1.19 ------ Input Options Time Limit: Unbounded
% 3.23/1.19
% 3.23/1.19
% 3.23/1.19 ------
% 3.23/1.19 Current options:
% 3.23/1.19 ------
% 3.23/1.19
% 3.23/1.19
% 3.23/1.19
% 3.23/1.19
% 3.23/1.19 ------ Proving...
% 3.23/1.19
% 3.23/1.19
% 3.23/1.19 % SZS status Theorem for theBenchmark.p
% 3.23/1.19
% 3.23/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.23/1.19
% 3.23/1.19
%------------------------------------------------------------------------------