TSTP Solution File: SYN059+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN059+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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:20:40 EDT 2024
% Result : Theorem 0.73s 0.91s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 86 ( 10 unt; 0 def)
% Number of atoms : 298 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 339 ( 127 ~; 127 |; 51 &)
% ( 17 <=>; 14 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 15 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 71 ( 52 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f117,plain,
$false,
inference(avatar_sat_refutation,[],[f50,f55,f60,f61,f65,f69,f78,f83,f88,f92,f96,f98,f102,f105,f108,f112,f116]) ).
fof(f116,plain,
~ spl7_13,
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f113,plain,
( $false
| ~ spl7_13 ),
inference(resolution,[],[f95,f37]) ).
fof(f37,plain,
big_g(sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
big_g(sK6),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f6,f23]) ).
fof(f23,plain,
( ? [X0] : big_g(X0)
=> big_g(sK6) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0] : big_g(X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
? [X1] : big_g(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29_2) ).
fof(f95,plain,
( ! [X3] : ~ big_g(X3)
| ~ spl7_13 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f94,plain,
( spl7_13
<=> ! [X3] : ~ big_g(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_13])]) ).
fof(f112,plain,
~ spl7_12,
inference(avatar_contradiction_clause,[],[f109]) ).
fof(f109,plain,
( $false
| ~ spl7_12 ),
inference(resolution,[],[f91,f36]) ).
fof(f36,plain,
big_f(sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
big_f(sK5),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f1,f21]) ).
fof(f21,plain,
( ? [X0] : big_f(X0)
=> big_f(sK5) ),
introduced(choice_axiom,[]) ).
fof(f1,axiom,
? [X0] : big_f(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29_1) ).
fof(f91,plain,
( ! [X2] : ~ big_f(X2)
| ~ spl7_12 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f90,plain,
( spl7_12
<=> ! [X2] : ~ big_f(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_12])]) ).
fof(f108,plain,
( ~ spl7_7
| spl7_8
| ~ spl7_11 ),
inference(avatar_contradiction_clause,[],[f107]) ).
fof(f107,plain,
( $false
| ~ spl7_7
| spl7_8
| ~ spl7_11 ),
inference(subsumption_resolution,[],[f106,f87]) ).
fof(f87,plain,
( big_f(sK3)
| ~ spl7_11 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f85,plain,
( spl7_11
<=> big_f(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_11])]) ).
fof(f106,plain,
( ~ big_f(sK3)
| ~ spl7_7
| spl7_8 ),
inference(resolution,[],[f73,f68]) ).
fof(f68,plain,
( ! [X3] :
( big_h(X3)
| ~ big_f(X3) )
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f67,plain,
( spl7_7
<=> ! [X3] :
( big_h(X3)
| ~ big_f(X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f73,plain,
( ~ big_h(sK3)
| spl7_8 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f71,plain,
( spl7_8
<=> big_h(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_8])]) ).
fof(f105,plain,
( ~ spl7_6
| spl7_9
| ~ spl7_10 ),
inference(avatar_contradiction_clause,[],[f104]) ).
fof(f104,plain,
( $false
| ~ spl7_6
| spl7_9
| ~ spl7_10 ),
inference(subsumption_resolution,[],[f103,f82]) ).
fof(f82,plain,
( big_g(sK4)
| ~ spl7_10 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl7_10
<=> big_g(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_10])]) ).
fof(f103,plain,
( ~ big_g(sK4)
| ~ spl7_6
| spl7_9 ),
inference(resolution,[],[f77,f64]) ).
fof(f64,plain,
( ! [X2] :
( big_j(X2)
| ~ big_g(X2) )
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f63,plain,
( spl7_6
<=> ! [X2] :
( big_j(X2)
| ~ big_g(X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f77,plain,
( ~ big_j(sK4)
| spl7_9 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f75,plain,
( spl7_9
<=> big_j(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_9])]) ).
fof(f102,plain,
( ~ spl7_4
| spl7_1
| ~ spl7_7 ),
inference(avatar_split_clause,[],[f99,f67,f39,f52]) ).
fof(f52,plain,
( spl7_4
<=> big_f(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f39,plain,
( spl7_1
<=> big_h(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f99,plain,
( ~ big_f(sK2)
| spl7_1
| ~ spl7_7 ),
inference(resolution,[],[f68,f41]) ).
fof(f41,plain,
( ~ big_h(sK2)
| spl7_1 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f98,plain,
( ~ spl7_5
| spl7_2
| ~ spl7_6 ),
inference(avatar_split_clause,[],[f97,f63,f43,f57]) ).
fof(f57,plain,
( spl7_5
<=> big_g(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f43,plain,
( spl7_2
<=> big_j(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f97,plain,
( ~ big_g(sK1)
| spl7_2
| ~ spl7_6 ),
inference(resolution,[],[f64,f45]) ).
fof(f45,plain,
( ~ big_j(sK1)
| spl7_2 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f96,plain,
( spl7_3
| spl7_13
| spl7_7 ),
inference(avatar_split_clause,[],[f31,f67,f94,f47]) ).
fof(f47,plain,
( spl7_3
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f31,plain,
! [X2,X3] :
( big_h(X2)
| ~ big_g(X3)
| ~ big_f(X2)
| sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ( ( ( ~ big_j(sK4)
| ~ big_h(sK3) )
& big_g(sK4)
& big_f(sK3) )
| ~ sP0 )
& ( ! [X2,X3] :
( ( big_j(X3)
& big_h(X2) )
| ~ big_g(X3)
| ~ big_f(X2) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] :
( ( ~ big_j(X1)
| ~ big_h(X0) )
& big_g(X1)
& big_f(X0) )
=> ( ( ~ big_j(sK4)
| ~ big_h(sK3) )
& big_g(sK4)
& big_f(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ( ? [X0,X1] :
( ( ~ big_j(X1)
| ~ big_h(X0) )
& big_g(X1)
& big_f(X0) )
| ~ sP0 )
& ( ! [X2,X3] :
( ( big_j(X3)
& big_h(X2) )
| ~ big_g(X3)
| ~ big_f(X2) )
| sP0 ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
( ( ? [X2,X3] :
( ( ~ big_j(X3)
| ~ big_h(X2) )
& big_g(X3)
& big_f(X2) )
| ~ sP0 )
& ( ! [X2,X3] :
( ( big_j(X3)
& big_h(X2) )
| ~ big_g(X3)
| ~ big_f(X2) )
| sP0 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
( sP0
<~> ! [X2,X3] :
( ( big_j(X3)
& big_h(X2) )
| ~ big_g(X3)
| ~ big_f(X2) ) ),
inference(definition_folding,[],[f8,f9]) ).
fof(f9,plain,
( sP0
<=> ( ! [X0] :
( big_j(X0)
| ~ big_g(X0) )
& ! [X1] :
( big_h(X1)
| ~ big_f(X1) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f8,plain,
( ( ! [X0] :
( big_j(X0)
| ~ big_g(X0) )
& ! [X1] :
( big_h(X1)
| ~ big_f(X1) ) )
<~> ! [X2,X3] :
( ( big_j(X3)
& big_h(X2) )
| ~ big_g(X3)
| ~ big_f(X2) ) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
( ( ! [X0] :
( big_j(X0)
| ~ big_g(X0) )
& ! [X1] :
( big_h(X1)
| ~ big_f(X1) ) )
<~> ! [X2,X3] :
( ( big_j(X3)
& big_h(X2) )
| ~ big_g(X3)
| ~ big_f(X2) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
~ ( ( ! [X0] :
( big_g(X0)
=> big_j(X0) )
& ! [X1] :
( big_f(X1)
=> big_h(X1) ) )
<=> ! [X2,X3] :
( ( big_g(X3)
& big_f(X2) )
=> ( big_j(X3)
& big_h(X2) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ( ( ! [X2] :
( big_g(X2)
=> big_j(X2) )
& ! [X0] :
( big_f(X0)
=> big_h(X0) ) )
<=> ! [X3,X1] :
( ( big_g(X1)
& big_f(X3) )
=> ( big_j(X1)
& big_h(X3) ) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
( ( ! [X2] :
( big_g(X2)
=> big_j(X2) )
& ! [X0] :
( big_f(X0)
=> big_h(X0) ) )
<=> ! [X3,X1] :
( ( big_g(X1)
& big_f(X3) )
=> ( big_j(X1)
& big_h(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29) ).
fof(f92,plain,
( spl7_3
| spl7_12
| spl7_6 ),
inference(avatar_split_clause,[],[f32,f63,f90,f47]) ).
fof(f32,plain,
! [X2,X3] :
( big_j(X3)
| ~ big_g(X3)
| ~ big_f(X2)
| sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f88,plain,
( ~ spl7_3
| spl7_11 ),
inference(avatar_split_clause,[],[f33,f85,f47]) ).
fof(f33,plain,
( big_f(sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f83,plain,
( ~ spl7_3
| spl7_10 ),
inference(avatar_split_clause,[],[f34,f80,f47]) ).
fof(f34,plain,
( big_g(sK4)
| ~ sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f78,plain,
( ~ spl7_3
| ~ spl7_8
| ~ spl7_9 ),
inference(avatar_split_clause,[],[f35,f75,f71,f47]) ).
fof(f35,plain,
( ~ big_j(sK4)
| ~ big_h(sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f69,plain,
( ~ spl7_3
| spl7_7 ),
inference(avatar_split_clause,[],[f25,f67,f47]) ).
fof(f25,plain,
! [X3] :
( big_h(X3)
| ~ big_f(X3)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( ( sP0
| ( ~ big_j(sK1)
& big_g(sK1) )
| ( ~ big_h(sK2)
& big_f(sK2) ) )
& ( ( ! [X2] :
( big_j(X2)
| ~ big_g(X2) )
& ! [X3] :
( big_h(X3)
| ~ big_f(X3) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f13,f15,f14]) ).
fof(f14,plain,
( ? [X0] :
( ~ big_j(X0)
& big_g(X0) )
=> ( ~ big_j(sK1)
& big_g(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X1] :
( ~ big_h(X1)
& big_f(X1) )
=> ( ~ big_h(sK2)
& big_f(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ( sP0
| ? [X0] :
( ~ big_j(X0)
& big_g(X0) )
| ? [X1] :
( ~ big_h(X1)
& big_f(X1) ) )
& ( ( ! [X2] :
( big_j(X2)
| ~ big_g(X2) )
& ! [X3] :
( big_h(X3)
| ~ big_f(X3) ) )
| ~ sP0 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
( ( sP0
| ? [X0] :
( ~ big_j(X0)
& big_g(X0) )
| ? [X1] :
( ~ big_h(X1)
& big_f(X1) ) )
& ( ( ! [X0] :
( big_j(X0)
| ~ big_g(X0) )
& ! [X1] :
( big_h(X1)
| ~ big_f(X1) ) )
| ~ sP0 ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
( ( sP0
| ? [X0] :
( ~ big_j(X0)
& big_g(X0) )
| ? [X1] :
( ~ big_h(X1)
& big_f(X1) ) )
& ( ( ! [X0] :
( big_j(X0)
| ~ big_g(X0) )
& ! [X1] :
( big_h(X1)
| ~ big_f(X1) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f65,plain,
( ~ spl7_3
| spl7_6 ),
inference(avatar_split_clause,[],[f26,f63,f47]) ).
fof(f26,plain,
! [X2] :
( big_j(X2)
| ~ big_g(X2)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f61,plain,
( spl7_4
| spl7_5
| spl7_3 ),
inference(avatar_split_clause,[],[f27,f47,f57,f52]) ).
fof(f27,plain,
( sP0
| big_g(sK1)
| big_f(sK2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f60,plain,
( ~ spl7_1
| spl7_5
| spl7_3 ),
inference(avatar_split_clause,[],[f28,f47,f57,f39]) ).
fof(f28,plain,
( sP0
| big_g(sK1)
| ~ big_h(sK2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f55,plain,
( spl7_4
| ~ spl7_2
| spl7_3 ),
inference(avatar_split_clause,[],[f29,f47,f43,f52]) ).
fof(f29,plain,
( sP0
| ~ big_j(sK1)
| big_f(sK2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f50,plain,
( ~ spl7_1
| ~ spl7_2
| spl7_3 ),
inference(avatar_split_clause,[],[f30,f47,f43,f39]) ).
fof(f30,plain,
( sP0
| ~ big_j(sK1)
| ~ big_h(sK2) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN059+1 : TPTP v8.2.0. Released v2.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.40 % Computer : n007.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8042.1875MB
% 0.16/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Mon May 20 15:02:53 EDT 2024
% 0.16/0.40 % CPUTime :
% 0.16/0.40 This is a FOF_THM_EPR_NEQ problem
% 0.16/0.40 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.90 % (28602)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.73/0.90 % (28599)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.73/0.90 % (28601)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.73/0.90 % (28600)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.73/0.90 % (28603)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.73/0.90 % (28604)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.73/0.90 % (28605)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.73/0.90 % (28606)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.73/0.91 % (28600)Also succeeded, but the first one will report.
% 0.73/0.91 % (28599)Also succeeded, but the first one will report.
% 0.73/0.91 % (28601)First to succeed.
% 0.73/0.91 % (28604)Also succeeded, but the first one will report.
% 0.73/0.91 % (28603)Also succeeded, but the first one will report.
% 0.73/0.91 % (28602)Also succeeded, but the first one will report.
% 0.73/0.91 % (28606)Also succeeded, but the first one will report.
% 0.73/0.91 % (28605)Also succeeded, but the first one will report.
% 0.73/0.91 % (28601)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28598"
% 0.73/0.91 % (28601)Refutation found. Thanks to Tanya!
% 0.73/0.91 % SZS status Theorem for theBenchmark
% 0.73/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.91 % (28601)------------------------------
% 0.73/0.91 % (28601)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.91 % (28601)Termination reason: Refutation
% 0.73/0.91
% 0.73/0.91 % (28601)Memory used [KB]: 993
% 0.73/0.91 % (28601)Time elapsed: 0.004 s
% 0.73/0.91 % (28601)Instructions burned: 4 (million)
% 0.73/0.91 % (28598)Success in time 0.499 s
% 0.73/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------