TSTP Solution File: SET585+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET585+3 : 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 : n032.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:08:38 EDT 2024
% Result : Theorem 0.14s 0.30s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 10 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 6 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,plain,
$false,
inference(unit_resulting_resolution,[],[f37,f34,f36,f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_subset) ).
fof(f36,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union) ).
fof(f34,plain,
~ subset(intersection(sK1,sK2),union(sK1,sK3)),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
~ subset(intersection(sK1,sK2),union(sK1,sK3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f13,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2] : ~ subset(intersection(X0,X1),union(X0,X2))
=> ~ subset(intersection(sK1,sK2),union(sK1,sK3)) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0,X1,X2] : ~ subset(intersection(X0,X1),union(X0,X2)),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] : subset(intersection(X0,X1),union(X0,X2)),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X2] : subset(intersection(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).
fof(f37,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET585+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Tue Apr 30 01:30:20 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.10/0.29 % (22718)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.30 % (22729)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.30 % (22730)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.14/0.30 % (22731)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.14/0.30 % (22732)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.14/0.30 TRYING [1]
% 0.14/0.30 TRYING [2]
% 0.14/0.30 TRYING [3]
% 0.14/0.30 % (22732)First to succeed.
% 0.14/0.30 % (22731)Also succeeded, but the first one will report.
% 0.14/0.30 % (22732)Refutation found. Thanks to Tanya!
% 0.14/0.30 % SZS status Theorem for theBenchmark
% 0.14/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.30 % (22732)------------------------------
% 0.14/0.30 % (22732)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.30 % (22732)Termination reason: Refutation
% 0.14/0.30
% 0.14/0.30 % (22732)Memory used [KB]: 830
% 0.14/0.30 % (22732)Time elapsed: 0.003 s
% 0.14/0.30 % (22732)Instructions burned: 5 (million)
% 0.14/0.30 % (22732)------------------------------
% 0.14/0.30 % (22732)------------------------------
% 0.14/0.30 % (22718)Success in time 0.012 s
%------------------------------------------------------------------------------