TSTP Solution File: SET688+4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET688+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n025.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 : Sun May 5 09:17:41 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 136 ( 58 ~; 27 |; 42 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 46 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f199,plain,
$false,
inference(resolution,[],[f197,f100]) ).
fof(f100,plain,
~ subset(sK1,sK0),
inference(resolution,[],[f98,f54]) ).
fof(f54,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( equal_set(sK0,sK2)
& ~ equal_set(sK1,sK2)
& subset(sK1,sK2)
& ~ equal_set(sK0,sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f25,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( equal_set(X0,X2)
& ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ( equal_set(sK0,sK2)
& ~ equal_set(sK1,sK2)
& subset(sK1,sK2)
& ~ equal_set(sK0,sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
? [X0,X1,X2] :
( equal_set(X0,X2)
& ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
? [X0,X1,X2] :
( equal_set(X0,X2)
& ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2] :
( ( ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X2) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( ( ~ equal_set(X1,X5)
& subset(X1,X5)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( ( ~ equal_set(X1,X5)
& subset(X1,X5)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI04) ).
fof(f98,plain,
( ~ subset(sK0,sK1)
| ~ subset(sK1,sK0) ),
inference(resolution,[],[f62,f55]) ).
fof(f55,plain,
~ equal_set(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f62,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f197,plain,
subset(sK1,sK0),
inference(resolution,[],[f188,f64]) ).
fof(f64,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f33,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f188,plain,
~ member(sK3(sK1,sK0),sK1),
inference(resolution,[],[f174,f56]) ).
fof(f56,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f174,plain,
! [X0] :
( ~ subset(X0,sK2)
| ~ member(sK3(sK1,sK0),X0) ),
inference(resolution,[],[f172,f63]) ).
fof(f63,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f172,plain,
~ member(sK3(sK1,sK0),sK2),
inference(resolution,[],[f160,f58]) ).
fof(f58,plain,
equal_set(sK0,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f160,plain,
! [X0] :
( ~ equal_set(sK0,X0)
| ~ member(sK3(sK1,sK0),X0) ),
inference(resolution,[],[f118,f61]) ).
fof(f61,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f118,plain,
! [X0] :
( ~ subset(X0,sK0)
| ~ member(sK3(sK1,sK0),X0) ),
inference(resolution,[],[f105,f63]) ).
fof(f105,plain,
~ member(sK3(sK1,sK0),sK0),
inference(resolution,[],[f100,f65]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : SET688+4 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 16:51:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (30228)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.32 % (30229)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.32 % (30231)WARNING: value z3 for option sas not known
% 0.16/0.32 TRYING [1]
% 0.16/0.32 TRYING [2]
% 0.16/0.32 % (30231)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.16/0.32 % (30230)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.32 % (30233)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.16/0.32 % (30234)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.16/0.33 % (30232)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.33 TRYING [1]
% 0.16/0.33 % (30235)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.33 TRYING [2]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 % (30234)First to succeed.
% 0.16/0.33 TRYING [3]
% 0.16/0.33 % (30234)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30228"
% 0.16/0.33 % (30234)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33 % (30234)------------------------------
% 0.16/0.33 % (30234)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.33 % (30234)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (30234)Memory used [KB]: 916
% 0.16/0.33 % (30234)Time elapsed: 0.007 s
% 0.16/0.33 % (30234)Instructions burned: 9 (million)
% 0.16/0.33 % (30228)Success in time 0.021 s
%------------------------------------------------------------------------------