TSTP Solution File: SYN399+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN399+1 : TPTP v8.2.0. Released v2.0.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 : n012.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 08:22:16 EDT 2024
% Result : Theorem 0.67s 0.84s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 1 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 96 ( 37 ~; 33 |; 13 &)
% ( 9 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 25 ( 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f35,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f25,f26,f30,f32,f34]) ).
fof(f34,plain,
( ~ spl1_3
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f33]) ).
fof(f33,plain,
( $false
| ~ spl1_3
| ~ spl1_4 ),
inference(subsumption_resolution,[],[f29,f24]) ).
fof(f24,plain,
( ! [X1] : f(X1)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl1_3
<=> ! [X1] : f(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f29,plain,
( ! [X2] : ~ f(X2)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl1_4
<=> ! [X2] : ~ f(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f32,plain,
( spl1_1
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f31]) ).
fof(f31,plain,
( $false
| spl1_1
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f16,f24]) ).
fof(f16,plain,
( ~ f(sK0)
| spl1_1 ),
inference(avatar_component_clause,[],[f14]) ).
fof(f14,plain,
( spl1_1
<=> f(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f30,plain,
( spl1_4
| spl1_2 ),
inference(avatar_split_clause,[],[f9,f18,f28]) ).
fof(f18,plain,
( spl1_2
<=> p ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f9,plain,
! [X2] :
( p
| ~ f(X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ( ~ p
| ~ f(sK0) )
& ( p
| ! [X1] : f(X1) )
& ! [X2] :
( ( f(X2)
| ~ p )
& ( p
| ~ f(X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
( ? [X0] : ~ f(X0)
=> ~ f(sK0) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ~ p
| ? [X0] : ~ f(X0) )
& ( p
| ! [X1] : f(X1) )
& ! [X2] :
( ( f(X2)
| ~ p )
& ( p
| ~ f(X2) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ~ p
| ? [X1] : ~ f(X1) )
& ( p
| ! [X1] : f(X1) )
& ! [X0] :
( ( f(X0)
| ~ p )
& ( p
| ~ f(X0) ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ( ~ p
| ? [X1] : ~ f(X1) )
& ( p
| ! [X1] : f(X1) )
& ! [X0] :
( ( f(X0)
| ~ p )
& ( p
| ~ f(X0) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ( ! [X1] : f(X1)
<~> p )
& ! [X0] :
( f(X0)
<=> p ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( f(X0)
<=> p )
=> ( ! [X1] : f(X1)
<=> p ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( f(X0)
<=> p )
=> ( ! [X1] : f(X1)
<=> p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish223) ).
fof(f26,plain,
( ~ spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f10,f23,f18]) ).
fof(f10,plain,
! [X2] :
( f(X2)
| ~ p ),
inference(cnf_transformation,[],[f8]) ).
fof(f25,plain,
( spl1_3
| spl1_2 ),
inference(avatar_split_clause,[],[f11,f18,f23]) ).
fof(f11,plain,
! [X1] :
( p
| f(X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f21,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f12,f18,f14]) ).
fof(f12,plain,
( ~ p
| ~ f(sK0) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN399+1 : TPTP v8.2.0. Released v2.0.0.
% 0.03/0.14 % 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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 13:53:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_EPR_NEQ problem
% 0.13/0.35 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/benchmark/theBenchmark.p
% 0.67/0.84 % (21146)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.67/0.84 % (21144)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 (2995ds/34Mi)
% 0.67/0.84 % (21147)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.67/0.84 % (21145)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 (2995ds/51Mi)
% 0.67/0.84 % (21150)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 (2995ds/83Mi)
% 0.67/0.84 % (21148)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 (2995ds/34Mi)
% 0.67/0.84 % (21149)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.67/0.84 % (21151)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 (2995ds/56Mi)
% 0.67/0.84 % (21146)Also succeeded, but the first one will report.
% 0.67/0.84 % (21147)First to succeed.
% 0.67/0.84 % (21144)Also succeeded, but the first one will report.
% 0.67/0.84 % (21145)Also succeeded, but the first one will report.
% 0.67/0.84 % (21148)Also succeeded, but the first one will report.
% 0.67/0.84 % (21150)Also succeeded, but the first one will report.
% 0.67/0.84 % (21149)Also succeeded, but the first one will report.
% 0.67/0.84 % (21151)Also succeeded, but the first one will report.
% 0.67/0.84 % (21147)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21143"
% 0.67/0.84 % (21147)Refutation found. Thanks to Tanya!
% 0.67/0.84 % SZS status Theorem for theBenchmark
% 0.67/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 0.67/0.84 % (21147)------------------------------
% 0.67/0.84 % (21147)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.84 % (21147)Termination reason: Refutation
% 0.67/0.84
% 0.67/0.84 % (21147)Memory used [KB]: 973
% 0.67/0.84 % (21147)Time elapsed: 0.003 s
% 0.67/0.84 % (21147)Instructions burned: 2 (million)
% 0.67/0.84 % (21143)Success in time 0.487 s
% 0.67/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------