TSTP Solution File: SEU326+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU326+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:50 EDT 2023
% Result : Theorem 12.00s 2.70s
% Output : CNFRefutation 12.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 84 ( 52 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 93 ( 43 ~; 25 |; 19 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f167,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> element(complements_of_subsets(X0,X1),powerset(powerset(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(f258,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(f360,conjecture,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ( ~ ( empty_set = X1
& empty_set != complements_of_subsets(X0,X1) )
& ~ ( empty_set = complements_of_subsets(X0,X1)
& empty_set != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_tops_2) ).
fof(f361,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ( ~ ( empty_set = X1
& empty_set != complements_of_subsets(X0,X1) )
& ~ ( empty_set = complements_of_subsets(X0,X1)
& empty_set != X1 ) ) ),
inference(negated_conjecture,[],[f360]) ).
fof(f476,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ~ ( empty_set = complements_of_subsets(X0,X1)
& empty_set != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_setfam_1) ).
fof(f742,plain,
! [X0,X1] :
( element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f167]) ).
fof(f828,plain,
! [X0,X1] :
( complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f258]) ).
fof(f936,plain,
? [X0,X1] :
( ( ( empty_set = X1
& empty_set != complements_of_subsets(X0,X1) )
| ( empty_set = complements_of_subsets(X0,X1)
& empty_set != X1 ) )
& element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f361]) ).
fof(f1076,plain,
! [X0,X1] :
( empty_set != complements_of_subsets(X0,X1)
| empty_set = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f476]) ).
fof(f1077,plain,
! [X0,X1] :
( empty_set != complements_of_subsets(X0,X1)
| empty_set = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(flattening,[],[f1076]) ).
fof(f1928,plain,
( ? [X0,X1] :
( ( ( empty_set = X1
& empty_set != complements_of_subsets(X0,X1) )
| ( empty_set = complements_of_subsets(X0,X1)
& empty_set != X1 ) )
& element(X1,powerset(powerset(X0))) )
=> ( ( ( empty_set = sK365
& empty_set != complements_of_subsets(sK364,sK365) )
| ( empty_set = complements_of_subsets(sK364,sK365)
& empty_set != sK365 ) )
& element(sK365,powerset(powerset(sK364))) ) ),
introduced(choice_axiom,[]) ).
fof(f1929,plain,
( ( ( empty_set = sK365
& empty_set != complements_of_subsets(sK364,sK365) )
| ( empty_set = complements_of_subsets(sK364,sK365)
& empty_set != sK365 ) )
& element(sK365,powerset(powerset(sK364))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK364,sK365])],[f936,f1928]) ).
fof(f2473,plain,
! [X0,X1] :
( element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f742]) ).
fof(f2641,plain,
! [X0,X1] :
( complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f828]) ).
fof(f3156,plain,
element(sK365,powerset(powerset(sK364))),
inference(cnf_transformation,[],[f1929]) ).
fof(f3157,plain,
( empty_set != complements_of_subsets(sK364,sK365)
| empty_set != sK365 ),
inference(cnf_transformation,[],[f1929]) ).
fof(f3160,plain,
( empty_set = sK365
| empty_set = complements_of_subsets(sK364,sK365) ),
inference(cnf_transformation,[],[f1929]) ).
fof(f3348,plain,
! [X0,X1] :
( empty_set != complements_of_subsets(X0,X1)
| empty_set = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f1077]) ).
cnf(c_478,plain,
( ~ element(X0,powerset(powerset(X1)))
| element(complements_of_subsets(X1,X0),powerset(powerset(X1))) ),
inference(cnf_transformation,[],[f2473]) ).
cnf(c_646,plain,
( ~ element(X0,powerset(powerset(X1)))
| complements_of_subsets(X1,complements_of_subsets(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f2641]) ).
cnf(c_1161,negated_conjecture,
( complements_of_subsets(sK364,sK365) = empty_set
| empty_set = sK365 ),
inference(cnf_transformation,[],[f3160]) ).
cnf(c_1162,negated_conjecture,
( complements_of_subsets(sK364,sK365) != empty_set
| empty_set != sK365 ),
inference(cnf_transformation,[],[f3157]) ).
cnf(c_1163,negated_conjecture,
element(sK365,powerset(powerset(sK364))),
inference(cnf_transformation,[],[f3156]) ).
cnf(c_1351,plain,
( complements_of_subsets(X0,X1) != empty_set
| ~ element(X1,powerset(powerset(X0)))
| X1 = empty_set ),
inference(cnf_transformation,[],[f3348]) ).
cnf(c_48282,plain,
complements_of_subsets(sK364,complements_of_subsets(sK364,sK365)) = sK365,
inference(superposition,[status(thm)],[c_1163,c_646]) ).
cnf(c_48301,plain,
( ~ element(sK365,powerset(powerset(sK364)))
| empty_set = sK365 ),
inference(superposition,[status(thm)],[c_1161,c_1351]) ).
cnf(c_48354,plain,
( empty_set != sK365
| ~ element(complements_of_subsets(sK364,sK365),powerset(powerset(sK364)))
| complements_of_subsets(sK364,sK365) = empty_set ),
inference(superposition,[status(thm)],[c_48282,c_1351]) ).
cnf(c_48389,negated_conjecture,
empty_set = sK365,
inference(global_subsumption_just,[status(thm)],[c_1161,c_1163,c_48301]) ).
cnf(c_48391,plain,
element(empty_set,powerset(powerset(sK364))),
inference(superposition,[status(thm)],[c_48389,c_1163]) ).
cnf(c_48406,plain,
empty_set = sK365,
inference(global_subsumption_just,[status(thm)],[c_48301,c_1163,c_48301]) ).
cnf(c_48618,plain,
~ element(complements_of_subsets(sK364,sK365),powerset(powerset(sK364))),
inference(global_subsumption_just,[status(thm)],[c_48354,c_1163,c_1162,c_48301,c_48354]) ).
cnf(c_48620,plain,
~ element(complements_of_subsets(sK364,empty_set),powerset(powerset(sK364))),
inference(light_normalisation,[status(thm)],[c_48618,c_48406]) ).
cnf(c_48621,plain,
~ element(empty_set,powerset(powerset(sK364))),
inference(superposition,[status(thm)],[c_478,c_48620]) ).
cnf(c_48622,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_48621,c_48391]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU326+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n008.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 15:40:32 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 12.00/2.70 % SZS status Started for theBenchmark.p
% 12.00/2.70 % SZS status Theorem for theBenchmark.p
% 12.00/2.70
% 12.00/2.70 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 12.00/2.70
% 12.00/2.70 ------ iProver source info
% 12.00/2.70
% 12.00/2.70 git: date: 2023-05-31 18:12:56 +0000
% 12.00/2.70 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 12.00/2.70 git: non_committed_changes: false
% 12.00/2.70 git: last_make_outside_of_git: false
% 12.00/2.70
% 12.00/2.70 ------ Parsing...
% 12.00/2.70 ------ Clausification by vclausify_rel & Parsing by iProver...
% 12.00/2.70
% 12.00/2.70 ------ Preprocessing... sup_sim: 95 sf_s rm: 96 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e
% 12.00/2.70
% 12.00/2.70 ------ Preprocessing... gs_s sp: 19 0s gs_e snvd_s sp: 0 0s snvd_e
% 12.00/2.70
% 12.00/2.70 ------ Preprocessing... sf_s rm: 5 0s sf_e
% 12.00/2.70 ------ Proving...
% 12.00/2.70 ------ Problem Properties
% 12.00/2.70
% 12.00/2.70
% 12.00/2.70 clauses 1218
% 12.00/2.70 conjectures 3
% 12.00/2.70 EPR 183
% 12.00/2.70 Horn 896
% 12.00/2.70 unary 153
% 12.00/2.70 binary 354
% 12.00/2.70 lits 3756
% 12.00/2.70 lits eq 505
% 12.00/2.70 fd_pure 0
% 12.00/2.70 fd_pseudo 0
% 12.00/2.70 fd_cond 44
% 12.00/2.70 fd_pseudo_cond 116
% 12.00/2.70 AC symbols 0
% 12.00/2.70
% 12.00/2.70 ------ Input Options Time Limit: Unbounded
% 12.00/2.70
% 12.00/2.70
% 12.00/2.70 ------
% 12.00/2.70 Current options:
% 12.00/2.70 ------
% 12.00/2.70
% 12.00/2.70
% 12.00/2.70
% 12.00/2.70
% 12.00/2.70 ------ Proving...
% 12.00/2.70
% 12.00/2.70
% 12.00/2.70 % SZS status Theorem for theBenchmark.p
% 12.00/2.70
% 12.00/2.70 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 12.00/2.70
% 12.00/2.70
%------------------------------------------------------------------------------