TSTP Solution File: SET002+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET002+4 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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 May 21 03:07:33 EDT 2024
% Result : Theorem 0.42s 0.59s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 62 ( 23 ~; 26 |; 3 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 38 ( 36 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f69,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f45,f68]) ).
fof(f68,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f67]) ).
fof(f67,plain,
( $false
| spl2_2 ),
inference(subsumption_resolution,[],[f58,f47]) ).
fof(f47,plain,
( member(sK1(sK0,union(sK0,sK0)),sK0)
| spl2_2 ),
inference(unit_resulting_resolution,[],[f36,f26]) ).
fof(f26,plain,
! [X0,X1] :
( member(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[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(f36,plain,
( ~ subset(sK0,union(sK0,sK0))
| spl2_2 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl2_2
<=> subset(sK0,union(sK0,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f58,plain,
( ~ member(sK1(sK0,union(sK0,sK0)),sK0)
| spl2_2 ),
inference(resolution,[],[f48,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
fof(f48,plain,
( ~ member(sK1(sK0,union(sK0,sK0)),union(sK0,sK0))
| spl2_2 ),
inference(unit_resulting_resolution,[],[f36,f27]) ).
fof(f27,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f45,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f44]) ).
fof(f44,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f40,f38]) ).
fof(f38,plain,
( member(sK1(union(sK0,sK0),sK0),union(sK0,sK0))
| spl2_1 ),
inference(unit_resulting_resolution,[],[f32,f26]) ).
fof(f32,plain,
( ~ subset(union(sK0,sK0),sK0)
| spl2_1 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl2_1
<=> subset(union(sK0,sK0),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f40,plain,
( ~ member(sK1(union(sK0,sK0),sK0),union(sK0,sK0))
| spl2_1 ),
inference(unit_resulting_resolution,[],[f39,f39,f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f39,plain,
( ~ member(sK1(union(sK0,sK0),sK0),sK0)
| spl2_1 ),
inference(unit_resulting_resolution,[],[f32,f27]) ).
fof(f37,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f28,f34,f30]) ).
fof(f28,plain,
( ~ subset(sK0,union(sK0,sK0))
| ~ subset(union(sK0,sK0),sK0) ),
inference(resolution,[],[f21,f25]) ).
fof(f25,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,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(f21,plain,
~ equal_set(union(sK0,sK0),sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
? [X0] : ~ equal_set(union(X0,X0),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(union(X0,X0),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] : equal_set(union(X0,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI14) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET002+4 : TPTP v8.2.0. Released v2.2.0.
% 0.00/0.08 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.07/0.26 % Computer : n022.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon May 20 13:06:22 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.07/0.26 This is a FOF_THM_RFO_SEQ problem
% 0.07/0.27 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.59 % (1735)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.42/0.59 % (1729)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.42/0.59 % (1730)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.42/0.59 % (1732)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.42/0.59 % (1735)First to succeed.
% 0.42/0.59 % (1731)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.42/0.59 % (1733)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.42/0.59 % (1734)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.42/0.59 % (1729)Refutation not found, incomplete strategy% (1729)------------------------------
% 0.42/0.59 % (1729)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.59 % (1729)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.59
% 0.42/0.59 % (1729)Memory used [KB]: 981
% 0.42/0.59 % (1732)Refutation not found, incomplete strategy% (1732)------------------------------
% 0.42/0.59 % (1732)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.59 % (1732)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.59 % (1735)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1695"
% 0.42/0.59
% 0.42/0.59 % (1732)Memory used [KB]: 980
% 0.42/0.59 % (1732)Time elapsed: 0.002 s
% 0.42/0.59 % (1732)Instructions burned: 2 (million)
% 0.42/0.59 % (1729)Time elapsed: 0.002 s
% 0.42/0.59 % (1729)Instructions burned: 2 (million)
% 0.42/0.59 % (1734)Refutation not found, incomplete strategy% (1734)------------------------------
% 0.42/0.59 % (1734)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.59 % (1734)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.59
% 0.42/0.59 % (1734)Memory used [KB]: 972
% 0.42/0.59 % (1734)Time elapsed: 0.002 s
% 0.42/0.59 % (1734)Instructions burned: 2 (million)
% 0.42/0.59 % (1732)------------------------------
% 0.42/0.59 % (1732)------------------------------
% 0.42/0.59 % (1729)------------------------------
% 0.42/0.59 % (1729)------------------------------
% 0.42/0.59 % (1735)Refutation found. Thanks to Tanya!
% 0.42/0.59 % SZS status Theorem for theBenchmark
% 0.42/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.59 % (1735)------------------------------
% 0.42/0.59 % (1735)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.59 % (1735)Termination reason: Refutation
% 0.42/0.59
% 0.42/0.59 % (1735)Memory used [KB]: 1007
% 0.42/0.59 % (1735)Time elapsed: 0.003 s
% 0.42/0.59 % (1735)Instructions burned: 3 (million)
% 0.42/0.59 % (1695)Success in time 0.318 s
% 0.42/0.59 % Vampire---4.8 exiting
%------------------------------------------------------------------------------