TSTP Solution File: SET585+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET585+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 : Sun May 5 09:07:22 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 7 |; 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 : 35 ( 29 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(resolution,[],[f80,f33]) ).
fof(f33,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/tmp/tmp.5weAnL9CBO/Vampire---4.8_32683',intersection_is_subset) ).
fof(f80,plain,
~ subset(intersection(sK2,sK3),sK2),
inference(resolution,[],[f76,f50]) ).
fof(f50,plain,
~ subset(intersection(sK2,sK3),union(sK2,sK4)),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
~ subset(intersection(sK2,sK3),union(sK2,sK4)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f16,f29]) ).
fof(f29,plain,
( ? [X0,X1,X2] : ~ subset(intersection(X0,X1),union(X0,X2))
=> ~ subset(intersection(sK2,sK3),union(sK2,sK4)) ),
introduced(choice_axiom,[]) ).
fof(f16,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/tmp/tmp.5weAnL9CBO/Vampire---4.8_32683',prove_intersection_subset_of_union) ).
fof(f76,plain,
! [X2,X0,X1] :
( subset(X0,union(X1,X2))
| ~ subset(X0,X1) ),
inference(resolution,[],[f31,f32]) ).
fof(f32,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/tmp/tmp.5weAnL9CBO/Vampire---4.8_32683',subset_of_union) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f13]) ).
fof(f13,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/tmp/tmp.5weAnL9CBO/Vampire---4.8_32683',transitivity_of_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET585+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/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.16/0.36 % Computer : n002.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 16:42:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.36 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.5weAnL9CBO/Vampire---4.8_32683
% 0.58/0.75 % (583)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.58/0.76 % (582)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.58/0.76 % (583)First to succeed.
% 0.58/0.76 % (583)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-471"
% 0.58/0.76 % (583)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (583)------------------------------
% 0.58/0.76 % (583)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (583)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (583)Memory used [KB]: 984
% 0.58/0.76 % (583)Time elapsed: 0.003 s
% 0.58/0.76 % (583)Instructions burned: 4 (million)
% 0.58/0.76 % (471)Success in time 0.388 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------