TSTP Solution File: SEU294+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU294+1 : TPTP v8.2.0. Released v3.3.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 : n025.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:46:35 EDT 2024
% Result : Theorem 0.71s 0.91s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 44 ( 16 ~; 9 |; 12 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 26 ( 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,plain,
$false,
inference(subsumption_resolution,[],[f94,f75]) ).
fof(f75,plain,
~ finite(sK0),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
( ~ finite(sK0)
& finite(sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f60,f65]) ).
fof(f65,plain,
( ? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) )
=> ( ~ finite(sK0)
& finite(sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
? [X0,X1] :
( ~ finite(X0)
& finite(X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[],[f40]) ).
fof(f40,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f94,plain,
finite(sK0),
inference(subsumption_resolution,[],[f92,f74]) ).
fof(f74,plain,
finite(sK1),
inference(cnf_transformation,[],[f66]) ).
fof(f92,plain,
( ~ finite(sK1)
| finite(sK0) ),
inference(resolution,[],[f91,f73]) ).
fof(f73,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f66]) ).
fof(f91,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(resolution,[],[f84,f86]) ).
fof(f86,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f44]) ).
fof(f44,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f84,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU294+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.15 % 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.16/0.39 % Computer : n025.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Sun May 19 18:02:38 EDT 2024
% 0.16/0.40 % CPUTime :
% 0.16/0.40 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.40 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.71/0.91 % (17154)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 (2994ds/34Mi)
% 0.71/0.91 % (17155)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 (2994ds/51Mi)
% 0.71/0.91 % (17156)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.91 % (17157)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.91 % (17158)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 (2994ds/34Mi)
% 0.71/0.91 % (17159)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.91 % (17160)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 (2994ds/83Mi)
% 0.71/0.91 % (17161)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 (2994ds/56Mi)
% 0.71/0.91 % (17159)Refutation not found, incomplete strategy% (17159)------------------------------
% 0.71/0.91 % (17159)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.91 % (17159)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.91
% 0.71/0.91 % (17159)Memory used [KB]: 965
% 0.71/0.91 % (17159)Time elapsed: 0.003 s
% 0.71/0.91 % (17159)Instructions burned: 2 (million)
% 0.71/0.91 % (17154)First to succeed.
% 0.71/0.91 % (17157)Also succeeded, but the first one will report.
% 0.71/0.91 % (17159)------------------------------
% 0.71/0.91 % (17159)------------------------------
% 0.71/0.91 % (17161)Also succeeded, but the first one will report.
% 0.71/0.91 % (17154)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17153"
% 0.71/0.91 % (17158)Refutation not found, incomplete strategy% (17158)------------------------------
% 0.71/0.91 % (17158)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.91 % (17158)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.91
% 0.71/0.91 % (17158)Memory used [KB]: 1114
% 0.71/0.91 % (17158)Time elapsed: 0.004 s
% 0.71/0.91 % (17158)Instructions burned: 4 (million)
% 0.71/0.91 % (17160)Also succeeded, but the first one will report.
% 0.71/0.91 % (17158)------------------------------
% 0.71/0.91 % (17158)------------------------------
% 0.71/0.91 % (17154)Refutation found. Thanks to Tanya!
% 0.71/0.91 % SZS status Theorem for theBenchmark
% 0.71/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.91 % (17154)------------------------------
% 0.71/0.91 % (17154)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.91 % (17154)Termination reason: Refutation
% 0.71/0.91
% 0.71/0.91 % (17154)Memory used [KB]: 986
% 0.71/0.91 % (17154)Time elapsed: 0.004 s
% 0.71/0.91 % (17154)Instructions burned: 3 (million)
% 0.71/0.91 % (17153)Success in time 0.503 s
% 0.71/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------