TSTP Solution File: SEU032+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU032+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:28 EDT 2023
% Result : Theorem 0.50s 1.25s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 13 unt; 0 def)
% Number of atoms : 232 ( 57 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 309 ( 137 ~; 123 |; 34 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn; 28 !; 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(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(f38,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_composition(function_inverse(X0),X0) = identity_relation(relation_rng(X0))
& relation_composition(X0,function_inverse(X0)) = identity_relation(relation_dom(X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t61_funct_1) ).
fof(f39,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> one_to_one(function_inverse(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t62_funct_1) ).
fof(f40,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( ( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
& relation_rng(X0) = relation_dom(X1)
& one_to_one(X0) )
=> function_inverse(X0) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_funct_1) ).
fof(f41,conjecture,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> function_inverse(function_inverse(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_funct_1) ).
fof(f42,negated_conjecture,
~ ! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> function_inverse(function_inverse(X0)) = X0 ) ),
inference(negated_conjecture,[],[f41]) ).
fof(f55,plain,
! [X0] :
( ( function(function_inverse(X0))
& relation(function_inverse(X0)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f56,plain,
! [X0] :
( ( function(function_inverse(X0))
& relation(function_inverse(X0)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f55]) ).
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(ennf_transformation,[],[f36]) ).
fof(f79,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,[],[f78]) ).
fof(f81,plain,
! [X0] :
( ( relation_composition(function_inverse(X0),X0) = identity_relation(relation_rng(X0))
& relation_composition(X0,function_inverse(X0)) = identity_relation(relation_dom(X0)) )
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f82,plain,
! [X0] :
( ( relation_composition(function_inverse(X0),X0) = identity_relation(relation_rng(X0))
& relation_composition(X0,function_inverse(X0)) = identity_relation(relation_dom(X0)) )
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f81]) ).
fof(f83,plain,
! [X0] :
( one_to_one(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f84,plain,
! [X0] :
( one_to_one(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
! [X0] :
( ! [X1] :
( function_inverse(X0) = X1
| relation_composition(X0,X1) != identity_relation(relation_dom(X0))
| relation_rng(X0) != relation_dom(X1)
| ~ one_to_one(X0)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f86,plain,
! [X0] :
( ! [X1] :
( function_inverse(X0) = X1
| relation_composition(X0,X1) != identity_relation(relation_dom(X0))
| relation_rng(X0) != relation_dom(X1)
| ~ one_to_one(X0)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f85]) ).
fof(f87,plain,
? [X0] :
( function_inverse(function_inverse(X0)) != X0
& one_to_one(X0)
& function(X0)
& relation(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f88,plain,
? [X0] :
( function_inverse(function_inverse(X0)) != X0
& one_to_one(X0)
& function(X0)
& relation(X0) ),
inference(flattening,[],[f87]) ).
fof(f114,plain,
( ? [X0] :
( function_inverse(function_inverse(X0)) != X0
& one_to_one(X0)
& function(X0)
& relation(X0) )
=> ( sK11 != function_inverse(function_inverse(sK11))
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( sK11 != function_inverse(function_inverse(sK11))
& one_to_one(sK11)
& function(sK11)
& relation(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f88,f114]) ).
fof(f122,plain,
! [X0] :
( relation(function_inverse(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f123,plain,
! [X0] :
( function(function_inverse(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f171,plain,
! [X0] :
( relation_rng(X0) = relation_dom(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f172,plain,
! [X0] :
( relation_dom(X0) = relation_rng(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f175,plain,
! [X0] :
( relation_composition(function_inverse(X0),X0) = identity_relation(relation_rng(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f176,plain,
! [X0] :
( one_to_one(function_inverse(X0))
| ~ one_to_one(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f177,plain,
! [X0,X1] :
( function_inverse(X0) = X1
| relation_composition(X0,X1) != identity_relation(relation_dom(X0))
| relation_rng(X0) != relation_dom(X1)
| ~ one_to_one(X0)
| ~ function(X1)
| ~ relation(X1)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f178,plain,
relation(sK11),
inference(cnf_transformation,[],[f115]) ).
fof(f179,plain,
function(sK11),
inference(cnf_transformation,[],[f115]) ).
fof(f180,plain,
one_to_one(sK11),
inference(cnf_transformation,[],[f115]) ).
fof(f181,plain,
sK11 != function_inverse(function_inverse(sK11)),
inference(cnf_transformation,[],[f115]) ).
cnf(c_53,plain,
( ~ function(X0)
| ~ relation(X0)
| function(function_inverse(X0)) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_54,plain,
( ~ function(X0)
| ~ relation(X0)
| relation(function_inverse(X0)) ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_102,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| relation_rng(function_inverse(X0)) = relation_dom(X0) ),
inference(cnf_transformation,[],[f172]) ).
cnf(c_103,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| relation_dom(function_inverse(X0)) = relation_rng(X0) ),
inference(cnf_transformation,[],[f171]) ).
cnf(c_105,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| relation_composition(function_inverse(X0),X0) = identity_relation(relation_rng(X0)) ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_107,plain,
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| one_to_one(function_inverse(X0)) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_108,plain,
( relation_composition(X0,X1) != identity_relation(relation_dom(X0))
| relation_dom(X1) != relation_rng(X0)
| ~ function(X0)
| ~ function(X1)
| ~ relation(X0)
| ~ relation(X1)
| ~ one_to_one(X0)
| function_inverse(X0) = X1 ),
inference(cnf_transformation,[],[f177]) ).
cnf(c_109,negated_conjecture,
function_inverse(function_inverse(sK11)) != sK11,
inference(cnf_transformation,[],[f181]) ).
cnf(c_110,negated_conjecture,
one_to_one(sK11),
inference(cnf_transformation,[],[f180]) ).
cnf(c_111,negated_conjecture,
function(sK11),
inference(cnf_transformation,[],[f179]) ).
cnf(c_112,negated_conjecture,
relation(sK11),
inference(cnf_transformation,[],[f178]) ).
cnf(c_2575,plain,
( ~ function(sK11)
| ~ relation(sK11)
| relation_rng(function_inverse(sK11)) = relation_dom(sK11) ),
inference(superposition,[status(thm)],[c_110,c_102]) ).
cnf(c_2583,plain,
relation_rng(function_inverse(sK11)) = relation_dom(sK11),
inference(forward_subsumption_resolution,[status(thm)],[c_2575,c_112,c_111]) ).
cnf(c_2631,plain,
( ~ function(sK11)
| ~ relation(sK11)
| relation_dom(function_inverse(sK11)) = relation_rng(sK11) ),
inference(superposition,[status(thm)],[c_110,c_103]) ).
cnf(c_2639,plain,
relation_dom(function_inverse(sK11)) = relation_rng(sK11),
inference(forward_subsumption_resolution,[status(thm)],[c_2631,c_112,c_111]) ).
cnf(c_2685,plain,
( ~ function(sK11)
| ~ relation(sK11)
| relation_composition(function_inverse(sK11),sK11) = identity_relation(relation_rng(sK11)) ),
inference(superposition,[status(thm)],[c_110,c_105]) ).
cnf(c_2693,plain,
relation_composition(function_inverse(sK11),sK11) = identity_relation(relation_rng(sK11)),
inference(forward_subsumption_resolution,[status(thm)],[c_2685,c_112,c_111]) ).
cnf(c_3159,plain,
( relation_composition(function_inverse(sK11),X0) != identity_relation(relation_rng(sK11))
| relation_rng(function_inverse(sK11)) != relation_dom(X0)
| ~ function(function_inverse(sK11))
| ~ relation(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11))
| ~ function(X0)
| ~ relation(X0)
| function_inverse(function_inverse(sK11)) = X0 ),
inference(superposition,[status(thm)],[c_2639,c_108]) ).
cnf(c_3176,plain,
( relation_composition(function_inverse(sK11),X0) != identity_relation(relation_rng(sK11))
| relation_dom(X0) != relation_dom(sK11)
| ~ function(function_inverse(sK11))
| ~ relation(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11))
| ~ function(X0)
| ~ relation(X0)
| function_inverse(function_inverse(sK11)) = X0 ),
inference(light_normalisation,[status(thm)],[c_3159,c_2583]) ).
cnf(c_5080,plain,
( relation_dom(sK11) != relation_dom(sK11)
| ~ function(function_inverse(sK11))
| ~ relation(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11))
| ~ function(sK11)
| ~ relation(sK11)
| function_inverse(function_inverse(sK11)) = sK11 ),
inference(superposition,[status(thm)],[c_2693,c_3176]) ).
cnf(c_5081,plain,
( ~ function(function_inverse(sK11))
| ~ relation(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11))
| ~ function(sK11)
| ~ relation(sK11)
| function_inverse(function_inverse(sK11)) = sK11 ),
inference(equality_resolution_simp,[status(thm)],[c_5080]) ).
cnf(c_5082,plain,
( ~ function(function_inverse(sK11))
| ~ relation(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5081,c_109,c_112,c_111]) ).
cnf(c_5095,plain,
( ~ function(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11))
| ~ function(sK11)
| ~ relation(sK11) ),
inference(superposition,[status(thm)],[c_54,c_5082]) ).
cnf(c_5096,plain,
( ~ function(function_inverse(sK11))
| ~ one_to_one(function_inverse(sK11)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5095,c_112,c_111]) ).
cnf(c_5105,plain,
( ~ one_to_one(function_inverse(sK11))
| ~ function(sK11)
| ~ relation(sK11) ),
inference(superposition,[status(thm)],[c_53,c_5096]) ).
cnf(c_5106,plain,
~ one_to_one(function_inverse(sK11)),
inference(forward_subsumption_resolution,[status(thm)],[c_5105,c_112,c_111]) ).
cnf(c_5282,plain,
( ~ function(sK11)
| ~ relation(sK11)
| ~ one_to_one(sK11) ),
inference(superposition,[status(thm)],[c_107,c_5106]) ).
cnf(c_5283,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5282,c_110,c_112,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.16 % Problem : SEU032+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.17 % Command : run_iprover %s %d THM
% 0.13/0.38 % Computer : n004.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Wed Aug 23 12:09:08 EDT 2023
% 0.13/0.38 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.50/1.25 % SZS status Started for theBenchmark.p
% 0.50/1.25 % SZS status Theorem for theBenchmark.p
% 0.50/1.25
% 0.50/1.25 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.50/1.25
% 0.50/1.25 ------ iProver source info
% 0.50/1.25
% 0.50/1.25 git: date: 2023-05-31 18:12:56 +0000
% 0.50/1.25 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.50/1.25 git: non_committed_changes: false
% 0.50/1.25 git: last_make_outside_of_git: false
% 0.50/1.25
% 0.50/1.25 ------ Parsing...
% 0.50/1.25 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.50/1.25
% 0.50/1.25 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.50/1.25
% 0.50/1.25 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.50/1.25
% 0.50/1.25 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.50/1.25 ------ Proving...
% 0.50/1.25 ------ Problem Properties
% 0.50/1.25
% 0.50/1.25
% 0.50/1.25 clauses 61
% 0.50/1.25 conjectures 4
% 0.50/1.25 EPR 29
% 0.50/1.25 Horn 59
% 0.50/1.25 unary 28
% 0.50/1.25 binary 13
% 0.50/1.25 lits 126
% 0.50/1.25 lits eq 10
% 0.50/1.25 fd_pure 0
% 0.50/1.25 fd_pseudo 0
% 0.50/1.25 fd_cond 1
% 0.50/1.25 fd_pseudo_cond 2
% 0.50/1.25 AC symbols 0
% 0.50/1.25
% 0.50/1.25 ------ Schedule dynamic 5 is on
% 0.50/1.25
% 0.50/1.25 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.50/1.25
% 0.50/1.25
% 0.50/1.25 ------
% 0.50/1.25 Current options:
% 0.50/1.25 ------
% 0.50/1.25
% 0.50/1.25
% 0.50/1.25
% 0.50/1.25
% 0.50/1.25 ------ Proving...
% 0.50/1.25
% 0.50/1.25
% 0.50/1.25 % SZS status Theorem for theBenchmark.p
% 0.50/1.25
% 0.50/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.25
% 0.50/1.25
%------------------------------------------------------------------------------