TSTP Solution File: SYN937+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN937+1 : TPTP v8.2.0. 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 : n005.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:33:06 EDT 2024
% Result : Theorem 0.11s 0.55s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 2 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 110 ( 44 ~; 37 |; 14 &)
% ( 6 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 21 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f31,f33,f35]) ).
fof(f35,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f34]) ).
fof(f34,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f21,f30]) ).
fof(f30,plain,
( ! [X3] : ~ p(X3)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl2_3
<=> ! [X3] : ~ p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f21,plain,
( p(sK1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_1
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f33,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f25,f30]) ).
fof(f25,plain,
( p(sK0)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl2_2
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f31,plain,
( spl2_3
| spl2_3 ),
inference(avatar_split_clause,[],[f27,f29,f29]) ).
fof(f27,plain,
! [X2,X3] :
( ~ p(X2)
| ~ p(X3) ),
inference(subsumption_resolution,[],[f16,f17]) ).
fof(f17,plain,
~ c,
inference(duplicate_literal_removal,[],[f15]) ).
fof(f15,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ( ( ~ c
& p(sK0) )
| ( ~ c
& p(sK1) ) )
& ( c
| ! [X2] : ~ p(X2)
| ! [X3] :
( c
| ~ p(X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X0] : p(X0)
=> p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X1] :
( ~ c
& p(X1) )
=> ( ~ c
& p(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ( ~ c
& ? [X0] : p(X0) )
| ? [X1] :
( ~ c
& p(X1) ) )
& ( c
| ! [X2] : ~ p(X2)
| ! [X3] :
( c
| ~ p(X3) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ( ~ c
& ? [X1] : p(X1) )
| ? [X0] :
( ~ c
& p(X0) ) )
& ( c
| ! [X1] : ~ p(X1)
| ! [X0] :
( c
| ~ p(X0) ) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ( ~ c
& ? [X1] : p(X1) )
| ? [X0] :
( ~ c
& p(X0) ) )
& ( c
| ! [X1] : ~ p(X1)
| ! [X0] :
( c
| ~ p(X0) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X0] :
( c
| ~ p(X0) )
<~> ( c
| ! [X1] : ~ p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( p(X0)
=> c )
<=> ( ? [X1] : p(X1)
=> c ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( p(X0)
=> c )
<=> ( ? [X0] : p(X0)
=> c ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( p(X0)
=> c )
<=> ( ? [X0] : p(X0)
=> c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f16,plain,
! [X2,X3] :
( c
| ~ p(X2)
| ~ p(X3) ),
inference(duplicate_literal_removal,[],[f11]) ).
fof(f11,plain,
! [X2,X3] :
( c
| ~ p(X2)
| c
| ~ p(X3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f26,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f12,f23,f19]) ).
fof(f12,plain,
( p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SYN937+1 : TPTP v8.2.0. Released v3.1.0.
% 0.02/0.08 % 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.07/0.26 % Computer : n005.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon May 20 13:51:52 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.07/0.27 This is a FOF_THM_EPR_NEQ problem
% 0.07/0.27 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.11/0.55 % (29311)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 (2997ds/56Mi)
% 0.11/0.55 % (29311)First to succeed.
% 0.11/0.55 % (29311)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29303"
% 0.11/0.55 % (29304)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 (2997ds/34Mi)
% 0.11/0.55 % (29306)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.11/0.55 % (29308)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 (2997ds/34Mi)
% 0.11/0.55 % (29305)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 (2997ds/51Mi)
% 0.11/0.55 % (29309)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.11/0.55 % (29307)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.11/0.55 % (29310)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 (2997ds/83Mi)
% 0.11/0.55 % (29311)Refutation found. Thanks to Tanya!
% 0.11/0.55 % SZS status Theorem for theBenchmark
% 0.11/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.55 % (29311)------------------------------
% 0.11/0.55 % (29311)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.55 % (29311)Termination reason: Refutation
% 0.11/0.55
% 0.11/0.55 % (29311)Memory used [KB]: 965
% 0.11/0.55 % (29311)Time elapsed: 0.002 s
% 0.11/0.55 % (29311)Instructions burned: 2 (million)
% 0.11/0.55 % (29303)Success in time 0.281 s
% 0.11/0.55 % Vampire---4.8 exiting
%------------------------------------------------------------------------------