TSTP Solution File: NUM394+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM394+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 11:30:16 EDT 2023
% Result : Theorem 0.44s 1.14s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 55 ( 14 unt; 0 def)
% Number of atoms : 181 ( 11 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 206 ( 80 ~; 74 |; 34 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 66 ( 0 sgn; 46 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_connected(X0)
& epsilon_transitive(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f7,axiom,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(f8,axiom,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( in(X1,X0)
=> subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(f24,axiom,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f28,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( ~ in(X1,X0)
& X0 != X1
& ~ in(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(f29,conjecture,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X1,X0)
| ordinal_subset(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_ordinal1) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X1,X0)
| ordinal_subset(X0,X1) ) ) ),
inference(negated_conjecture,[],[f29]) ).
fof(f47,plain,
! [X0] :
( ( epsilon_connected(X0)
& epsilon_transitive(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f53,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f54,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f56,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f57,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f56]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( in(X1,X0)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( in(X1,X0)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(flattening,[],[f61]) ).
fof(f63,plain,
? [X0] :
( ? [X1] :
( ~ in(X1,X0)
& ~ ordinal_subset(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f64,plain,
? [X0] :
( ? [X1] :
( ~ in(X1,X0)
& ~ ordinal_subset(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(flattening,[],[f63]) ).
fof(f73,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(nnf_transformation,[],[f55]) ).
fof(f74,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(rectify,[],[f73]) ).
fof(f75,plain,
! [X0] :
( ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) )
=> ( ~ subset(sK0(X0),X0)
& in(sK0(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ( ~ subset(sK0(X0),X0)
& in(sK0(X0),X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f74,f75]) ).
fof(f101,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(nnf_transformation,[],[f57]) ).
fof(f102,plain,
( ? [X0] :
( ? [X1] :
( ~ in(X1,X0)
& ~ ordinal_subset(X0,X1)
& ordinal(X1) )
& ordinal(X0) )
=> ( ? [X1] :
( ~ in(X1,sK13)
& ~ ordinal_subset(sK13,X1)
& ordinal(X1) )
& ordinal(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
( ? [X1] :
( ~ in(X1,sK13)
& ~ ordinal_subset(sK13,X1)
& ordinal(X1) )
=> ( ~ in(sK14,sK13)
& ~ ordinal_subset(sK13,sK14)
& ordinal(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
( ~ in(sK14,sK13)
& ~ ordinal_subset(sK13,sK14)
& ordinal(sK14)
& ordinal(sK13) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f64,f103,f102]) ).
fof(f108,plain,
! [X0] :
( epsilon_transitive(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f114,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f115,plain,
! [X2,X0] :
( subset(X2,X0)
| ~ in(X2,X0)
| ~ epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f146,plain,
! [X0,X1] :
( ordinal_subset(X0,X1)
| ~ subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f150,plain,
! [X0,X1] :
( in(X1,X0)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f151,plain,
ordinal(sK13),
inference(cnf_transformation,[],[f104]) ).
fof(f152,plain,
ordinal(sK14),
inference(cnf_transformation,[],[f104]) ).
fof(f153,plain,
~ ordinal_subset(sK13,sK14),
inference(cnf_transformation,[],[f104]) ).
fof(f154,plain,
~ in(sK14,sK13),
inference(cnf_transformation,[],[f104]) ).
cnf(c_52,plain,
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f108]) ).
cnf(c_55,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ),
inference(cnf_transformation,[],[f114]) ).
cnf(c_58,plain,
( ~ in(X0,X1)
| ~ epsilon_transitive(X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
cnf(c_86,plain,
( ~ subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_91,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| X0 = X1
| in(X0,X1)
| in(X1,X0) ),
inference(cnf_transformation,[],[f150]) ).
cnf(c_92,negated_conjecture,
~ in(sK14,sK13),
inference(cnf_transformation,[],[f154]) ).
cnf(c_93,negated_conjecture,
~ ordinal_subset(sK13,sK14),
inference(cnf_transformation,[],[f153]) ).
cnf(c_94,negated_conjecture,
ordinal(sK14),
inference(cnf_transformation,[],[f152]) ).
cnf(c_95,negated_conjecture,
ordinal(sK13),
inference(cnf_transformation,[],[f151]) ).
cnf(c_2158,plain,
epsilon_transitive(sK14),
inference(superposition,[status(thm)],[c_94,c_52]) ).
cnf(c_2312,plain,
( ~ ordinal(sK14)
| ~ ordinal(sK13)
| ordinal_subset(sK14,sK13) ),
inference(superposition,[status(thm)],[c_55,c_93]) ).
cnf(c_2316,plain,
ordinal_subset(sK14,sK13),
inference(forward_subsumption_resolution,[status(thm)],[c_2312,c_95,c_94]) ).
cnf(c_2385,plain,
( ~ ordinal(sK14)
| ~ ordinal(sK13)
| sK14 = sK13
| in(sK13,sK14) ),
inference(superposition,[status(thm)],[c_91,c_92]) ).
cnf(c_2390,plain,
( sK14 = sK13
| in(sK13,sK14) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2385,c_95,c_94]) ).
cnf(c_2434,plain,
( ~ epsilon_transitive(sK14)
| sK14 = sK13
| subset(sK13,sK14) ),
inference(superposition,[status(thm)],[c_2390,c_58]) ).
cnf(c_2442,plain,
( sK14 = sK13
| subset(sK13,sK14) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2434,c_2158]) ).
cnf(c_2462,plain,
( ~ ordinal(sK14)
| ~ ordinal(sK13)
| sK14 = sK13
| ordinal_subset(sK13,sK14) ),
inference(superposition,[status(thm)],[c_2442,c_86]) ).
cnf(c_2463,plain,
sK14 = sK13,
inference(forward_subsumption_resolution,[status(thm)],[c_2462,c_93,c_95,c_94]) ).
cnf(c_2465,plain,
ordinal_subset(sK14,sK14),
inference(demodulation,[status(thm)],[c_2316,c_2463]) ).
cnf(c_2467,plain,
~ ordinal_subset(sK14,sK14),
inference(demodulation,[status(thm)],[c_93,c_2463]) ).
cnf(c_2470,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2465,c_2467]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM394+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 16:08:40 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.44/1.14 % SZS status Started for theBenchmark.p
% 0.44/1.14 % SZS status Theorem for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.44/1.14
% 0.44/1.14 ------ iProver source info
% 0.44/1.14
% 0.44/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.44/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.44/1.14 git: non_committed_changes: false
% 0.44/1.14 git: last_make_outside_of_git: false
% 0.44/1.14
% 0.44/1.14 ------ Parsing...
% 0.44/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 19 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.44/1.14 ------ Proving...
% 0.44/1.14 ------ Problem Properties
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 clauses 33
% 0.44/1.14 conjectures 4
% 0.44/1.14 EPR 28
% 0.44/1.14 Horn 29
% 0.44/1.14 unary 14
% 0.44/1.14 binary 10
% 0.44/1.14 lits 66
% 0.44/1.14 lits eq 3
% 0.44/1.14 fd_pure 0
% 0.44/1.14 fd_pseudo 0
% 0.44/1.14 fd_cond 1
% 0.44/1.14 fd_pseudo_cond 2
% 0.44/1.14 AC symbols 0
% 0.44/1.14
% 0.44/1.14 ------ Schedule dynamic 5 is on
% 0.44/1.14
% 0.44/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------
% 0.44/1.14 Current options:
% 0.44/1.14 ------
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------ Proving...
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 % SZS status Theorem for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.14
% 0.44/1.15
%------------------------------------------------------------------------------