TSTP Solution File: SYN934+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN934+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 : n024.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:05 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 3 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 108 ( 41 ~; 39 |; 12 &)
% ( 7 <=>; 8 =>; 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 12 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f28,f37,f39,f41]) ).
fof(f41,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f40,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f32,f20]) ).
fof(f20,plain,
( ! [X1] : ~ p(X1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_1
<=> ! [X1] : ~ p(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f32,plain,
( p(sK1)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl2_3
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f39,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f38]) ).
fof(f38,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(resolution,[],[f36,f20]) ).
fof(f36,plain,
( p(sK0)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl2_4
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f37,plain,
( spl2_3
| ~ spl2_2
| spl2_4 ),
inference(avatar_split_clause,[],[f16,f34,f23,f30]) ).
fof(f23,plain,
( spl2_2
<=> c ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f16,plain,
( p(sK0)
| ~ c
| p(sK1) ),
inference(duplicate_literal_removal,[],[f11]) ).
fof(f11,plain,
( p(sK0)
| ~ c
| p(sK1)
| ~ c ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ( ( ! [X0] : ~ p(X0)
& c )
| ! [X1] :
( ~ p(X1)
& c ) )
& ( p(sK0)
| ~ c
| p(sK1)
| ~ c ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X2] : p(X2)
=> p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X3] :
( p(X3)
| ~ c )
=> ( p(sK1)
| ~ c ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ( ! [X0] : ~ p(X0)
& c )
| ! [X1] :
( ~ p(X1)
& c ) )
& ( ? [X2] : p(X2)
| ~ c
| ? [X3] :
( p(X3)
| ~ c ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ( ! [X1] : ~ p(X1)
& c )
| ! [X0] :
( ~ p(X0)
& c ) )
& ( ? [X1] : p(X1)
| ~ c
| ? [X0] :
( p(X0)
| ~ c ) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ( ! [X1] : ~ p(X1)
& c )
| ! [X0] :
( ~ p(X0)
& c ) )
& ( ? [X1] : p(X1)
| ~ c
| ? [X0] :
( p(X0)
| ~ c ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
( p(X0)
| ~ c )
<~> ( ? [X1] : p(X1)
| ~ c ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( c
=> p(X0) )
<=> ( c
=> ? [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( c
=> p(X0) )
<=> ( c
=> ? [X0] : p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( c
=> p(X0) )
<=> ( c
=> ? [X0] : p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f28,plain,
spl2_2,
inference(avatar_split_clause,[],[f17,f23]) ).
fof(f17,plain,
c,
inference(duplicate_literal_removal,[],[f12]) ).
fof(f12,plain,
( c
| c ),
inference(cnf_transformation,[],[f10]) ).
fof(f21,plain,
( spl2_1
| spl2_1 ),
inference(avatar_split_clause,[],[f15,f19,f19]) ).
fof(f15,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SYN934+1 : TPTP v8.2.0. Released v3.1.0.
% 0.06/0.12 % 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.11/0.31 % Computer : n024.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 14:40:22 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a FOF_THM_EPR_NEQ problem
% 0.11/0.32 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.57/0.75 % (4509)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.57/0.75 % (4505)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.57/0.75 % (4504)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.57/0.75 % (4506)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.57/0.75 % (4503)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.57/0.75 % (4509)First to succeed.
% 0.57/0.75 % (4504)Also succeeded, but the first one will report.
% 0.57/0.75 % (4509)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4499"
% 0.57/0.75 % (4505)Also succeeded, but the first one will report.
% 0.57/0.75 % (4506)Also succeeded, but the first one will report.
% 0.57/0.75 % (4503)Also succeeded, but the first one will report.
% 0.57/0.75 % (4509)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for theBenchmark
% 0.57/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.75 % (4509)------------------------------
% 0.57/0.75 % (4509)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (4509)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (4509)Memory used [KB]: 976
% 0.57/0.75 % (4509)Time elapsed: 0.002 s
% 0.57/0.75 % (4509)Instructions burned: 2 (million)
% 0.57/0.75 % (4499)Success in time 0.427 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------