TSTP Solution File: SYN358+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN358+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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:02 EDT 2024
% Result : Theorem 0.57s 0.79s
% 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 : 106 ( 39 ~; 35 |; 22 &)
% ( 7 <=>; 2 =>; 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 : 30 ( 14 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f34,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,[],[f29,f20]) ).
fof(f20,plain,
( ! [X1] : ~ big_q(X1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_1
<=> ! [X1] : ~ big_q(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f29,plain,
( big_q(sK1)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_3
<=> big_q(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,[],[f33,f20]) ).
fof(f33,plain,
( big_q(sK0)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl2_4
<=> big_q(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f37,plain,
spl2_2,
inference(avatar_split_clause,[],[f16,f22]) ).
fof(f22,plain,
( spl2_2
<=> p ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f16,plain,
p,
inference(duplicate_literal_removal,[],[f11]) ).
fof(f11,plain,
( p
| p ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ( ! [X0] : ~ big_q(X0)
| ~ p
| ! [X1] :
( ~ big_q(X1)
| ~ p ) )
& ( ( big_q(sK0)
& p )
| ( big_q(sK1)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X2] : big_q(X2)
=> big_q(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X3] :
( big_q(X3)
& p )
=> ( big_q(sK1)
& p ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ! [X0] : ~ big_q(X0)
| ~ p
| ! [X1] :
( ~ big_q(X1)
| ~ p ) )
& ( ( ? [X2] : big_q(X2)
& p )
| ? [X3] :
( big_q(X3)
& p ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ! [X1] : ~ big_q(X1)
| ~ p
| ! [X0] :
( ~ big_q(X0)
| ~ p ) )
& ( ( ? [X1] : big_q(X1)
& p )
| ? [X0] :
( big_q(X0)
& p ) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ! [X1] : ~ big_q(X1)
| ~ p
| ! [X0] :
( ~ big_q(X0)
| ~ p ) )
& ( ( ? [X1] : big_q(X1)
& p )
| ? [X0] :
( big_q(X0)
& p ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
( big_q(X0)
& p )
<~> ( ? [X1] : big_q(X1)
& p ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( big_q(X0)
& p )
<=> ( ? [X1] : big_q(X1)
& p ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( big_q(X0)
& p )
<=> ( ? [X0] : big_q(X0)
& p ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( big_q(X0)
& p )
<=> ( ? [X0] : big_q(X0)
& p ) ),
file('/export/starexec/sandbox/tmp/tmp.4fDBt7SwSh/Vampire---4.8_29861',x2109) ).
fof(f34,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f14,f31,f27]) ).
fof(f14,plain,
( big_q(sK0)
| big_q(sK1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f25,plain,
( spl2_1
| ~ spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f17,f19,f22,f19]) ).
fof(f17,plain,
! [X0,X1] :
( ~ big_q(X0)
| ~ p
| ~ big_q(X1) ),
inference(duplicate_literal_removal,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ~ big_q(X0)
| ~ p
| ~ big_q(X1)
| ~ p ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.17 % Problem : SYN358+1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.19 % 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.15/0.40 % Computer : n023.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8042.1875MB
% 0.15/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Fri May 3 17:27:23 EDT 2024
% 0.15/0.40 % CPUTime :
% 0.15/0.40 This is a FOF_THM_EPR_NEQ problem
% 0.15/0.40 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.4fDBt7SwSh/Vampire---4.8_29861
% 0.57/0.79 % (30248)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.79 % (30248)First to succeed.
% 0.57/0.79 % (30241)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.79 % (30243)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.79 % (30242)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.79 % (30245)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.79 % (30248)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30086"
% 0.57/0.79 % (30246)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.79 % (30244)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.79 % (30247)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.79 % (30248)Refutation found. Thanks to Tanya!
% 0.57/0.79 % SZS status Theorem for Vampire---4
% 0.57/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.79 % (30248)------------------------------
% 0.57/0.79 % (30248)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.79 % (30248)Termination reason: Refutation
% 0.57/0.79
% 0.57/0.79 % (30248)Memory used [KB]: 976
% 0.57/0.79 % (30248)Time elapsed: 0.002 s
% 0.57/0.79 % (30248)Instructions burned: 2 (million)
% 0.57/0.79 % (30086)Success in time 0.383 s
% 0.57/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------