TSTP Solution File: SET014+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET014+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 : n024.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:03:59 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 87 ( 32 ~; 23 |; 24 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 42 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f317,plain,
$false,
inference(unit_resulting_resolution,[],[f55,f54,f44,f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f44,plain,
member(sK5(union(sK1,sK3),sK2),union(sK1,sK3)),
inference(unit_resulting_resolution,[],[f28,f38]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK5(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,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])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK5(X0,X1),X1)
& member(sK5(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,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,[],[f20]) ).
fof(f20,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,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f28,plain,
~ subset(union(sK1,sK3),sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ~ subset(union(sK1,sK3),sK2)
& subset(sK3,sK2)
& subset(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f9,f13]) ).
fof(f13,plain,
( ? [X0,X1,X2] :
( ~ subset(union(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) )
=> ( ~ subset(union(sK1,sK3),sK2)
& subset(sK3,sK2)
& subset(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ subset(union(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
? [X0,X1,X2] :
( ~ subset(union(X0,X2),X1)
& subset(X2,X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(union(X0,X2),X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_subset) ).
fof(f54,plain,
~ member(sK5(union(sK1,sK3),sK2),sK1),
inference(unit_resulting_resolution,[],[f46,f26,f37]) ).
fof(f37,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f26,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f46,plain,
~ member(sK5(union(sK1,sK3),sK2),sK2),
inference(unit_resulting_resolution,[],[f28,f39]) ).
fof(f39,plain,
! [X0,X1] :
( ~ member(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f55,plain,
~ member(sK5(union(sK1,sK3),sK2),sK3),
inference(unit_resulting_resolution,[],[f46,f27,f37]) ).
fof(f27,plain,
subset(sK3,sK2),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET014+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 01:21:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (8757)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (8760)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.37 % (8761)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.37 % (8764)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.20/0.37 % (8763)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.37 % (8765)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.20/0.37 % (8766)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.20/0.37 % (8762)WARNING: value z3 for option sas not known
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [2]
% 0.20/0.37 % (8762)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.20/0.38 TRYING [3]
% 0.20/0.38 TRYING [1]
% 0.20/0.38 TRYING [2]
% 0.20/0.38 TRYING [4]
% 0.20/0.38 % (8766)First to succeed.
% 0.20/0.38 TRYING [3]
% 0.20/0.38 % (8766)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (8766)------------------------------
% 0.20/0.38 % (8766)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.38 % (8766)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (8766)Memory used [KB]: 840
% 0.20/0.38 % (8766)Time elapsed: 0.009 s
% 0.20/0.38 % (8766)Instructions burned: 14 (million)
% 0.20/0.38 % (8766)------------------------------
% 0.20/0.38 % (8766)------------------------------
% 0.20/0.38 % (8757)Success in time 0.026 s
%------------------------------------------------------------------------------