TSTP Solution File: SEU020+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU020+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 2.66s 1.16s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 21 unt; 0 def)
% Number of atoms : 147 ( 21 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 167 ( 61 ~; 53 |; 41 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 1 sgn; 22 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( relation_dom(relation_composition(X1,X0)) = relation_dom(X1)
=> subset(relation_rng(X1),relation_dom(X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_funct_1) ).
fof(f32,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( ( subset(relation_rng(X1),relation_dom(X0))
& one_to_one(relation_composition(X1,X0)) )
=> one_to_one(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_funct_1) ).
fof(f34,axiom,
! [X0] : one_to_one(identity_relation(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t52_funct_1) ).
fof(f35,conjecture,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( ? [X1] :
( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
& function(X1)
& relation(X1) )
=> one_to_one(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_funct_1) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( ( function(X0)
& relation(X0) )
=> ( ? [X1] :
( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
& function(X1)
& relation(X1) )
=> one_to_one(X0) ) ),
inference(negated_conjecture,[],[f35]) ).
fof(f39,axiom,
! [X0] :
( relation_rng(identity_relation(X0)) = X0
& relation_dom(identity_relation(X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t71_relat_1) ).
fof(f64,plain,
! [X0] :
( ! [X1] :
( subset(relation_rng(X1),relation_dom(X0))
| relation_dom(relation_composition(X1,X0)) != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( subset(relation_rng(X1),relation_dom(X0))
| relation_dom(relation_composition(X1,X0)) != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f64]) ).
fof(f68,plain,
! [X0] :
( ! [X1] :
( one_to_one(X1)
| ~ subset(relation_rng(X1),relation_dom(X0))
| ~ one_to_one(relation_composition(X1,X0))
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f69,plain,
! [X0] :
( ! [X1] :
( one_to_one(X1)
| ~ subset(relation_rng(X1),relation_dom(X0))
| ~ one_to_one(relation_composition(X1,X0))
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f68]) ).
fof(f72,plain,
? [X0] :
( ~ one_to_one(X0)
& ? [X1] :
( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
& function(X1)
& relation(X1) )
& function(X0)
& relation(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f73,plain,
? [X0] :
( ~ one_to_one(X0)
& ? [X1] :
( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
& function(X1)
& relation(X1) )
& function(X0)
& relation(X0) ),
inference(flattening,[],[f72]) ).
fof(f97,plain,
( ? [X0] :
( ~ one_to_one(X0)
& ? [X1] :
( relation_composition(X0,X1) = identity_relation(relation_dom(X0))
& function(X1)
& relation(X1) )
& function(X0)
& relation(X0) )
=> ( ~ one_to_one(sK9)
& ? [X1] :
( relation_composition(sK9,X1) = identity_relation(relation_dom(sK9))
& function(X1)
& relation(X1) )
& function(sK9)
& relation(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
( ? [X1] :
( relation_composition(sK9,X1) = identity_relation(relation_dom(sK9))
& function(X1)
& relation(X1) )
=> ( identity_relation(relation_dom(sK9)) = relation_composition(sK9,sK10)
& function(sK10)
& relation(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
( ~ one_to_one(sK9)
& identity_relation(relation_dom(sK9)) = relation_composition(sK9,sK10)
& function(sK10)
& relation(sK10)
& function(sK9)
& relation(sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f73,f98,f97]) ).
fof(f141,plain,
! [X0,X1] :
( subset(relation_rng(X1),relation_dom(X0))
| relation_dom(relation_composition(X1,X0)) != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f145,plain,
! [X0,X1] :
( one_to_one(X1)
| ~ subset(relation_rng(X1),relation_dom(X0))
| ~ one_to_one(relation_composition(X1,X0))
| ~ function(X1)
| ~ relation(X1)
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f147,plain,
! [X0] : one_to_one(identity_relation(X0)),
inference(cnf_transformation,[],[f34]) ).
fof(f148,plain,
relation(sK9),
inference(cnf_transformation,[],[f99]) ).
fof(f149,plain,
function(sK9),
inference(cnf_transformation,[],[f99]) ).
fof(f150,plain,
relation(sK10),
inference(cnf_transformation,[],[f99]) ).
fof(f151,plain,
function(sK10),
inference(cnf_transformation,[],[f99]) ).
fof(f152,plain,
identity_relation(relation_dom(sK9)) = relation_composition(sK9,sK10),
inference(cnf_transformation,[],[f99]) ).
fof(f153,plain,
~ one_to_one(sK9),
inference(cnf_transformation,[],[f99]) ).
fof(f156,plain,
! [X0] : relation_dom(identity_relation(X0)) = X0,
inference(cnf_transformation,[],[f39]) ).
cnf(c_90,plain,
( relation_dom(relation_composition(X0,X1)) != relation_dom(X0)
| ~ function(X0)
| ~ function(X1)
| ~ relation(X0)
| ~ relation(X1)
| subset(relation_rng(X0),relation_dom(X1)) ),
inference(cnf_transformation,[],[f141]) ).
cnf(c_94,plain,
( ~ subset(relation_rng(X0),relation_dom(X1))
| ~ one_to_one(relation_composition(X0,X1))
| ~ function(X0)
| ~ function(X1)
| ~ relation(X0)
| ~ relation(X1)
| one_to_one(X0) ),
inference(cnf_transformation,[],[f145]) ).
cnf(c_96,plain,
one_to_one(identity_relation(X0)),
inference(cnf_transformation,[],[f147]) ).
cnf(c_97,negated_conjecture,
~ one_to_one(sK9),
inference(cnf_transformation,[],[f153]) ).
cnf(c_98,negated_conjecture,
relation_composition(sK9,sK10) = identity_relation(relation_dom(sK9)),
inference(cnf_transformation,[],[f152]) ).
cnf(c_99,negated_conjecture,
function(sK10),
inference(cnf_transformation,[],[f151]) ).
cnf(c_100,negated_conjecture,
relation(sK10),
inference(cnf_transformation,[],[f150]) ).
cnf(c_101,negated_conjecture,
function(sK9),
inference(cnf_transformation,[],[f149]) ).
cnf(c_102,negated_conjecture,
relation(sK9),
inference(cnf_transformation,[],[f148]) ).
cnf(c_106,plain,
relation_dom(identity_relation(X0)) = X0,
inference(cnf_transformation,[],[f156]) ).
cnf(c_2746,plain,
relation_dom(relation_composition(sK9,sK10)) = relation_dom(sK9),
inference(superposition,[status(thm)],[c_98,c_106]) ).
cnf(c_2747,plain,
one_to_one(relation_composition(sK9,sK10)),
inference(superposition,[status(thm)],[c_98,c_96]) ).
cnf(c_3402,plain,
( ~ function(sK9)
| ~ function(sK10)
| ~ relation(sK9)
| ~ relation(sK10)
| subset(relation_rng(sK9),relation_dom(sK10)) ),
inference(superposition,[status(thm)],[c_2746,c_90]) ).
cnf(c_3403,plain,
subset(relation_rng(sK9),relation_dom(sK10)),
inference(forward_subsumption_resolution,[status(thm)],[c_3402,c_100,c_102,c_99,c_101]) ).
cnf(c_3404,plain,
( ~ one_to_one(relation_composition(sK9,sK10))
| ~ function(sK9)
| ~ function(sK10)
| ~ relation(sK9)
| ~ relation(sK10)
| one_to_one(sK9) ),
inference(superposition,[status(thm)],[c_3403,c_94]) ).
cnf(c_3405,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3404,c_97,c_100,c_102,c_99,c_101,c_2747]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU020+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n019.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 : Thu Aug 24 00:30:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.66/1.16 % SZS status Started for theBenchmark.p
% 2.66/1.16 % SZS status Theorem for theBenchmark.p
% 2.66/1.16
% 2.66/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.66/1.16
% 2.66/1.16 ------ iProver source info
% 2.66/1.16
% 2.66/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.66/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.66/1.16 git: non_committed_changes: false
% 2.66/1.16 git: last_make_outside_of_git: false
% 2.66/1.16
% 2.66/1.16 ------ Parsing...
% 2.66/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.66/1.16
% 2.66/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.66/1.16
% 2.66/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.66/1.16
% 2.66/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.66/1.16 ------ Proving...
% 2.66/1.16 ------ Problem Properties
% 2.66/1.16
% 2.66/1.16
% 2.66/1.16 clauses 55
% 2.66/1.16 conjectures 6
% 2.66/1.16 EPR 27
% 2.66/1.16 Horn 53
% 2.66/1.16 unary 27
% 2.66/1.16 binary 14
% 2.66/1.16 lits 106
% 2.66/1.16 lits eq 6
% 2.66/1.16 fd_pure 0
% 2.66/1.16 fd_pseudo 0
% 2.66/1.16 fd_cond 1
% 2.66/1.16 fd_pseudo_cond 1
% 2.66/1.16 AC symbols 0
% 2.66/1.16
% 2.66/1.16 ------ Schedule dynamic 5 is on
% 2.66/1.16
% 2.66/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.66/1.16
% 2.66/1.16
% 2.66/1.16 ------
% 2.66/1.16 Current options:
% 2.66/1.16 ------
% 2.66/1.16
% 2.66/1.16
% 2.66/1.16
% 2.66/1.16
% 2.66/1.16 ------ Proving...
% 2.66/1.16
% 2.66/1.16
% 2.66/1.16 % SZS status Theorem for theBenchmark.p
% 2.66/1.16
% 2.66/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.66/1.16
% 2.66/1.16
%------------------------------------------------------------------------------