TSTP Solution File: SYN918+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN918+1 : TPTP v8.1.2. 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 : n021.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 : Wed May 1 04:44:59 EDT 2024
% Result : Theorem 0.70s 0.89s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 1 unt; 0 def)
% Number of atoms : 220 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 268 ( 100 ~; 95 |; 44 &)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 8 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 67 ( 57 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f32,f36,f40,f45,f46,f47,f54,f57,f60,f64]) ).
fof(f64,plain,
( ~ spl1_3
| ~ spl1_5
| ~ spl1_6 ),
inference(avatar_contradiction_clause,[],[f63]) ).
fof(f63,plain,
( $false
| ~ spl1_3
| ~ spl1_5
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f62,f27]) ).
fof(f27,plain,
( ! [X4] : ~ h(X4)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f26,plain,
( spl1_3
<=> ! [X4] : ~ h(X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f62,plain,
( ! [X0] : h(X0)
| ~ spl1_5
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f61,f35]) ).
fof(f35,plain,
( ! [X4] : g(X4)
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl1_5
<=> ! [X4] : g(X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
fof(f61,plain,
( ! [X0] :
( ~ g(X0)
| h(X0) )
| ~ spl1_6 ),
inference(resolution,[],[f17,f39]) ).
fof(f39,plain,
( ! [X4] : f(X4)
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl1_6
<=> ! [X4] : f(X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
fof(f17,plain,
! [X0] :
( ~ f(X0)
| ~ g(X0)
| h(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) )
& ! [X1] :
( g(X1)
| ~ h(X1)
| ~ f(X1) )
& ( ! [X2] :
( h(X2)
| ~ f(X2) )
| ! [X3] :
( g(X3)
| ~ f(X3) ) )
& ! [X4] :
( ( ~ g(sK0)
& f(sK0) )
| ( ~ h(X4)
& g(X4)
& f(X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
( ? [X5] :
( ~ g(X5)
& f(X5) )
=> ( ~ g(sK0)
& f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) )
& ! [X1] :
( g(X1)
| ~ h(X1)
| ~ f(X1) )
& ( ! [X2] :
( h(X2)
| ~ f(X2) )
| ! [X3] :
( g(X3)
| ~ f(X3) ) )
& ! [X4] :
( ? [X5] :
( ~ g(X5)
& f(X5) )
| ( ~ h(X4)
& g(X4)
& f(X4) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X5] :
( h(X5)
| ~ g(X5)
| ~ f(X5) )
& ! [X4] :
( g(X4)
| ~ h(X4)
| ~ f(X4) )
& ( ! [X0] :
( h(X0)
| ~ f(X0) )
| ! [X1] :
( g(X1)
| ~ f(X1) ) )
& ! [X2] :
( ? [X3] :
( ~ g(X3)
& f(X3) )
| ( ~ h(X2)
& g(X2)
& f(X2) ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ! [X5] :
( h(X5)
| ~ g(X5)
| ~ f(X5) )
& ! [X4] :
( g(X4)
| ~ h(X4)
| ~ f(X4) )
& ( ! [X0] :
( h(X0)
| ~ f(X0) )
| ! [X1] :
( g(X1)
| ~ f(X1) ) )
& ! [X2] :
( ? [X3] :
( ~ g(X3)
& f(X3) )
| ( ~ h(X2)
& g(X2)
& f(X2) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ( ! [X0] :
( f(X0)
=> h(X0) )
| ! [X1] :
( f(X1)
=> g(X1) ) )
& ! [X2] :
( ( ( g(X2)
& f(X2) )
=> h(X2) )
=> ? [X3] :
( ~ g(X3)
& f(X3) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ( ! [X3] :
( f(X3)
=> h(X3) )
| ! [X2] :
( f(X2)
=> g(X2) ) )
& ! [X0] :
( ( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X1] :
( ~ g(X1)
& f(X1) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ( ! [X3] :
( f(X3)
=> h(X3) )
| ! [X2] :
( f(X2)
=> g(X2) ) )
& ! [X0] :
( ( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X1] :
( ~ g(X1)
& f(X1) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.daxURpVHP8/Vampire---4.8_10191',prove_this) ).
fof(f60,plain,
( ~ spl1_1
| spl1_4
| ~ spl1_7 ),
inference(avatar_contradiction_clause,[],[f59]) ).
fof(f59,plain,
( $false
| ~ spl1_1
| spl1_4
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f58,f44]) ).
fof(f44,plain,
( f(sK0)
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl1_7
<=> f(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
fof(f58,plain,
( ~ f(sK0)
| ~ spl1_1
| spl1_4 ),
inference(resolution,[],[f20,f31]) ).
fof(f31,plain,
( ~ g(sK0)
| spl1_4 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl1_4
<=> g(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f20,plain,
( ! [X3] :
( g(X3)
| ~ f(X3) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl1_1
<=> ! [X3] :
( g(X3)
| ~ f(X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f57,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f56,f22,f19]) ).
fof(f22,plain,
( spl1_2
<=> ! [X2] :
( h(X2)
| ~ f(X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f56,plain,
( ! [X0] :
( g(X0)
| ~ f(X0) )
| ~ spl1_2 ),
inference(duplicate_literal_removal,[],[f55]) ).
fof(f55,plain,
( ! [X0] :
( g(X0)
| ~ f(X0)
| ~ f(X0) )
| ~ spl1_2 ),
inference(resolution,[],[f16,f23]) ).
fof(f23,plain,
( ! [X2] :
( h(X2)
| ~ f(X2) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f16,plain,
! [X1] :
( ~ h(X1)
| g(X1)
| ~ f(X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f54,plain,
( ~ spl1_2
| ~ spl1_3
| ~ spl1_7 ),
inference(avatar_contradiction_clause,[],[f53]) ).
fof(f53,plain,
( $false
| ~ spl1_2
| ~ spl1_3
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f44,f50]) ).
fof(f50,plain,
( ! [X2] : ~ f(X2)
| ~ spl1_2
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f23,f27]) ).
fof(f47,plain,
( spl1_6
| spl1_7 ),
inference(avatar_split_clause,[],[f9,f42,f38]) ).
fof(f9,plain,
! [X4] :
( f(sK0)
| f(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f46,plain,
( spl1_5
| spl1_7 ),
inference(avatar_split_clause,[],[f10,f42,f34]) ).
fof(f10,plain,
! [X4] :
( f(sK0)
| g(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f45,plain,
( spl1_3
| spl1_7 ),
inference(avatar_split_clause,[],[f11,f42,f26]) ).
fof(f11,plain,
! [X4] :
( f(sK0)
| ~ h(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f40,plain,
( spl1_6
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f12,f29,f38]) ).
fof(f12,plain,
! [X4] :
( ~ g(sK0)
| f(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f36,plain,
( spl1_5
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f13,f29,f34]) ).
fof(f13,plain,
! [X4] :
( ~ g(sK0)
| g(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f32,plain,
( spl1_3
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f14,f29,f26]) ).
fof(f14,plain,
! [X4] :
( ~ g(sK0)
| ~ h(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f24,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f15,f22,f19]) ).
fof(f15,plain,
! [X2,X3] :
( h(X2)
| ~ f(X2)
| g(X3)
| ~ f(X3) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN918+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.15 % 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.16/0.36 % Computer : n021.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 17:27:41 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_NEQ problem
% 0.16/0.37 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/tmp/tmp.daxURpVHP8/Vampire---4.8_10191
% 0.70/0.89 % (10521)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.70/0.89 % (10518)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 (2994ds/34Mi)
% 0.70/0.89 % (10520)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.70/0.89 % (10519)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 (2994ds/51Mi)
% 0.70/0.89 % (10522)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 (2994ds/34Mi)
% 0.70/0.89 % (10523)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.70/0.89 % (10524)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 (2994ds/83Mi)
% 0.70/0.89 % (10525)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 (2994ds/56Mi)
% 0.70/0.89 % (10520)First to succeed.
% 0.70/0.89 % (10518)Also succeeded, but the first one will report.
% 0.70/0.89 % (10525)Also succeeded, but the first one will report.
% 0.70/0.89 % (10520)Refutation found. Thanks to Tanya!
% 0.70/0.89 % SZS status Theorem for Vampire---4
% 0.70/0.89 % SZS output start Proof for Vampire---4
% See solution above
% 0.70/0.89 % (10520)------------------------------
% 0.70/0.89 % (10520)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.70/0.89 % (10520)Termination reason: Refutation
% 0.70/0.89
% 0.70/0.89 % (10520)Memory used [KB]: 995
% 0.70/0.89 % (10520)Time elapsed: 0.004 s
% 0.70/0.89 % (10520)Instructions burned: 4 (million)
% 0.70/0.89 % (10520)------------------------------
% 0.70/0.89 % (10520)------------------------------
% 0.70/0.89 % (10456)Success in time 0.517 s
% 0.70/0.89 % Vampire---4.8 exiting
%------------------------------------------------------------------------------