TSTP Solution File: SYN063+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN063+1 : TPTP v8.1.2. 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 : n015.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 11:55:51 EDT 2024
% Result : Theorem 0.57s 0.73s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 5 unt; 0 def)
% Number of atoms : 219 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 273 ( 101 ~; 106 |; 51 &)
% ( 6 <=>; 6 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 39 ( 33 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,plain,
$false,
inference(avatar_sat_refutation,[],[f56,f69,f81]) ).
fof(f81,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f80]) ).
fof(f80,plain,
( $false
| ~ spl4_1 ),
inference(resolution,[],[f73,f34]) ).
fof(f34,plain,
~ big_p(c),
inference(subsumption_resolution,[],[f33,f27]) ).
fof(f27,plain,
! [X0] :
( sP0(X0)
| ~ big_p(c) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ( sP0(X0)
| ( ~ big_p(c)
& ~ big_p(X0)
& big_p(a) ) )
& ( big_p(c)
| big_p(X0)
| ~ big_p(a)
| ~ sP0(X0) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(c)
& ~ big_p(X1)
& big_p(a) ) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a)
| ~ sP0(X1) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(c)
& ~ big_p(X1)
& big_p(a) ) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a)
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X1] :
( sP0(X1)
<=> ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f33,plain,
( ~ big_p(c)
| ~ sP0(sK3) ),
inference(subsumption_resolution,[],[f32,f23]) ).
fof(f23,plain,
( sP1
| ~ big_p(c) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP1
| ( ~ big_p(c)
& ( big_p(b)
| ~ big_p(sK2) )
& big_p(a) ) )
& ( ! [X1] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X1) )
| ~ big_p(a) )
| ~ sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f9,f10]) ).
fof(f10,plain,
( ? [X0] :
( ~ big_p(c)
& ( big_p(b)
| ~ big_p(X0) )
& big_p(a) )
=> ( ~ big_p(c)
& ( big_p(b)
| ~ big_p(sK2) )
& big_p(a) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( sP1
| ? [X0] :
( ~ big_p(c)
& ( big_p(b)
| ~ big_p(X0) )
& big_p(a) ) )
& ( ! [X1] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X1) )
| ~ big_p(a) )
| ~ sP1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
( ( sP1
| ? [X0] :
( ~ big_p(c)
& ( big_p(b)
| ~ big_p(X0) )
& big_p(a) ) )
& ( ! [X0] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X0) )
| ~ big_p(a) )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
( sP1
<=> ! [X0] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X0) )
| ~ big_p(a) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f32,plain,
( ~ big_p(c)
| ~ sP0(sK3)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ~ sP0(sK3)
| ~ sP1 )
& ( ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& sP0(X1) )
| sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).
fof(f17,plain,
( ? [X0] :
( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ~ sP0(X0) )
=> ( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ~ sP0(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ? [X0] :
( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ~ sP0(X0) )
| ~ sP1 )
& ( ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& sP0(X1) )
| sP1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
( ( ? [X1] :
( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ~ sP0(X1) )
| ~ sP1 )
& ( ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& sP0(X1) )
| sP1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
( sP1
<~> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& sP0(X1) ) ),
inference(definition_folding,[],[f4,f6,f5]) ).
fof(f4,plain,
( ! [X0] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X0) )
| ~ big_p(a) )
<~> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
( ! [X0] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X0) )
| ~ big_p(a) )
<~> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ( ( big_p(X0)
=> big_p(b) )
& big_p(a) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( ( ( big_p(X0)
=> big_p(b) )
& big_p(a) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qsidXFjvtP/Vampire---4.8_25611',pel33) ).
fof(f73,plain,
( ! [X0] : big_p(X0)
| ~ spl4_1 ),
inference(subsumption_resolution,[],[f72,f34]) ).
fof(f72,plain,
( ! [X0] :
( big_p(X0)
| big_p(c) )
| ~ spl4_1 ),
inference(subsumption_resolution,[],[f70,f49]) ).
fof(f49,plain,
big_p(a),
inference(subsumption_resolution,[],[f48,f25]) ).
fof(f25,plain,
! [X0] :
( sP0(X0)
| big_p(a) ),
inference(cnf_transformation,[],[f14]) ).
fof(f48,plain,
( big_p(a)
| ~ sP0(sK3) ),
inference(subsumption_resolution,[],[f30,f21]) ).
fof(f21,plain,
( sP1
| big_p(a) ),
inference(cnf_transformation,[],[f11]) ).
fof(f30,plain,
( big_p(a)
| ~ sP0(sK3)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f70,plain,
( ! [X0] :
( big_p(X0)
| ~ big_p(a)
| big_p(c) )
| ~ spl4_1 ),
inference(resolution,[],[f37,f19]) ).
fof(f19,plain,
! [X1] :
( ~ sP1
| big_p(X1)
| ~ big_p(a)
| big_p(c) ),
inference(cnf_transformation,[],[f11]) ).
fof(f37,plain,
( sP1
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl4_1
<=> sP1 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f69,plain,
~ spl4_4,
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| ~ spl4_4 ),
inference(resolution,[],[f63,f34]) ).
fof(f63,plain,
( ! [X0] : big_p(X0)
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f62,f34]) ).
fof(f62,plain,
( ! [X0] :
( big_p(X0)
| big_p(c) )
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f61,f49]) ).
fof(f61,plain,
( ! [X0] :
( big_p(X0)
| ~ big_p(a)
| big_p(c) )
| ~ spl4_4 ),
inference(resolution,[],[f55,f24]) ).
fof(f24,plain,
! [X0] :
( ~ sP0(X0)
| big_p(X0)
| ~ big_p(a)
| big_p(c) ),
inference(cnf_transformation,[],[f14]) ).
fof(f55,plain,
( ! [X1] : sP0(X1)
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f54,plain,
( spl4_4
<=> ! [X1] : sP0(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f56,plain,
( spl4_1
| spl4_4 ),
inference(avatar_split_clause,[],[f28,f54,f36]) ).
fof(f28,plain,
! [X1] :
( sP0(X1)
| sP1 ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN063+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.14 % 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.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 17:38:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_EPR_NEQ problem
% 0.14/0.35 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/tmp/tmp.qsidXFjvtP/Vampire---4.8_25611
% 0.57/0.73 % (25726)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 (2996ds/56Mi)
% 0.57/0.73 % (25725)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 (2996ds/83Mi)
% 0.57/0.73 % (25719)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 (2996ds/34Mi)
% 0.57/0.73 % (25721)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.73 % (25722)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.73 % (25720)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 (2996ds/51Mi)
% 0.57/0.73 % (25723)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 (2996ds/34Mi)
% 0.57/0.73 % (25724)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.73 % (25726)First to succeed.
% 0.57/0.73 % (25725)Also succeeded, but the first one will report.
% 0.57/0.73 % (25720)Also succeeded, but the first one will report.
% 0.57/0.73 % (25726)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25718"
% 0.57/0.73 % (25719)Also succeeded, but the first one will report.
% 0.57/0.73 % (25721)Also succeeded, but the first one will report.
% 0.57/0.73 % (25723)Also succeeded, but the first one will report.
% 0.57/0.73 % (25724)Also succeeded, but the first one will report.
% 0.57/0.73 % (25722)Also succeeded, but the first one will report.
% 0.57/0.73 % (25726)Refutation found. Thanks to Tanya!
% 0.57/0.73 % SZS status Theorem for Vampire---4
% 0.57/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.73 % (25726)------------------------------
% 0.57/0.73 % (25726)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (25726)Termination reason: Refutation
% 0.57/0.73
% 0.57/0.73 % (25726)Memory used [KB]: 988
% 0.57/0.73 % (25726)Time elapsed: 0.003 s
% 0.57/0.73 % (25726)Instructions burned: 3 (million)
% 0.57/0.73 % (25718)Success in time 0.374 s
% 0.57/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------