TSTP Solution File: SEU219+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU219+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 : Fri May 3 03:05:03 EDT 2024
% Result : Theorem 1.52s 1.14s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 98 ( 40 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 109 ( 44 ~; 35 |; 22 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn 10 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> function_inverse(X0) = relation_inverse(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_funct_1) ).
fof(f33,axiom,
! [X0] :
( relation(X0)
=> ( relation_dom(X0) = relation_rng(relation_inverse(X0))
& relation_rng(X0) = relation_dom(relation_inverse(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_relat_1) ).
fof(f36,conjecture,
! [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,negated_conjecture,
~ ! [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)) ) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f51,plain,
! [X0] :
( function_inverse(X0) = relation_inverse(X0)
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f52,plain,
! [X0] :
( function_inverse(X0) = relation_inverse(X0)
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f51]) ).
fof(f70,plain,
! [X0] :
( ( relation_dom(X0) = relation_rng(relation_inverse(X0))
& relation_rng(X0) = relation_dom(relation_inverse(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f74,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,[],[f37]) ).
fof(f75,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,[],[f74]) ).
fof(f102,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) )
=> ( ( relation_dom(sK11) != relation_rng(function_inverse(sK11))
| relation_rng(sK11) != relation_dom(function_inverse(sK11)) )
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
( ( relation_dom(sK11) != relation_rng(function_inverse(sK11))
| relation_rng(sK11) != relation_dom(function_inverse(sK11)) )
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f75,f102]) ).
fof(f110,plain,
! [X0] :
( function_inverse(X0) = relation_inverse(X0)
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f154,plain,
! [X0] :
( relation_rng(X0) = relation_dom(relation_inverse(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f155,plain,
! [X0] :
( relation_dom(X0) = relation_rng(relation_inverse(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f158,plain,
relation(sK11),
inference(cnf_transformation,[],[f103]) ).
fof(f159,plain,
function(sK11),
inference(cnf_transformation,[],[f103]) ).
fof(f160,plain,
one_to_one(sK11),
inference(cnf_transformation,[],[f103]) ).
fof(f161,plain,
( relation_dom(sK11) != relation_rng(function_inverse(sK11))
| relation_rng(sK11) != relation_dom(function_inverse(sK11)) ),
inference(cnf_transformation,[],[f103]) ).
cnf(c_53,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(cnf_transformation,[],[f110]) ).
cnf(c_97,plain,
( ~ relation(X0)
| relation_rng(relation_inverse(X0)) = relation_dom(X0) ),
inference(cnf_transformation,[],[f155]) ).
cnf(c_98,plain,
( ~ relation(X0)
| relation_dom(relation_inverse(X0)) = relation_rng(X0) ),
inference(cnf_transformation,[],[f154]) ).
cnf(c_101,negated_conjecture,
( relation_dom(function_inverse(sK11)) != relation_rng(sK11)
| relation_rng(function_inverse(sK11)) != relation_dom(sK11) ),
inference(cnf_transformation,[],[f161]) ).
cnf(c_102,negated_conjecture,
one_to_one(sK11),
inference(cnf_transformation,[],[f160]) ).
cnf(c_103,negated_conjecture,
function(sK11),
inference(cnf_transformation,[],[f159]) ).
cnf(c_104,negated_conjecture,
relation(sK11),
inference(cnf_transformation,[],[f158]) ).
cnf(c_135,plain,
( ~ relation(sK11)
| relation_dom(relation_inverse(sK11)) = relation_rng(sK11) ),
inference(instantiation,[status(thm)],[c_98]) ).
cnf(c_136,plain,
( ~ relation(sK11)
| relation_rng(relation_inverse(sK11)) = relation_dom(sK11) ),
inference(instantiation,[status(thm)],[c_97]) ).
cnf(c_138,plain,
( ~ function(sK11)
| ~ relation(sK11)
| ~ one_to_one(sK11)
| function_inverse(sK11) = relation_inverse(sK11) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_551,plain,
( X0 != sK11
| ~ function(X0)
| ~ relation(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(resolution_lifted,[status(thm)],[c_53,c_102]) ).
cnf(c_552,plain,
( ~ function(sK11)
| ~ relation(sK11)
| function_inverse(sK11) = relation_inverse(sK11) ),
inference(unflattening,[status(thm)],[c_551]) ).
cnf(c_553,plain,
function_inverse(sK11) = relation_inverse(sK11),
inference(global_subsumption_just,[status(thm)],[c_552,c_104,c_103,c_102,c_138]) ).
cnf(c_878,plain,
( relation_dom(relation_inverse(sK11)) != relation_rng(sK11)
| relation_rng(relation_inverse(sK11)) != relation_dom(sK11) ),
inference(light_normalisation,[status(thm)],[c_101,c_553]) ).
cnf(c_894,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_878,c_136,c_135,c_104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU219+3 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 17:41:01 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.52/1.14 % SZS status Started for theBenchmark.p
% 1.52/1.14 % SZS status Theorem for theBenchmark.p
% 1.52/1.14
% 1.52/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.52/1.14
% 1.52/1.14 ------ iProver source info
% 1.52/1.14
% 1.52/1.14 git: date: 2024-05-02 19:28:25 +0000
% 1.52/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.52/1.14 git: non_committed_changes: false
% 1.52/1.14
% 1.52/1.14 ------ Parsing...
% 1.52/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.52/1.14
% 1.52/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 1 sf_s rm: 2 0s sf_e pe_s
% 1.52/1.14
% 1.52/1.14 % SZS status Theorem for theBenchmark.p
% 1.52/1.14
% 1.52/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.14
% 1.52/1.14
%------------------------------------------------------------------------------