TSTP Solution File: SET797+4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET797+4 : 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 : n014.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:18:58 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 143 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 155 ( 48 ~; 28 |; 57 &)
% ( 5 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 103 ( 74 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f530,plain,
$false,
inference(resolution,[],[f527,f87]) ).
fof(f87,plain,
~ upper_bound(sK4,sK0,sK2),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
( ~ upper_bound(sK4,sK0,sK2)
& upper_bound(sK4,sK0,sK3)
& subset(sK2,sK3)
& subset(sK3,sK1)
& subset(sK2,sK1)
& order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f46,f54,f53,f52]) ).
fof(f52,plain,
( ? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ upper_bound(X4,X0,X2)
& upper_bound(X4,X0,X3) )
& subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
& order(X0,X1) )
=> ( ? [X3,X2] :
( ? [X4] :
( ~ upper_bound(X4,sK0,X2)
& upper_bound(X4,sK0,X3) )
& subset(X2,X3)
& subset(X3,sK1)
& subset(X2,sK1) )
& order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
( ? [X3,X2] :
( ? [X4] :
( ~ upper_bound(X4,sK0,X2)
& upper_bound(X4,sK0,X3) )
& subset(X2,X3)
& subset(X3,sK1)
& subset(X2,sK1) )
=> ( ? [X4] :
( ~ upper_bound(X4,sK0,sK2)
& upper_bound(X4,sK0,sK3) )
& subset(sK2,sK3)
& subset(sK3,sK1)
& subset(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
( ? [X4] :
( ~ upper_bound(X4,sK0,sK2)
& upper_bound(X4,sK0,sK3) )
=> ( ~ upper_bound(sK4,sK0,sK2)
& upper_bound(sK4,sK0,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ upper_bound(X4,X0,X2)
& upper_bound(X4,X0,X3) )
& subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
& order(X0,X1) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ upper_bound(X4,X0,X2)
& upper_bound(X4,X0,X3) )
& subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2,X3] :
( ( subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
=> ! [X4] :
( upper_bound(X4,X0,X3)
=> upper_bound(X4,X0,X2) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X5,X3] :
( order(X5,X3)
=> ! [X2,X4] :
( ( subset(X2,X4)
& subset(X4,X3)
& subset(X2,X3) )
=> ! [X7] :
( upper_bound(X7,X5,X4)
=> upper_bound(X7,X5,X2) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X5,X3] :
( order(X5,X3)
=> ! [X2,X4] :
( ( subset(X2,X4)
& subset(X4,X3)
& subset(X2,X3) )
=> ! [X7] :
( upper_bound(X7,X5,X4)
=> upper_bound(X7,X5,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV9) ).
fof(f527,plain,
upper_bound(sK4,sK0,sK2),
inference(resolution,[],[f511,f106]) ).
fof(f106,plain,
! [X2,X0,X1] :
( member(sK8(X0,X1,X2),X1)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ( ~ apply(X0,sK8(X0,X1,X2),X2)
& member(sK8(X0,X1,X2),X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f71,f72]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
=> ( ~ apply(X0,sK8(X0,X1,X2),X2)
& member(sK8(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(rectify,[],[f70]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) ) )
& ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X5,X3,X7] :
( upper_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_bound) ).
fof(f511,plain,
~ member(sK8(sK0,sK2,sK4),sK2),
inference(resolution,[],[f510,f85]) ).
fof(f85,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f55]) ).
fof(f510,plain,
! [X0] :
( ~ subset(X0,sK3)
| ~ member(sK8(sK0,sK2,sK4),X0) ),
inference(resolution,[],[f500,f92]) ).
fof(f92,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK5(X0,X1),X1)
& member(sK5(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f57,f58]) ).
fof(f58,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK5(X0,X1),X1)
& member(sK5(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f57,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,[],[f56]) ).
fof(f56,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,[],[f49]) ).
fof(f49,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(f500,plain,
~ member(sK8(sK0,sK2,sK4),sK3),
inference(resolution,[],[f499,f86]) ).
fof(f86,plain,
upper_bound(sK4,sK0,sK3),
inference(cnf_transformation,[],[f55]) ).
fof(f499,plain,
! [X0] :
( ~ upper_bound(sK4,sK0,X0)
| ~ member(sK8(sK0,sK2,sK4),X0) ),
inference(resolution,[],[f498,f105]) ).
fof(f105,plain,
! [X2,X0,X1,X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1)
| ~ upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f498,plain,
~ apply(sK0,sK8(sK0,sK2,sK4),sK4),
inference(resolution,[],[f107,f87]) ).
fof(f107,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| ~ apply(X0,sK8(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET797+4 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n014.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 : Fri May 3 16:25:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (28541)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (28544)WARNING: value z3 for option sas not known
% 0.15/0.38 % (28542)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (28543)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 % (28545)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (28544)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 % (28546)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 % (28547)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 % (28548)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.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [2]
% 0.15/0.40 % (28547)First to succeed.
% 0.15/0.40 % (28547)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28541"
% 0.15/0.40 % (28547)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40 % (28547)------------------------------
% 0.15/0.40 % (28547)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.40 % (28547)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (28547)Memory used [KB]: 1138
% 0.15/0.40 % (28547)Time elapsed: 0.016 s
% 0.15/0.40 % (28547)Instructions burned: 22 (million)
% 0.15/0.40 % (28541)Success in time 0.032 s
%------------------------------------------------------------------------------