TSTP Solution File: SEU294+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU294+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 1.99s 1.14s
% Output : CNFRefutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 58 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 12 |; 12 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f40,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[],[f40]) ).
fof(f44,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f44]) ).
fof(f72,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f80,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f81,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(flattening,[],[f80]) ).
fof(f85,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f130,plain,
( ? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) )
=> ( ~ finite(sK19)
& finite(sK20)
& subset(sK19,sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ~ finite(sK19)
& finite(sK20)
& subset(sK19,sK20) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20])],[f81,f130]) ).
fof(f144,plain,
! [X0,X1] :
( finite(X1)
| ~ element(X1,powerset(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f215,plain,
subset(sK19,sK20),
inference(cnf_transformation,[],[f131]) ).
fof(f216,plain,
finite(sK20),
inference(cnf_transformation,[],[f131]) ).
fof(f217,plain,
~ finite(sK19),
inference(cnf_transformation,[],[f131]) ).
fof(f220,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_60,plain,
( ~ element(X0,powerset(X1))
| ~ finite(X1)
| finite(X0) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_129,negated_conjecture,
~ finite(sK19),
inference(cnf_transformation,[],[f217]) ).
cnf(c_130,negated_conjecture,
finite(sK20),
inference(cnf_transformation,[],[f216]) ).
cnf(c_131,negated_conjecture,
subset(sK19,sK20),
inference(cnf_transformation,[],[f215]) ).
cnf(c_134,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_545,plain,
( X0 != sK19
| X1 != sK20
| element(X0,powerset(X1)) ),
inference(resolution_lifted,[status(thm)],[c_131,c_134]) ).
cnf(c_546,plain,
element(sK19,powerset(sK20)),
inference(unflattening,[status(thm)],[c_545]) ).
cnf(c_741,negated_conjecture,
finite(sK20),
inference(demodulation,[status(thm)],[c_130]) ).
cnf(c_742,negated_conjecture,
~ finite(sK19),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_1150,plain,
( ~ finite(sK20)
| finite(sK19) ),
inference(superposition,[status(thm)],[c_546,c_60]) ).
cnf(c_1152,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1150,c_742,c_741]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU294+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu May 2 17:46:26 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 1.99/1.14 % SZS status Started for theBenchmark.p
% 1.99/1.14 % SZS status Theorem for theBenchmark.p
% 1.99/1.14
% 1.99/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.99/1.14
% 1.99/1.14 ------ iProver source info
% 1.99/1.14
% 1.99/1.14 git: date: 2024-05-02 19:28:25 +0000
% 1.99/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.99/1.14 git: non_committed_changes: false
% 1.99/1.14
% 1.99/1.14 ------ Parsing...
% 1.99/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.99/1.14
% 1.99/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 52 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.99/1.14
% 1.99/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.99/1.14
% 1.99/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.99/1.14 ------ Proving...
% 1.99/1.14 ------ Problem Properties
% 1.99/1.14
% 1.99/1.14
% 1.99/1.14 clauses 37
% 1.99/1.14 conjectures 2
% 1.99/1.14 EPR 20
% 1.99/1.14 Horn 33
% 1.99/1.14 unary 22
% 1.99/1.14 binary 10
% 1.99/1.14 lits 57
% 1.99/1.14 lits eq 2
% 1.99/1.14 fd_pure 0
% 1.99/1.14 fd_pseudo 0
% 1.99/1.14 fd_cond 1
% 1.99/1.14 fd_pseudo_cond 1
% 1.99/1.14 AC symbols 0
% 1.99/1.14
% 1.99/1.14 ------ Schedule dynamic 5 is on
% 1.99/1.14
% 1.99/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.99/1.14
% 1.99/1.14
% 1.99/1.14 ------
% 1.99/1.14 Current options:
% 1.99/1.14 ------
% 1.99/1.14
% 1.99/1.14
% 1.99/1.14
% 1.99/1.14
% 1.99/1.14 ------ Proving...
% 1.99/1.14
% 1.99/1.14
% 1.99/1.14 % SZS status Theorem for theBenchmark.p
% 1.99/1.14
% 1.99/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.99/1.14
% 1.99/1.14
%------------------------------------------------------------------------------