TSTP Solution File: SYN373+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN373+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 : n016.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:06 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 7 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 104 ( 39 ~; 36 |; 12 &)
% ( 7 <=>; 9 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 42 ( 21 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,plain,
$false,
inference(avatar_sat_refutation,[],[f35,f37,f39,f41,f43]) ).
fof(f43,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f42]) ).
fof(f42,plain,
( $false
| spl3_1 ),
inference(resolution,[],[f22,f17]) ).
fof(f17,plain,
! [X2] : big_p(X2),
inference(condensation,[],[f13]) ).
fof(f13,plain,
! [X2,X1] :
( big_p(X1)
| big_p(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( ( ! [X0] : ~ big_q(X0)
& ! [X1] : big_p(X1) )
| ! [X2] :
( ~ big_q(X2)
& big_p(X2) ) )
& ( big_q(sK0)
| ~ big_p(sK1)
| big_q(sK2)
| ~ big_p(sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
fof(f8,plain,
( ? [X3] : big_q(X3)
=> big_q(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] : ~ big_p(X4)
=> ~ big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X5] :
( big_q(X5)
| ~ big_p(X5) )
=> ( big_q(sK2)
| ~ big_p(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ( ! [X0] : ~ big_q(X0)
& ! [X1] : big_p(X1) )
| ! [X2] :
( ~ big_q(X2)
& big_p(X2) ) )
& ( ? [X3] : big_q(X3)
| ? [X4] : ~ big_p(X4)
| ? [X5] :
( big_q(X5)
| ~ big_p(X5) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ( ! [X2] : ~ big_q(X2)
& ! [X1] : big_p(X1) )
| ! [X0] :
( ~ big_q(X0)
& big_p(X0) ) )
& ( ? [X2] : big_q(X2)
| ? [X1] : ~ big_p(X1)
| ? [X0] :
( big_q(X0)
| ~ big_p(X0) ) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ( ! [X2] : ~ big_q(X2)
& ! [X1] : big_p(X1) )
| ! [X0] :
( ~ big_q(X0)
& big_p(X0) ) )
& ( ? [X2] : big_q(X2)
| ? [X1] : ~ big_p(X1)
| ? [X0] :
( big_q(X0)
| ~ big_p(X0) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
( big_q(X0)
| ~ big_p(X0) )
<~> ( ? [X2] : big_q(X2)
| ? [X1] : ~ big_p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( big_p(X0)
=> big_q(X0) )
<=> ( ! [X1] : big_p(X1)
=> ? [X2] : big_q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( big_p(X0)
=> big_q(X0) )
<=> ( ! [X0] : big_p(X0)
=> ? [X0] : big_q(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( big_p(X0)
=> big_q(X0) )
<=> ( ! [X0] : big_p(X0)
=> ? [X0] : big_q(X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.qm6ELbb2BA/Vampire---4.8_12880',x2124) ).
fof(f22,plain,
( ~ big_p(sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f20,plain,
( spl3_1
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f41,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f40,plain,
( $false
| ~ spl3_4 ),
inference(resolution,[],[f34,f18]) ).
fof(f18,plain,
! [X2] : ~ big_q(X2),
inference(condensation,[],[f16]) ).
fof(f16,plain,
! [X2,X0] :
( ~ big_q(X0)
| ~ big_q(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f34,plain,
( big_q(sK0)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl3_4
<=> big_q(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f39,plain,
spl3_3,
inference(avatar_contradiction_clause,[],[f38]) ).
fof(f38,plain,
( $false
| spl3_3 ),
inference(resolution,[],[f30,f17]) ).
fof(f30,plain,
( ~ big_p(sK1)
| spl3_3 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl3_3
<=> big_p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f37,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f36]) ).
fof(f36,plain,
( $false
| ~ spl3_2 ),
inference(resolution,[],[f26,f18]) ).
fof(f26,plain,
( big_q(sK2)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl3_2
<=> big_q(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f35,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f12,f32,f28,f24,f20]) ).
fof(f12,plain,
( big_q(sK0)
| ~ big_p(sK1)
| big_q(sK2)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.14 % 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.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:49:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.14/0.36 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.qm6ELbb2BA/Vampire---4.8_12880
% 0.60/0.81 % (13220)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.81 % (13223)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.81 % (13222)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.81 % (13224)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.81 % (13221)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.81 % (13225)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.81 % (13226)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.81 % (13227)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.81 % (13222)Also succeeded, but the first one will report.
% 0.60/0.81 % (13225)Also succeeded, but the first one will report.
% 0.60/0.81 % (13224)Also succeeded, but the first one will report.
% 0.60/0.81 % (13220)Also succeeded, but the first one will report.
% 0.60/0.81 % (13223)Also succeeded, but the first one will report.
% 0.60/0.81 % (13221)First to succeed.
% 0.60/0.81 % (13227)Also succeeded, but the first one will report.
% 0.60/0.81 % (13226)Also succeeded, but the first one will report.
% 0.60/0.81 % (13221)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13122"
% 0.60/0.81 % (13221)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (13221)------------------------------
% 0.60/0.81 % (13221)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (13221)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (13221)Memory used [KB]: 971
% 0.60/0.81 % (13221)Time elapsed: 0.004 s
% 0.60/0.81 % (13221)Instructions burned: 3 (million)
% 0.60/0.81 % (13122)Success in time 0.446 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------