TSTP Solution File: SET027+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET027+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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:57 EDT 2024
% Result : Theorem 0.49s 0.70s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 25 ~; 14 |; 21 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 33 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f41,plain,
$false,
inference(subsumption_resolution,[],[f37,f34]) ).
fof(f34,plain,
member(sK3(sK0,sK2),sK1),
inference(unit_resulting_resolution,[],[f24,f30,f27]) ).
fof(f27,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,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])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(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,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f30,plain,
member(sK3(sK0,sK2),sK0),
inference(unit_resulting_resolution,[],[f26,f28]) ).
fof(f28,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f26,plain,
~ subset(sK0,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ~ subset(sK0,sK2)
& subset(sK1,sK2)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ subset(sK0,sK2)
& subset(sK1,sK2)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( ( subset(X1,X5)
& subset(X0,X1) )
=> subset(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( ( subset(X1,X5)
& subset(X0,X1) )
=> subset(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI03) ).
fof(f24,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
~ member(sK3(sK0,sK2),sK1),
inference(unit_resulting_resolution,[],[f25,f31,f27]) ).
fof(f31,plain,
~ member(sK3(sK0,sK2),sK2),
inference(unit_resulting_resolution,[],[f26,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f25,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET027+4 : TPTP v8.2.0. Released v2.2.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 12:04:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.69 % (15081)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.49/0.69 % (15084)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.49/0.69 % (15083)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.49/0.69 % (15088)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.49/0.69 % (15084)First to succeed.
% 0.49/0.69 % (15088)Refutation not found, incomplete strategy% (15088)------------------------------
% 0.49/0.69 % (15088)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.69 % (15088)Termination reason: Refutation not found, incomplete strategy
% 0.49/0.69
% 0.49/0.69 % (15088)Memory used [KB]: 969
% 0.49/0.69 % (15088)Time elapsed: 0.002 s
% 0.49/0.69 % (15088)Instructions burned: 2 (million)
% 0.49/0.69 % (15081)Also succeeded, but the first one will report.
% 0.49/0.69 % (15084)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15080"
% 0.49/0.69 % (15088)------------------------------
% 0.49/0.69 % (15088)------------------------------
% 0.49/0.70 % (15084)Refutation found. Thanks to Tanya!
% 0.49/0.70 % SZS status Theorem for theBenchmark
% 0.49/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.49/0.70 % (15084)------------------------------
% 0.49/0.70 % (15084)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.70 % (15084)Termination reason: Refutation
% 0.49/0.70
% 0.49/0.70 % (15084)Memory used [KB]: 994
% 0.49/0.70 % (15084)Time elapsed: 0.003 s
% 0.49/0.70 % (15084)Instructions burned: 3 (million)
% 0.49/0.70 % (15080)Success in time 0.344 s
% 0.49/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------