TSTP Solution File: SET581+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET581+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 : n002.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:07 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 60 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 24 ~; 13 |; 17 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 30 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,plain,
$false,
inference(subsumption_resolution,[],[f44,f21]) ).
fof(f21,plain,
member(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ~ not_equal(intersection(sK1,sK2),empty_set)
& member(sK0,sK2)
& member(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f13]) ).
fof(f13,plain,
( ? [X0,X1,X2] :
( ~ not_equal(intersection(X1,X2),empty_set)
& member(X0,X2)
& member(X0,X1) )
=> ( ~ not_equal(intersection(sK1,sK2),empty_set)
& member(sK0,sK2)
& member(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ~ not_equal(intersection(X1,X2),empty_set)
& member(X0,X2)
& member(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
? [X0,X1,X2] :
( ~ not_equal(intersection(X1,X2),empty_set)
& member(X0,X2)
& member(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X2)
& member(X0,X1) )
=> not_equal(intersection(X1,X2),empty_set) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( ( member(X0,X2)
& member(X0,X1) )
=> not_equal(intersection(X1,X2),empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.Zo9OmJa8hW/Vampire---4.8_25869',prove_th24) ).
fof(f44,plain,
~ member(sK0,sK1),
inference(resolution,[],[f41,f22]) ).
fof(f22,plain,
member(sK0,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f41,plain,
! [X0] :
( ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(subsumption_resolution,[],[f40,f28]) ).
fof(f28,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/tmp/tmp.Zo9OmJa8hW/Vampire---4.8_25869',empty_set_defn) ).
fof(f40,plain,
! [X0] :
( member(X0,empty_set)
| ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(superposition,[],[f27,f36]) ).
fof(f36,plain,
empty_set = intersection(sK1,sK2),
inference(resolution,[],[f23,f29]) ).
fof(f29,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( X0 != X1
=> not_equal(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( not_equal(X0,X1)
<=> X0 != X1 ),
file('/export/starexec/sandbox/tmp/tmp.Zo9OmJa8hW/Vampire---4.8_25869',not_equal_defn) ).
fof(f23,plain,
~ not_equal(intersection(sK1,sK2),empty_set),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.Zo9OmJa8hW/Vampire---4.8_25869',intersection_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET581+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.15 % 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.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 17:30:40 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37 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.Zo9OmJa8hW/Vampire---4.8_25869
% 0.55/0.75 % (26121)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 (2996ds/34Mi)
% 0.55/0.75 % (26123)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.75 % (26124)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.75 % (26122)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 (2996ds/51Mi)
% 0.55/0.75 % (26125)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 (2996ds/34Mi)
% 0.55/0.75 % (26126)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.75 % (26125)Refutation not found, incomplete strategy% (26125)------------------------------
% 0.55/0.75 % (26125)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (26125)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (26125)Memory used [KB]: 955
% 0.55/0.75 % (26125)Time elapsed: 0.003 s
% 0.55/0.75 % (26125)Instructions burned: 2 (million)
% 0.55/0.75 % (26125)------------------------------
% 0.55/0.75 % (26125)------------------------------
% 0.55/0.75 % (26126)First to succeed.
% 0.55/0.75 % (26126)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for Vampire---4
% 0.55/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75 % (26126)------------------------------
% 0.55/0.75 % (26126)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (26126)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (26126)Memory used [KB]: 965
% 0.55/0.75 % (26126)Time elapsed: 0.003 s
% 0.55/0.75 % (26126)Instructions burned: 3 (million)
% 0.55/0.75 % (26126)------------------------------
% 0.55/0.75 % (26126)------------------------------
% 0.55/0.75 % (26117)Success in time 0.381 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------