TSTP Solution File: SYN946+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN946+1 : TPTP v8.1.2. Released v3.1.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 : n014.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 04:45:04 EDT 2024
% Result : Theorem 0.60s 0.75s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 19 ( 6 ~; 3 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 23 ( 13 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,plain,
$false,
inference(resolution,[],[f8,f7]) ).
fof(f7,plain,
! [X1] : p(X1),
inference(cnf_transformation,[],[f6]) ).
fof(f6,plain,
( ! [X2] :
? [X3] : ~ p(X3)
& ! [X1] : p(X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
~ ( ! [X1] : p(X1)
=> ? [X2] :
! [X3] : p(X3) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f4,plain,
~ ( ( ? [X0] : q(X0)
& ! [X1] : p(X1) )
=> ? [X2] :
! [X3] : p(X3) ),
inference(pure_predicate_removal,[],[f3]) ).
fof(f3,plain,
~ ( ( ? [X0] : q(X0)
& ! [X1] : p(X1) )
=> ? [X2] :
! [X3] :
( r(X2)
| p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ? [X1] : q(X1)
& ! [X0] : p(X0) )
=> ? [X2] :
! [X1] :
( r(X2)
| p(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ? [X1] : q(X1)
& ! [X0] : p(X0) )
=> ? [X2] :
! [X1] :
( r(X2)
| p(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.rsGxV0hEZ6/Vampire---4.8_32190',prove_this) ).
fof(f8,plain,
~ p(sK0),
inference(cnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN946+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/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 : n014.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 : Tue Apr 30 17:16:33 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_EPR_NEQ problem
% 0.16/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.rsGxV0hEZ6/Vampire---4.8_32190
% 0.60/0.75 % (32452)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 (2996ds/83Mi)
% 0.60/0.75 % (32452)First to succeed.
% 0.60/0.75 % (32453)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 (2996ds/56Mi)
% 0.60/0.75 % (32446)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.60/0.75 % (32448)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.60/0.75 % (32447)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.60/0.75 % (32450)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.60/0.75 % (32451)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.60/0.75 % (32449)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.60/0.75 % (32453)Also succeeded, but the first one will report.
% 0.60/0.75 % (32452)Refutation found. Thanks to Tanya!
% 0.60/0.75 % SZS status Theorem for Vampire---4
% 0.60/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.75 % (32452)------------------------------
% 0.60/0.75 % (32452)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.75 % (32452)Termination reason: Refutation
% 0.60/0.75
% 0.60/0.75 % (32452)Memory used [KB]: 955
% 0.60/0.75 % (32452)Time elapsed: 0.002 s
% 0.60/0.75 % (32452)Instructions burned: 2 (million)
% 0.60/0.75 % (32452)------------------------------
% 0.60/0.75 % (32452)------------------------------
% 0.60/0.75 % (32442)Success in time 0.377 s
% 0.60/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------