TSTP Solution File: SEU117+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU117+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n018.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 : Tue Apr 30 15:22:15 EDT 2024
% Result : Theorem 0.11s 0.38s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 9 unt; 0 def)
% Number of atoms : 160 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 190 ( 72 ~; 67 |; 37 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 62 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f196,plain,
$false,
inference(resolution,[],[f194,f102]) ).
fof(f102,plain,
! [X0] : ~ empty(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( preboolean(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& cup_closed(finite_subsets(X0))
& ~ empty(finite_subsets(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f194,plain,
empty(finite_subsets(sK2)),
inference(resolution,[],[f193,f97]) ).
fof(f97,plain,
element(sK3,finite_subsets(sK2)),
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
( ~ element(sK3,powerset(sK2))
& element(sK3,finite_subsets(sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f43,f67]) ).
fof(f67,plain,
( ? [X0,X1] :
( ~ element(X1,powerset(X0))
& element(X1,finite_subsets(X0)) )
=> ( ~ element(sK3,powerset(sK2))
& element(sK3,finite_subsets(sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
? [X0,X1] :
( ~ element(X1,powerset(X0))
& element(X1,finite_subsets(X0)) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
! [X0,X1] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_finsub_1) ).
fof(f193,plain,
( ~ element(sK3,finite_subsets(sK2))
| empty(finite_subsets(sK2)) ),
inference(resolution,[],[f190,f142]) ).
fof(f142,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f190,plain,
~ in(sK3,finite_subsets(sK2)),
inference(resolution,[],[f189,f101]) ).
fof(f101,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f189,plain,
( ~ preboolean(finite_subsets(sK2))
| ~ in(sK3,finite_subsets(sK2)) ),
inference(resolution,[],[f188,f139]) ).
fof(f139,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ preboolean(X1) ),
inference(definition_folding,[],[f53,f65,f64]) ).
fof(f64,plain,
! [X0,X1] :
( sP0(X0,X1)
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f65,plain,
! [X1,X0] :
( ( finite_subsets(X0) = X1
<=> sP0(X0,X1) )
| ~ sP1(X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f53,plain,
! [X0,X1] :
( ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f188,plain,
( ~ sP1(finite_subsets(sK2),sK2)
| ~ in(sK3,finite_subsets(sK2)) ),
inference(resolution,[],[f186,f158]) ).
fof(f158,plain,
! [X1] :
( sP0(X1,finite_subsets(X1))
| ~ sP1(finite_subsets(X1),X1) ),
inference(equality_resolution,[],[f131]) ).
fof(f131,plain,
! [X0,X1] :
( sP0(X1,X0)
| finite_subsets(X1) != X0
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0,X1] :
( ( ( finite_subsets(X1) = X0
| ~ sP0(X1,X0) )
& ( sP0(X1,X0)
| finite_subsets(X1) != X0 ) )
| ~ sP1(X0,X1) ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
! [X1,X0] :
( ( ( finite_subsets(X0) = X1
| ~ sP0(X0,X1) )
& ( sP0(X0,X1)
| finite_subsets(X0) != X1 ) )
| ~ sP1(X1,X0) ),
inference(nnf_transformation,[],[f65]) ).
fof(f186,plain,
! [X0] :
( ~ sP0(sK2,X0)
| ~ in(sK3,X0) ),
inference(resolution,[],[f133,f171]) ).
fof(f171,plain,
~ subset(sK3,sK2),
inference(resolution,[],[f145,f98]) ).
fof(f98,plain,
~ element(sK3,powerset(sK2)),
inference(cnf_transformation,[],[f68]) ).
fof(f145,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f133,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ( ~ finite(sK10(X0,X1))
| ~ subset(sK10(X0,X1),X0)
| ~ in(sK10(X0,X1),X1) )
& ( ( finite(sK10(X0,X1))
& subset(sK10(X0,X1),X0) )
| in(sK10(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0) )
& ( ( finite(X3)
& subset(X3,X0) )
| ~ in(X3,X1) ) )
| ~ sP0(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f85,f86]) ).
fof(f86,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) )
=> ( ( ~ finite(sK10(X0,X1))
| ~ subset(sK10(X0,X1),X0)
| ~ in(sK10(X0,X1),X1) )
& ( ( finite(sK10(X0,X1))
& subset(sK10(X0,X1),X0) )
| in(sK10(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0) )
& ( ( finite(X3)
& subset(X3,X0) )
| ~ in(X3,X1) ) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ in(X2,X1) ) )
| ~ sP0(X0,X1) ) ),
inference(flattening,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ in(X2,X1) ) )
| ~ sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU117+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.34 % Computer : n018.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Apr 29 20:37:42 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.11/0.34 % (25688)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.37 % (25689)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.37 % (25694)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.11/0.37 % (25692)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.37 TRYING [1]
% 0.11/0.37 % (25691)WARNING: value z3 for option sas not known
% 0.11/0.37 TRYING [2]
% 0.11/0.37 % (25693)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.11/0.37 TRYING [3]
% 0.11/0.37 % (25690)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.37 % (25691)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.37 % (25694)First to succeed.
% 0.11/0.38 TRYING [4]
% 0.11/0.38 % (25694)Refutation found. Thanks to Tanya!
% 0.11/0.38 % SZS status Theorem for theBenchmark
% 0.11/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.38 % (25694)------------------------------
% 0.11/0.38 % (25694)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.11/0.38 % (25694)Termination reason: Refutation
% 0.11/0.38
% 0.11/0.38 % (25694)Memory used [KB]: 901
% 0.11/0.38 % (25694)Time elapsed: 0.012 s
% 0.11/0.38 % (25694)Instructions burned: 7 (million)
% 0.11/0.38 % (25694)------------------------------
% 0.11/0.38 % (25694)------------------------------
% 0.11/0.38 % (25688)Success in time 0.036 s
% 0.11/0.38 25691 Aborted by signal SIGHUP on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.38 % (25691)------------------------------
% 0.11/0.38 % (25691)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.11/0.38 % (25691)Termination reason: Unknown
% 0.11/0.38 % (25691)Termination phase: Saturation
% 0.11/0.38
% 0.11/0.38 % (25691)Memory used [KB]: 837
% 0.11/0.38 % (25691)Time elapsed: 0.008 s
% 0.11/0.38 % (25691)Instructions burned: 4 (million)
% 0.11/0.38 % (25691)------------------------------
% 0.11/0.38 % (25691)------------------------------
% 0.11/0.38 Version : Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
% 0.11/0.38 ???
%------------------------------------------------------------------------------