TSTP Solution File: SEU294+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU294+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 17:05:32 EDT 2023
% Result : Theorem 1.83s 1.15s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 56 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 12 |; 12 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn; 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f46,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f47,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[],[f46]) ).
fof(f50,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f86,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f96,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f97,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(flattening,[],[f96]) ).
fof(f101,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f57]) ).
fof(f160,plain,
( ? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) )
=> ( ~ finite(sK26)
& finite(sK27)
& subset(sK26,sK27) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ~ finite(sK26)
& finite(sK27)
& subset(sK26,sK27) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27])],[f97,f160]) ).
fof(f174,plain,
! [X0,X1] :
( finite(X1)
| ~ element(X1,powerset(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f270,plain,
subset(sK26,sK27),
inference(cnf_transformation,[],[f161]) ).
fof(f271,plain,
finite(sK27),
inference(cnf_transformation,[],[f161]) ).
fof(f272,plain,
~ finite(sK26),
inference(cnf_transformation,[],[f161]) ).
fof(f275,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_60,plain,
( ~ element(X0,powerset(X1))
| ~ finite(X1)
| finite(X0) ),
inference(cnf_transformation,[],[f174]) ).
cnf(c_153,negated_conjecture,
~ finite(sK26),
inference(cnf_transformation,[],[f272]) ).
cnf(c_154,negated_conjecture,
finite(sK27),
inference(cnf_transformation,[],[f271]) ).
cnf(c_155,negated_conjecture,
subset(sK26,sK27),
inference(cnf_transformation,[],[f270]) ).
cnf(c_158,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f275]) ).
cnf(c_617,plain,
( X0 != sK26
| X1 != sK27
| element(X0,powerset(X1)) ),
inference(resolution_lifted,[status(thm)],[c_155,c_158]) ).
cnf(c_618,plain,
element(sK26,powerset(sK27)),
inference(unflattening,[status(thm)],[c_617]) ).
cnf(c_1156,plain,
( ~ finite(sK27)
| finite(sK26) ),
inference(superposition,[status(thm)],[c_618,c_60]) ).
cnf(c_1157,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1156,c_153,c_154]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU294+3 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 23:43:01 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.83/1.15 % SZS status Started for theBenchmark.p
% 1.83/1.15 % SZS status Theorem for theBenchmark.p
% 1.83/1.15
% 1.83/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.83/1.15
% 1.83/1.15 ------ iProver source info
% 1.83/1.15
% 1.83/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.83/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.83/1.15 git: non_committed_changes: false
% 1.83/1.15 git: last_make_outside_of_git: false
% 1.83/1.15
% 1.83/1.15 ------ Parsing...
% 1.83/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.83/1.15
% 1.83/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 69 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e
% 1.83/1.15
% 1.83/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.83/1.15
% 1.83/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.83/1.15 ------ Proving...
% 1.83/1.15 ------ Problem Properties
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 clauses 42
% 1.83/1.15 conjectures 2
% 1.83/1.15 EPR 25
% 1.83/1.15 Horn 38
% 1.83/1.15 unary 27
% 1.83/1.15 binary 10
% 1.83/1.15 lits 62
% 1.83/1.15 lits eq 2
% 1.83/1.15 fd_pure 0
% 1.83/1.15 fd_pseudo 0
% 1.83/1.15 fd_cond 1
% 1.83/1.15 fd_pseudo_cond 1
% 1.83/1.15 AC symbols 0
% 1.83/1.15
% 1.83/1.15 ------ Schedule dynamic 5 is on
% 1.83/1.15
% 1.83/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 ------
% 1.83/1.15 Current options:
% 1.83/1.15 ------
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 ------ Proving...
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 % SZS status Theorem for theBenchmark.p
% 1.83/1.15
% 1.83/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.83/1.15
% 1.83/1.15
%------------------------------------------------------------------------------