TSTP Solution File: SYN409+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN409+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 : n008.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:57:17 EDT 2024
% Result : Theorem 0.60s 0.83s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 1 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 80 ( 32 ~; 30 |; 9 &)
% ( 6 <=>; 2 =>; 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 31 ( 22 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f29,f31,f33,f35]) ).
fof(f35,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f34]) ).
fof(f34,plain,
( $false
| spl3_3
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f23,f27]) ).
fof(f27,plain,
( ! [X5] : f(X5)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f26,plain,
( spl3_4
<=> ! [X5] : f(X5) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f23,plain,
( ~ f(sK1)
| spl3_3 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl3_3
<=> f(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f33,plain,
( spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| spl3_2
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f19,f27]) ).
fof(f19,plain,
( ~ f(sK0)
| spl3_2 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl3_2
<=> f(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f31,plain,
( spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f30,plain,
( $false
| spl3_1
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f15,f27]) ).
fof(f15,plain,
( ~ f(sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f13,plain,
( spl3_1
<=> f(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f29,plain,
( spl3_4
| spl3_4 ),
inference(avatar_split_clause,[],[f9,f26,f26]) ).
fof(f9,plain,
! [X3,X5] :
( f(X3)
| f(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ( ~ f(sK1)
| ~ f(sK0)
| ~ f(sK2) )
& ( ! [X3,X4] :
( f(X4)
& f(X3) )
| ! [X5] : f(X5) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f7,f6]) ).
fof(f6,plain,
( ? [X0,X1] :
( ~ f(X1)
| ~ f(X0) )
=> ( ~ f(sK1)
| ~ f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X2] : ~ f(X2)
=> ~ f(sK2) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ( ? [X0,X1] :
( ~ f(X1)
| ~ f(X0) )
| ? [X2] : ~ f(X2) )
& ( ! [X3,X4] :
( f(X4)
& f(X3) )
| ! [X5] : f(X5) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ( ? [X1,X2] :
( ~ f(X2)
| ~ f(X1) )
| ? [X0] : ~ f(X0) )
& ( ! [X1,X2] :
( f(X2)
& f(X1) )
| ! [X0] : f(X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ! [X0] : f(X0)
<~> ! [X1,X2] :
( f(X2)
& f(X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] : f(X0)
<=> ! [X1,X2] :
( f(X2)
& f(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] : f(X0)
<=> ! [X1,X2] :
( f(X2)
& f(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.B5xgMENTj8/Vampire---4.8_5925',kalish246) ).
fof(f24,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f11,f21,f17,f13]) ).
fof(f11,plain,
( ~ f(sK1)
| ~ f(sK0)
| ~ f(sK2) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN409+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/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.36 % Computer : n008.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 : Fri May 3 18:02:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_EPR_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.B5xgMENTj8/Vampire---4.8_5925
% 0.60/0.83 % (6292)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 (2995ds/56Mi)
% 0.60/0.83 % (6292)First to succeed.
% 0.60/0.83 % (6287)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.83 % (6292)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6113"
% 0.60/0.83 % (6288)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.83 % (6285)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 (2995ds/34Mi)
% 0.60/0.83 % (6286)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 (2995ds/51Mi)
% 0.60/0.83 % (6289)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 (2995ds/34Mi)
% 0.60/0.83 % (6290)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.83 % (6291)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 (2995ds/83Mi)
% 0.60/0.83 % (6292)Refutation found. Thanks to Tanya!
% 0.60/0.83 % SZS status Theorem for Vampire---4
% 0.60/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.83 % (6292)------------------------------
% 0.60/0.83 % (6292)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.83 % (6292)Termination reason: Refutation
% 0.60/0.83
% 0.60/0.83 % (6292)Memory used [KB]: 965
% 0.60/0.83 % (6292)Time elapsed: 0.002 s
% 0.60/0.83 % (6292)Instructions burned: 2 (million)
% 0.60/0.83 % (6113)Success in time 0.448 s
% 0.60/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------