TSTP Solution File: SEU303+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU303+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:24 EDT 2024
% Result : Theorem 35.32s 5.70s
% Output : CNFRefutation 35.32s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f277,axiom,
! [X0] :
( relation(X0)
=> relation_rng(X0) = relation_image(X0,relation_dom(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t146_relat_1) ).
fof(f288,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ( finite(X0)
=> finite(relation_image(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_finset_1) ).
fof(f318,conjecture,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( finite(relation_dom(X0))
=> finite(relation_rng(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finset_1) ).
fof(f319,negated_conjecture,
~ ! [X0] :
( ( function(X0)
& relation(X0) )
=> ( finite(relation_dom(X0))
=> finite(relation_rng(X0)) ) ),
inference(negated_conjecture,[],[f318]) ).
fof(f701,plain,
! [X0] :
( relation_rng(X0) = relation_image(X0,relation_dom(X0))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f277]) ).
fof(f717,plain,
! [X0,X1] :
( finite(relation_image(X1,X0))
| ~ finite(X0)
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f288]) ).
fof(f718,plain,
! [X0,X1] :
( finite(relation_image(X1,X0))
| ~ finite(X0)
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f717]) ).
fof(f763,plain,
? [X0] :
( ~ finite(relation_rng(X0))
& finite(relation_dom(X0))
& function(X0)
& relation(X0) ),
inference(ennf_transformation,[],[f319]) ).
fof(f764,plain,
? [X0] :
( ~ finite(relation_rng(X0))
& finite(relation_dom(X0))
& function(X0)
& relation(X0) ),
inference(flattening,[],[f763]) ).
fof(f1571,plain,
( ? [X0] :
( ~ finite(relation_rng(X0))
& finite(relation_dom(X0))
& function(X0)
& relation(X0) )
=> ( ~ finite(relation_rng(sK328))
& finite(relation_dom(sK328))
& function(sK328)
& relation(sK328) ) ),
introduced(choice_axiom,[]) ).
fof(f1572,plain,
( ~ finite(relation_rng(sK328))
& finite(relation_dom(sK328))
& function(sK328)
& relation(sK328) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK328])],[f764,f1571]) ).
fof(f2552,plain,
! [X0] :
( relation_rng(X0) = relation_image(X0,relation_dom(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f701]) ).
fof(f2568,plain,
! [X0,X1] :
( finite(relation_image(X1,X0))
| ~ finite(X0)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f718]) ).
fof(f2610,plain,
relation(sK328),
inference(cnf_transformation,[],[f1572]) ).
fof(f2611,plain,
function(sK328),
inference(cnf_transformation,[],[f1572]) ).
fof(f2612,plain,
finite(relation_dom(sK328)),
inference(cnf_transformation,[],[f1572]) ).
fof(f2613,plain,
~ finite(relation_rng(sK328)),
inference(cnf_transformation,[],[f1572]) ).
cnf(c_954,plain,
( ~ relation(X0)
| relation_image(X0,relation_dom(X0)) = relation_rng(X0) ),
inference(cnf_transformation,[],[f2552]) ).
cnf(c_970,plain,
( ~ finite(X0)
| ~ function(X1)
| ~ relation(X1)
| finite(relation_image(X1,X0)) ),
inference(cnf_transformation,[],[f2568]) ).
cnf(c_1012,negated_conjecture,
~ finite(relation_rng(sK328)),
inference(cnf_transformation,[],[f2613]) ).
cnf(c_1013,negated_conjecture,
finite(relation_dom(sK328)),
inference(cnf_transformation,[],[f2612]) ).
cnf(c_1014,negated_conjecture,
function(sK328),
inference(cnf_transformation,[],[f2611]) ).
cnf(c_1015,negated_conjecture,
relation(sK328),
inference(cnf_transformation,[],[f2610]) ).
cnf(c_109008,plain,
relation_dom(sK328) = sP11_iProver_def,
definition ).
cnf(c_109009,plain,
relation_rng(sK328) = sP12_iProver_def,
definition ).
cnf(c_109010,negated_conjecture,
relation(sK328),
inference(demodulation,[status(thm)],[c_1015]) ).
cnf(c_109011,negated_conjecture,
function(sK328),
inference(demodulation,[status(thm)],[c_1014]) ).
cnf(c_109012,negated_conjecture,
finite(sP11_iProver_def),
inference(demodulation,[status(thm)],[c_1013,c_109008]) ).
cnf(c_109013,negated_conjecture,
~ finite(sP12_iProver_def),
inference(demodulation,[status(thm)],[c_1012,c_109009]) ).
cnf(c_151012,plain,
relation_image(sK328,relation_dom(sK328)) = relation_rng(sK328),
inference(superposition,[status(thm)],[c_109010,c_954]) ).
cnf(c_151022,plain,
relation_image(sK328,sP11_iProver_def) = sP12_iProver_def,
inference(light_normalisation,[status(thm)],[c_151012,c_109008,c_109009]) ).
cnf(c_179602,plain,
( ~ finite(sP11_iProver_def)
| ~ function(sK328)
| ~ relation(sK328)
| finite(sP12_iProver_def) ),
inference(superposition,[status(thm)],[c_151022,c_970]) ).
cnf(c_179604,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_179602,c_109013,c_109010,c_109011,c_109012]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU303+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 17:42:35 EDT 2024
% 0.14/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
% 35.32/5.70 % SZS status Started for theBenchmark.p
% 35.32/5.70 % SZS status Theorem for theBenchmark.p
% 35.32/5.70
% 35.32/5.70 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 35.32/5.70
% 35.32/5.70 ------ iProver source info
% 35.32/5.70
% 35.32/5.70 git: date: 2024-05-02 19:28:25 +0000
% 35.32/5.70 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 35.32/5.70 git: non_committed_changes: false
% 35.32/5.70
% 35.32/5.70 ------ Parsing...
% 35.32/5.70 ------ Clausification by vclausify_rel & Parsing by iProver...
% 35.32/5.70
% 35.32/5.70 ------ Preprocessing... sup_sim: 95 sf_s rm: 12 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e
% 35.32/5.70
% 35.32/5.70 ------ Preprocessing... gs_s sp: 14 0s gs_e snvd_s sp: 0 0s snvd_e
% 35.32/5.70
% 35.32/5.70 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 35.32/5.70 ------ Proving...
% 35.32/5.70 ------ Problem Properties
% 35.32/5.70
% 35.32/5.70
% 35.32/5.70 clauses 1049
% 35.32/5.70 conjectures 4
% 35.32/5.70 EPR 173
% 35.32/5.70 Horn 778
% 35.32/5.70 unary 138
% 35.32/5.70 binary 321
% 35.32/5.70 lits 3131
% 35.32/5.70 lits eq 467
% 35.32/5.70 fd_pure 0
% 35.32/5.70 fd_pseudo 0
% 35.32/5.70 fd_cond 44
% 35.32/5.70 fd_pseudo_cond 115
% 35.32/5.70 AC symbols 0
% 35.32/5.70
% 35.32/5.70 ------ Schedule dynamic 5 is on
% 35.32/5.70
% 35.32/5.70 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 35.32/5.70
% 35.32/5.70
% 35.32/5.70 ------
% 35.32/5.70 Current options:
% 35.32/5.70 ------
% 35.32/5.70
% 35.32/5.70
% 35.32/5.70
% 35.32/5.70
% 35.32/5.70 ------ Proving...
% 35.32/5.70
% 35.32/5.70
% 35.32/5.70 % SZS status Theorem for theBenchmark.p
% 35.32/5.70
% 35.32/5.70 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 35.32/5.70
% 35.32/5.70
%------------------------------------------------------------------------------