TSTP Solution File: SEU294+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU294+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:22 EDT 2024
% Result : Theorem 10.13s 2.18s
% Output : CNFRefutation 10.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 14 |; 13 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f249,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f250,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[],[f249]) ).
fof(f324,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f436,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f636,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f250]) ).
fof(f637,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(flattening,[],[f636]) ).
fof(f1353,plain,
( ? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) )
=> ( ~ finite(sK254)
& finite(sK255)
& subset(sK254,sK255) ) ),
introduced(choice_axiom,[]) ).
fof(f1354,plain,
( ~ finite(sK254)
& finite(sK255)
& subset(sK254,sK255) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK254,sK255])],[f637,f1353]) ).
fof(f1401,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f324]) ).
fof(f1460,plain,
! [X0,X1] :
( finite(X1)
| ~ element(X1,powerset(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[],[f436]) ).
fof(f2196,plain,
subset(sK254,sK255),
inference(cnf_transformation,[],[f1354]) ).
fof(f2197,plain,
finite(sK255),
inference(cnf_transformation,[],[f1354]) ).
fof(f2198,plain,
~ finite(sK254),
inference(cnf_transformation,[],[f1354]) ).
fof(f2317,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f1401]) ).
cnf(c_62,plain,
( ~ element(X0,powerset(X1))
| ~ finite(X1)
| finite(X0) ),
inference(cnf_transformation,[],[f1460]) ).
cnf(c_794,negated_conjecture,
~ finite(sK254),
inference(cnf_transformation,[],[f2198]) ).
cnf(c_795,negated_conjecture,
finite(sK255),
inference(cnf_transformation,[],[f2197]) ).
cnf(c_796,negated_conjecture,
subset(sK254,sK255),
inference(cnf_transformation,[],[f2196]) ).
cnf(c_914,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f2317]) ).
cnf(c_1728,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(prop_impl_just,[status(thm)],[c_914]) ).
cnf(c_4089,plain,
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(bin_hyper_res,[status(thm)],[c_62,c_1728]) ).
cnf(c_45088,plain,
( ~ finite(sK255)
| finite(sK254) ),
inference(superposition,[status(thm)],[c_796,c_4089]) ).
cnf(c_45089,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_45088,c_794,c_795]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU294+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % 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 18:00:20 EDT 2024
% 0.14/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
% 10.13/2.18 % SZS status Started for theBenchmark.p
% 10.13/2.18 % SZS status Theorem for theBenchmark.p
% 10.13/2.18
% 10.13/2.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.13/2.18
% 10.13/2.18 ------ iProver source info
% 10.13/2.18
% 10.13/2.18 git: date: 2024-05-02 19:28:25 +0000
% 10.13/2.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.13/2.18 git: non_committed_changes: false
% 10.13/2.18
% 10.13/2.18 ------ Parsing...
% 10.13/2.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.13/2.18
% 10.13/2.18 ------ Preprocessing... sup_sim: 95 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 10.13/2.18
% 10.13/2.18 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.13/2.18
% 10.13/2.18 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 10.13/2.18 ------ Proving...
% 10.13/2.18 ------ Problem Properties
% 10.13/2.18
% 10.13/2.18
% 10.13/2.18 clauses 904
% 10.13/2.18 conjectures 3
% 10.13/2.18 EPR 139
% 10.13/2.18 Horn 685
% 10.13/2.18 unary 124
% 10.13/2.18 binary 277
% 10.13/2.18 lits 2637
% 10.13/2.18 lits eq 397
% 10.13/2.18 fd_pure 0
% 10.13/2.18 fd_pseudo 0
% 10.13/2.18 fd_cond 30
% 10.13/2.18 fd_pseudo_cond 105
% 10.13/2.18 AC symbols 0
% 10.13/2.18
% 10.13/2.18 ------ Input Options Time Limit: Unbounded
% 10.13/2.18
% 10.13/2.18
% 10.13/2.18 ------
% 10.13/2.18 Current options:
% 10.13/2.18 ------
% 10.13/2.18
% 10.13/2.18
% 10.13/2.18
% 10.13/2.18
% 10.13/2.18 ------ Proving...
% 10.13/2.18
% 10.13/2.18
% 10.13/2.18 % SZS status Theorem for theBenchmark.p
% 10.13/2.18
% 10.13/2.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.13/2.18
% 10.13/2.18
%------------------------------------------------------------------------------