TSTP Solution File: SEU217+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU217+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:02 EDT 2024
% Result : Theorem 7.73s 1.68s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f62,axiom,
! [X0] : relation(identity_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_relat_1) ).
fof(f78,axiom,
! [X0] :
( function(identity_relation(X0))
& relation(identity_relation(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_funct_1) ).
fof(f164,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(f165,conjecture,
! [X0,X1] :
( in(X1,X0)
=> apply(identity_relation(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t35_funct_1) ).
fof(f166,negated_conjecture,
~ ! [X0,X1] :
( in(X1,X0)
=> apply(identity_relation(X0),X1) = X1 ),
inference(negated_conjecture,[],[f165]) ).
fof(f360,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,[],[f164]) ).
fof(f361,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,[],[f360]) ).
fof(f362,plain,
? [X0,X1] :
( apply(identity_relation(X0),X1) != X1
& in(X1,X0) ),
inference(ennf_transformation,[],[f166]) ).
fof(f588,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,[],[f361]) ).
fof(f589,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,[],[f588]) ).
fof(f590,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,[],[f589]) ).
fof(f591,plain,
! [X0,X1] :
( ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) )
=> ( sK65(X0,X1) != apply(X1,sK65(X0,X1))
& in(sK65(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f592,plain,
! [X0,X1] :
( ( ( identity_relation(X0) = X1
| ( sK65(X0,X1) != apply(X1,sK65(X0,X1))
& in(sK65(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,[sK65])],[f590,f591]) ).
fof(f593,plain,
( ? [X0,X1] :
( apply(identity_relation(X0),X1) != X1
& in(X1,X0) )
=> ( sK67 != apply(identity_relation(sK66),sK67)
& in(sK67,sK66) ) ),
introduced(choice_axiom,[]) ).
fof(f594,plain,
( sK67 != apply(identity_relation(sK66),sK67)
& in(sK67,sK66) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK66,sK67])],[f362,f593]) ).
fof(f774,plain,
! [X0] : relation(identity_relation(X0)),
inference(cnf_transformation,[],[f62]) ).
fof(f792,plain,
! [X0] : function(identity_relation(X0)),
inference(cnf_transformation,[],[f78]) ).
fof(f915,plain,
! [X3,X0,X1] :
( apply(X1,X3) = X3
| ~ in(X3,X0)
| identity_relation(X0) != X1
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f592]) ).
fof(f918,plain,
in(sK67,sK66),
inference(cnf_transformation,[],[f594]) ).
fof(f919,plain,
sK67 != apply(identity_relation(sK66),sK67),
inference(cnf_transformation,[],[f594]) ).
fof(f1209,plain,
! [X3,X0] :
( apply(identity_relation(X0),X3) = X3
| ~ in(X3,X0)
| ~ function(identity_relation(X0))
| ~ relation(identity_relation(X0)) ),
inference(equality_resolution,[],[f915]) ).
cnf(c_200,plain,
relation(identity_relation(X0)),
inference(cnf_transformation,[],[f774]) ).
cnf(c_217,plain,
function(identity_relation(X0)),
inference(cnf_transformation,[],[f792]) ).
cnf(c_342,plain,
( ~ in(X0,X1)
| ~ function(identity_relation(X1))
| ~ relation(identity_relation(X1))
| apply(identity_relation(X1),X0) = X0 ),
inference(cnf_transformation,[],[f1209]) ).
cnf(c_344,negated_conjecture,
apply(identity_relation(sK66),sK67) != sK67,
inference(cnf_transformation,[],[f919]) ).
cnf(c_345,negated_conjecture,
in(sK67,sK66),
inference(cnf_transformation,[],[f918]) ).
cnf(c_1605,plain,
( ~ in(X0,X1)
| ~ function(identity_relation(X1))
| apply(identity_relation(X1),X0) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_342,c_200]) ).
cnf(c_1610,plain,
( ~ in(X0,X1)
| apply(identity_relation(X1),X0) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_1605,c_217]) ).
cnf(c_5279,plain,
( ~ in(X0,X1)
| apply(identity_relation(X1),X0) = X0 ),
inference(prop_impl_just,[status(thm)],[c_1610]) ).
cnf(c_9675,plain,
identity_relation(sK66) = sP0_iProver_def,
definition ).
cnf(c_9676,plain,
apply(sP0_iProver_def,sK67) = sP1_iProver_def,
definition ).
cnf(c_9677,negated_conjecture,
in(sK67,sK66),
inference(demodulation,[status(thm)],[c_345]) ).
cnf(c_9678,negated_conjecture,
sP1_iProver_def != sK67,
inference(demodulation,[status(thm)],[c_344,c_9675,c_9676]) ).
cnf(c_15808,plain,
apply(identity_relation(sK66),sK67) = sK67,
inference(superposition,[status(thm)],[c_9677,c_5279]) ).
cnf(c_15810,plain,
sK67 = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_15808,c_9675,c_9676]) ).
cnf(c_15816,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_9678,c_15810]) ).
cnf(c_15818,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_15816]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU217+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n021.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 May 2 17:34:57 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 7.73/1.68 % SZS status Started for theBenchmark.p
% 7.73/1.68 % SZS status Theorem for theBenchmark.p
% 7.73/1.68
% 7.73/1.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.73/1.68
% 7.73/1.68 ------ iProver source info
% 7.73/1.68
% 7.73/1.68 git: date: 2024-05-02 19:28:25 +0000
% 7.73/1.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.73/1.68 git: non_committed_changes: false
% 7.73/1.68
% 7.73/1.68 ------ Parsing...
% 7.73/1.68 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.73/1.68
% 7.73/1.68 ------ Preprocessing... sup_sim: 41 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
% 7.73/1.68
% 7.73/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.73/1.68
% 7.73/1.68 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.73/1.68 ------ Proving...
% 7.73/1.68 ------ Problem Properties
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 clauses 335
% 7.73/1.68 conjectures 2
% 7.73/1.68 EPR 39
% 7.73/1.68 Horn 270
% 7.73/1.68 unary 52
% 7.73/1.68 binary 108
% 7.73/1.68 lits 905
% 7.73/1.68 lits eq 178
% 7.73/1.68 fd_pure 0
% 7.73/1.68 fd_pseudo 0
% 7.73/1.68 fd_cond 14
% 7.73/1.68 fd_pseudo_cond 69
% 7.73/1.68 AC symbols 0
% 7.73/1.68
% 7.73/1.68 ------ Schedule dynamic 5 is on
% 7.73/1.68
% 7.73/1.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 ------
% 7.73/1.68 Current options:
% 7.73/1.68 ------
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 ------ Proving...
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 % SZS status Theorem for theBenchmark.p
% 7.73/1.68
% 7.73/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.73/1.68
% 7.73/1.68
%------------------------------------------------------------------------------