TSTP Solution File: SEU223+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.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 : Fri May 3 03:05:04 EDT 2024
% Result : Theorem 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( ( relation_empty_yielding(X0)
& relation(X0) )
=> ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc13_relat_1) ).
fof(f30,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f32,axiom,
! [X0,X1] :
( ( function(X0)
& relation(X0) )
=> ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t70_funct_1) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f38,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f42,plain,
! [X0,X1] :
( ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f43,plain,
! [X0,X1] :
( ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(flattening,[],[f42]) ).
fof(f56,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f57,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f58,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f57]) ).
fof(f63,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f64,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f66,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f65]) ).
fof(f85,plain,
( ? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& function(X2)
& relation(X2) )
=> ( apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10)
& in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
& function(sK11)
& relation(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
( apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10)
& in(sK10,relation_dom(relation_dom_restriction(sK11,sK9)))
& function(sK11)
& relation(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f64,f85]) ).
fof(f87,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(nnf_transformation,[],[f66]) ).
fof(f88,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(rectify,[],[f88]) ).
fof(f90,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK12(X1,X2)) != apply(X2,sK12(X1,X2))
& in(sK12(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK12(X1,X2)) != apply(X2,sK12(X1,X2))
& in(sK12(X1,X2),relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f89,f90]) ).
fof(f94,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f128,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f132,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f136,plain,
relation(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f137,plain,
function(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f138,plain,
in(sK10,relation_dom(relation_dom_restriction(sK11,sK9))),
inference(cnf_transformation,[],[f86]) ).
fof(f139,plain,
apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10),
inference(cnf_transformation,[],[f86]) ).
fof(f141,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f144,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f141]) ).
cnf(c_52,plain,
( ~ relation_empty_yielding(X0)
| ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_83,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_86,plain,
( ~ relation(X0)
| ~ function(X0)
| function(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_91,negated_conjecture,
apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10),
inference(cnf_transformation,[],[f139]) ).
cnf(c_92,negated_conjecture,
in(sK10,relation_dom(relation_dom_restriction(sK11,sK9))),
inference(cnf_transformation,[],[f138]) ).
cnf(c_93,negated_conjecture,
function(sK11),
inference(cnf_transformation,[],[f137]) ).
cnf(c_94,negated_conjecture,
relation(sK11),
inference(cnf_transformation,[],[f136]) ).
cnf(c_97,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_121,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_83]) ).
cnf(c_210,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_121]) ).
cnf(c_246,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_210,c_86]) ).
cnf(c_692,plain,
relation_dom_restriction(sK11,sK9) = sP0_iProver_def,
definition ).
cnf(c_693,plain,
relation_dom(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_694,plain,
apply(sP0_iProver_def,sK10) = sP2_iProver_def,
definition ).
cnf(c_695,plain,
apply(sK11,sK10) = sP3_iProver_def,
definition ).
cnf(c_696,negated_conjecture,
relation(sK11),
inference(demodulation,[status(thm)],[c_94]) ).
cnf(c_697,negated_conjecture,
function(sK11),
inference(demodulation,[status(thm)],[c_93]) ).
cnf(c_698,negated_conjecture,
in(sK10,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_92,c_692,c_693]) ).
cnf(c_699,negated_conjecture,
sP2_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_91,c_695,c_694]) ).
cnf(c_1358,plain,
( ~ in(X0,relation_dom(sP0_iProver_def))
| ~ relation(sK11)
| ~ function(sK11)
| apply(relation_dom_restriction(sK11,sK9),X0) = apply(sK11,X0) ),
inference(superposition,[status(thm)],[c_692,c_246]) ).
cnf(c_1359,plain,
( ~ in(X0,sP1_iProver_def)
| ~ relation(sK11)
| ~ function(sK11)
| apply(sK11,X0) = apply(sP0_iProver_def,X0) ),
inference(light_normalisation,[status(thm)],[c_1358,c_692,c_693]) ).
cnf(c_1360,plain,
( ~ in(X0,sP1_iProver_def)
| apply(sK11,X0) = apply(sP0_iProver_def,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1359,c_697,c_696]) ).
cnf(c_1552,plain,
apply(sK11,sK10) = apply(sP0_iProver_def,sK10),
inference(superposition,[status(thm)],[c_698,c_1360]) ).
cnf(c_1553,plain,
sP2_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_1552,c_694,c_695]) ).
cnf(c_1554,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1553,c_699]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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:37:59 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 44
% 0.48/1.16 conjectures 4
% 0.48/1.16 EPR 26
% 0.48/1.16 Horn 42
% 0.48/1.16 unary 27
% 0.48/1.16 binary 9
% 0.48/1.16 lits 78
% 0.48/1.16 lits eq 17
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 1
% 0.48/1.16 fd_pseudo_cond 3
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------