TSTP Solution File: SET689+4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET689+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 : n010.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:11:56 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 103 ( 39 ~; 23 |; 31 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 57 ( 45 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f135,plain,
$false,
inference(resolution,[],[f133,f97]) ).
fof(f97,plain,
~ subset(sK0,sK2),
inference(resolution,[],[f96,f57]) ).
fof(f57,plain,
subset(sK2,sK0),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( ~ equal_set(sK0,sK2)
& subset(sK2,sK0)
& subset(sK1,sK2)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f31]) ).
fof(f31,plain,
( ? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ equal_set(sK0,sK2)
& subset(sK2,sK0)
& subset(sK1,sK2)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) )
=> equal_set(X0,X2) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( ( subset(X5,X0)
& subset(X1,X5)
& subset(X0,X1) )
=> equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( ( subset(X5,X0)
& subset(X1,X5)
& subset(X0,X1) )
=> equal_set(X0,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI05) ).
fof(f96,plain,
( ~ subset(sK2,sK0)
| ~ subset(sK0,sK2) ),
inference(resolution,[],[f60,f58]) ).
fof(f58,plain,
~ equal_set(sK0,sK2),
inference(cnf_transformation,[],[f32]) ).
fof(f60,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f133,plain,
subset(sK0,sK2),
inference(resolution,[],[f132,f62]) ).
fof(f62,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,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])],[f34,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f34,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,[],[f33]) ).
fof(f33,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,[],[f29]) ).
fof(f29,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/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f132,plain,
~ member(sK3(sK0,sK2),sK0),
inference(resolution,[],[f124,f55]) ).
fof(f55,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f32]) ).
fof(f124,plain,
! [X0] :
( ~ subset(X0,sK1)
| ~ member(sK3(sK0,sK2),X0) ),
inference(resolution,[],[f117,f61]) ).
fof(f61,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f117,plain,
~ member(sK3(sK0,sK2),sK1),
inference(resolution,[],[f110,f56]) ).
fof(f56,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f32]) ).
fof(f110,plain,
! [X0] :
( ~ subset(X0,sK2)
| ~ member(sK3(sK0,sK2),X0) ),
inference(resolution,[],[f61,f100]) ).
fof(f100,plain,
~ member(sK3(sK0,sK2),sK2),
inference(resolution,[],[f97,f63]) ).
fof(f63,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET689+4 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 00:57:50 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (3276)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (3281)WARNING: value z3 for option sas not known
% 0.15/0.38 % (3282)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (3280)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (3279)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (3281)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.15/0.38 % (3283)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.15/0.38 % (3284)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.15/0.38 % (3285)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.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 % (3284)First to succeed.
% 0.15/0.39 % (3284)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (3284)------------------------------
% 0.15/0.39 % (3284)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (3284)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (3284)Memory used [KB]: 862
% 0.15/0.39 % (3284)Time elapsed: 0.006 s
% 0.15/0.39 % (3284)Instructions burned: 6 (million)
% 0.15/0.39 % (3284)------------------------------
% 0.15/0.39 % (3284)------------------------------
% 0.15/0.39 % (3276)Success in time 0.022 s
%------------------------------------------------------------------------------