TSTP Solution File: SYN923+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN923+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 : n018.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 12:07:51 EDT 2024
% Result : Theorem 0.59s 0.79s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 20 ~; 15 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 24 ( 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,plain,
$false,
inference(avatar_sat_refutation,[],[f17,f19,f21]) ).
fof(f21,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f20]) ).
fof(f20,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f13,f9]) ).
fof(f9,plain,
~ p(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( ~ q(sK0)
& ~ p(sK0)
& ( ! [X1] : q(X1)
| ! [X2] : p(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f6,plain,
( ? [X0] :
( ~ q(X0)
& ~ p(X0) )
=> ( ~ q(sK0)
& ~ p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ? [X0] :
( ~ q(X0)
& ~ p(X0) )
& ( ! [X1] : q(X1)
| ! [X2] : p(X2) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ? [X2] :
( ~ q(X2)
& ~ p(X2) )
& ( ! [X0] : q(X0)
| ! [X1] : p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X0] : q(X0)
| ! [X1] : p(X1) )
=> ! [X2] :
( q(X2)
| p(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X0] : q(X0)
| ! [X0] : p(X0) )
=> ! [X0] :
( q(X0)
| p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X0] : q(X0)
| ! [X0] : p(X0) )
=> ! [X0] :
( q(X0)
| p(X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.qikWZcAEFY/Vampire---4.8_29166',prove_this) ).
fof(f13,plain,
( ! [X2] : p(X2)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f12,plain,
( spl1_1
<=> ! [X2] : p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f19,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f18]) ).
fof(f18,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f16,f10]) ).
fof(f10,plain,
~ q(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
( ! [X1] : q(X1)
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f15,plain,
( spl1_2
<=> ! [X1] : q(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f17,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f8,f15,f12]) ).
fof(f8,plain,
! [X2,X1] :
( q(X1)
| p(X2) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYN923+1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.11 % 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.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 17:51:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_EPR_NEQ problem
% 0.10/0.31 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.qikWZcAEFY/Vampire---4.8_29166
% 0.59/0.78 % (29278)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.59/0.78 % (29281)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.59/0.78 % (29276)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 (2995ds/34Mi)
% 0.59/0.78 % (29279)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.59/0.78 % (29280)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 (2995ds/34Mi)
% 0.59/0.78 % (29282)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 (2995ds/83Mi)
% 0.59/0.78 % (29277)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 (2995ds/51Mi)
% 0.59/0.79 % (29283)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 (2995ds/56Mi)
% 0.59/0.79 % (29279)Also succeeded, but the first one will report.
% 0.59/0.79 % (29280)Also succeeded, but the first one will report.
% 0.59/0.79 % (29281)Also succeeded, but the first one will report.
% 0.59/0.79 % (29277)Also succeeded, but the first one will report.
% 0.59/0.79 % (29278)Also succeeded, but the first one will report.
% 0.59/0.79 % (29282)Also succeeded, but the first one will report.
% 0.59/0.79 % (29276)First to succeed.
% 0.59/0.79 % (29283)Also succeeded, but the first one will report.
% 0.59/0.79 % (29276)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29273"
% 0.59/0.79 % (29276)Refutation found. Thanks to Tanya!
% 0.59/0.79 % SZS status Theorem for Vampire---4
% 0.59/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.79 % (29276)------------------------------
% 0.59/0.79 % (29276)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (29276)Termination reason: Refutation
% 0.59/0.79
% 0.59/0.79 % (29276)Memory used [KB]: 966
% 0.59/0.79 % (29276)Time elapsed: 0.004 s
% 0.59/0.79 % (29276)Instructions burned: 2 (million)
% 0.59/0.79 % (29273)Success in time 0.475 s
% 0.59/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------