TSTP Solution File: SEU217+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU217+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:04:49 EDT 2023
% Result : Theorem 2.02s 1.17s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 105 ( 50 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 127 ( 52 ~; 43 |; 23 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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; 2 con; 0-2 aty)
% Number of variables : 52 ( 2 sgn; 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0] : relation(identity_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_relat_1) ).
fof(f19,axiom,
! [X0] :
( function(identity_relation(X0))
& relation(identity_relation(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_funct_1) ).
fof(f30,conjecture,
! [X0,X1] :
( in(X1,X0)
=> apply(identity_relation(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t35_funct_1) ).
fof(f31,negated_conjecture,
~ ! [X0,X1] :
( in(X1,X0)
=> apply(identity_relation(X0),X1) = X1 ),
inference(negated_conjecture,[],[f30]) ).
fof(f32,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ( identity_relation(X0) = X1
<=> ( ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = X2 )
& relation_dom(X1) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_funct_1) ).
fof(f54,plain,
? [X0,X1] :
( apply(identity_relation(X0),X1) != X1
& in(X1,X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f55,plain,
! [X0,X1] :
( ( identity_relation(X0) = X1
<=> ( ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) )
& relation_dom(X1) = X0 ) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f56,plain,
! [X0,X1] :
( ( identity_relation(X0) = X1
<=> ( ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) )
& relation_dom(X1) = X0 ) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f55]) ).
fof(f75,plain,
( ? [X0,X1] :
( apply(identity_relation(X0),X1) != X1
& in(X1,X0) )
=> ( sK10 != apply(identity_relation(sK9),sK10)
& in(sK10,sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
( sK10 != apply(identity_relation(sK9),sK10)
& in(sK10,sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f54,f75]) ).
fof(f77,plain,
! [X0,X1] :
( ( ( identity_relation(X0) = X1
| ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) )
| relation_dom(X1) != X0 )
& ( ( ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) )
& relation_dom(X1) = X0 )
| identity_relation(X0) != X1 ) )
| ~ function(X1)
| ~ relation(X1) ),
inference(nnf_transformation,[],[f56]) ).
fof(f78,plain,
! [X0,X1] :
( ( ( identity_relation(X0) = X1
| ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) )
| relation_dom(X1) != X0 )
& ( ( ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) )
& relation_dom(X1) = X0 )
| identity_relation(X0) != X1 ) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( ( ( identity_relation(X0) = X1
| ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) )
| relation_dom(X1) != X0 )
& ( ( ! [X3] :
( apply(X1,X3) = X3
| ~ in(X3,X0) )
& relation_dom(X1) = X0 )
| identity_relation(X0) != X1 ) )
| ~ function(X1)
| ~ relation(X1) ),
inference(rectify,[],[f78]) ).
fof(f80,plain,
! [X0,X1] :
( ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) )
=> ( sK11(X0,X1) != apply(X1,sK11(X0,X1))
& in(sK11(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f81,plain,
! [X0,X1] :
( ( ( identity_relation(X0) = X1
| ( sK11(X0,X1) != apply(X1,sK11(X0,X1))
& in(sK11(X0,X1),X0) )
| relation_dom(X1) != X0 )
& ( ( ! [X3] :
( apply(X1,X3) = X3
| ~ in(X3,X0) )
& relation_dom(X1) = X0 )
| identity_relation(X0) != X1 ) )
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f79,f80]) ).
fof(f102,plain,
! [X0] : relation(identity_relation(X0)),
inference(cnf_transformation,[],[f18]) ).
fof(f104,plain,
! [X0] : function(identity_relation(X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f120,plain,
in(sK10,sK9),
inference(cnf_transformation,[],[f76]) ).
fof(f121,plain,
sK10 != apply(identity_relation(sK9),sK10),
inference(cnf_transformation,[],[f76]) ).
fof(f123,plain,
! [X3,X0,X1] :
( apply(X1,X3) = X3
| ~ in(X3,X0)
| identity_relation(X0) != X1
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f128,plain,
! [X3,X0] :
( apply(identity_relation(X0),X3) = X3
| ~ in(X3,X0)
| ~ function(identity_relation(X0))
| ~ relation(identity_relation(X0)) ),
inference(equality_resolution,[],[f123]) ).
cnf(c_69,plain,
relation(identity_relation(X0)),
inference(cnf_transformation,[],[f102]) ).
cnf(c_70,plain,
function(identity_relation(X0)),
inference(cnf_transformation,[],[f104]) ).
cnf(c_87,negated_conjecture,
apply(identity_relation(sK9),sK10) != sK10,
inference(cnf_transformation,[],[f121]) ).
cnf(c_88,negated_conjecture,
in(sK10,sK9),
inference(cnf_transformation,[],[f120]) ).
cnf(c_91,plain,
( ~ in(X0,X1)
| ~ relation(identity_relation(X1))
| ~ function(identity_relation(X1))
| apply(identity_relation(X1),X0) = X0 ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_136,plain,
( ~ in(X0,X1)
| ~ function(identity_relation(X1))
| apply(identity_relation(X1),X0) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_91,c_69]) ).
cnf(c_139,plain,
( ~ in(X0,X1)
| apply(identity_relation(X1),X0) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_136,c_70]) ).
cnf(c_1723,plain,
apply(identity_relation(sK9),sK10) = sK10,
inference(superposition,[status(thm)],[c_88,c_139]) ).
cnf(c_1724,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1723,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU217+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.15/0.34 % Computer : n026.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Wed Aug 23 18:52:01 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.02/1.17 % SZS status Started for theBenchmark.p
% 2.02/1.17 % SZS status Theorem for theBenchmark.p
% 2.02/1.17
% 2.02/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.02/1.17
% 2.02/1.17 ------ iProver source info
% 2.02/1.17
% 2.02/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.02/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.02/1.17 git: non_committed_changes: false
% 2.02/1.17 git: last_make_outside_of_git: false
% 2.02/1.17
% 2.02/1.17 ------ Parsing...
% 2.02/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.02/1.17
% 2.02/1.17 ------ 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
% 2.02/1.17
% 2.02/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.02/1.17
% 2.02/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.02/1.17 ------ Proving...
% 2.02/1.17 ------ Problem Properties
% 2.02/1.17
% 2.02/1.17
% 2.02/1.17 clauses 39
% 2.02/1.17 conjectures 2
% 2.02/1.17 EPR 20
% 2.02/1.17 Horn 36
% 2.02/1.17 unary 21
% 2.02/1.17 binary 11
% 2.02/1.17 lits 66
% 2.02/1.17 lits eq 8
% 2.02/1.17 fd_pure 0
% 2.02/1.17 fd_pseudo 0
% 2.02/1.17 fd_cond 1
% 2.02/1.17 fd_pseudo_cond 1
% 2.02/1.17 AC symbols 0
% 2.02/1.17
% 2.02/1.17 ------ Schedule dynamic 5 is on
% 2.02/1.17
% 2.02/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.02/1.17
% 2.02/1.17
% 2.02/1.17 ------
% 2.02/1.17 Current options:
% 2.02/1.17 ------
% 2.02/1.17
% 2.02/1.17
% 2.02/1.17
% 2.02/1.17
% 2.02/1.17 ------ Proving...
% 2.02/1.17
% 2.02/1.17
% 2.02/1.17 % SZS status Theorem for theBenchmark.p
% 2.02/1.17
% 2.02/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.02/1.17
% 2.02/1.17
%------------------------------------------------------------------------------