TSTP Solution File: SET584+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET584+3 : TPTP v8.1.2. 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 : 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 : Wed May 1 03:48:08 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 83 ( 34 ~; 25 |; 16 &)
% ( 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 : 57 ( 48 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f70,plain,
$false,
inference(subsumption_resolution,[],[f64,f51]) ).
fof(f51,plain,
member(sK3(union(sK0,sK2),union(sK1,sK2)),sK0),
inference(unit_resulting_resolution,[],[f27,f34,f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,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,[],[f12]) ).
fof(f12,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/sandbox/tmp/tmp.n3VuyvY3nk/Vampire---4.8_23463',union_defn) ).
fof(f34,plain,
~ member(sK3(union(sK0,sK2),union(sK1,sK2)),sK2),
inference(unit_resulting_resolution,[],[f28,f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
~ member(sK3(union(sK0,sK2),union(sK1,sK2)),union(sK1,sK2)),
inference(unit_resulting_resolution,[],[f19,f26]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,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])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,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,[],[f14]) ).
fof(f14,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,[],[f9]) ).
fof(f9,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/sandbox/tmp/tmp.n3VuyvY3nk/Vampire---4.8_23463',subset_defn) ).
fof(f19,plain,
~ subset(union(sK0,sK2),union(sK1,sK2)),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ~ subset(union(sK0,sK2),union(sK1,sK2))
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10]) ).
fof(f10,plain,
( ? [X0,X1,X2] :
( ~ subset(union(X0,X2),union(X1,X2))
& subset(X0,X1) )
=> ( ~ subset(union(sK0,sK2),union(sK1,sK2))
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0,X1,X2] :
( ~ subset(union(X0,X2),union(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(union(X0,X2),union(X1,X2)) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(union(X0,X2),union(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.n3VuyvY3nk/Vampire---4.8_23463',prove_th33) ).
fof(f27,plain,
member(sK3(union(sK0,sK2),union(sK1,sK2)),union(sK0,sK2)),
inference(unit_resulting_resolution,[],[f19,f25]) ).
fof(f25,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f64,plain,
~ member(sK3(union(sK0,sK2),union(sK1,sK2)),sK0),
inference(unit_resulting_resolution,[],[f18,f35,f24]) ).
fof(f24,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
~ member(sK3(union(sK0,sK2),union(sK1,sK2)),sK1),
inference(unit_resulting_resolution,[],[f28,f21]) ).
fof(f21,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET584+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.12 % 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.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 17:01:19 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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/tmp/tmp.n3VuyvY3nk/Vampire---4.8_23463
% 0.61/0.80 % (23575)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.80 % (23576)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.80 % (23574)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.80 % (23573)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.80 % (23571)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.80 % (23572)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 Vampire---4 for (2995ds/51Mi)
% 0.61/0.80 % (23577)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.80 % (23578)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.80 % (23576)Refutation not found, incomplete strategy% (23576)------------------------------
% 0.61/0.80 % (23576)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (23576)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (23576)Memory used [KB]: 952
% 0.61/0.80 % (23576)Time elapsed: 0.003 s
% 0.61/0.80 % (23576)Instructions burned: 2 (million)
% 0.61/0.80 % (23576)------------------------------
% 0.61/0.80 % (23576)------------------------------
% 0.61/0.80 % (23574)First to succeed.
% 0.61/0.80 % (23577)Also succeeded, but the first one will report.
% 0.61/0.81 % (23574)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (23574)------------------------------
% 0.61/0.81 % (23574)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81 % (23574)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (23574)Memory used [KB]: 977
% 0.61/0.81 % (23574)Time elapsed: 0.004 s
% 0.61/0.81 % (23574)Instructions burned: 4 (million)
% 0.61/0.81 % (23574)------------------------------
% 0.61/0.81 % (23574)------------------------------
% 0.61/0.81 % (23570)Success in time 0.481 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------