TSTP Solution File: SYN376+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN376+1 : TPTP v8.1.2. Bugfixed v2.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n031.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:34:11 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 84 ( 34 ~; 21 |; 15 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 22 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(avatar_sat_refutation,[],[f23,f27,f29,f31]) ).
fof(f31,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f30,plain,
( $false
| ~ spl3_2 ),
inference(resolution,[],[f22,f14]) ).
fof(f14,plain,
~ big_p(sK1),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( big_p(sK0)
& ~ big_p(sK1)
& ! [X3] :
( ( big_p(X3)
| ~ big_p(sK2) )
& ( big_p(sK2)
| ~ big_p(X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
fof(f8,plain,
( ? [X0] : big_p(X0)
=> big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X1] : ~ big_p(X1)
=> ~ big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X2] :
! [X3] :
( ( big_p(X3)
| ~ big_p(X2) )
& ( big_p(X2)
| ~ big_p(X3) ) )
=> ! [X3] :
( ( big_p(X3)
| ~ big_p(sK2) )
& ( big_p(sK2)
| ~ big_p(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X0] : big_p(X0)
& ? [X1] : ~ big_p(X1)
& ? [X2] :
! [X3] :
( ( big_p(X3)
| ~ big_p(X2) )
& ( big_p(X2)
| ~ big_p(X3) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ? [X2] : big_p(X2)
& ? [X3] : ~ big_p(X3)
& ? [X0] :
! [X1] :
( ( big_p(X1)
| ~ big_p(X0) )
& ( big_p(X0)
| ~ big_p(X1) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
( ? [X2] : big_p(X2)
& ? [X3] : ~ big_p(X3)
& ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X2] : big_p(X2)
& ? [X3] : ~ big_p(X3)
& ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X2] : ~ big_p(X2)
| ! [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X0] : ~ big_p(X0)
| ! [X0] : big_p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X0] : ~ big_p(X0)
| ! [X0] : big_p(X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oEnC0i2lVF/Vampire---4.8_21022',x2127) ).
fof(f22,plain,
( ! [X3] : big_p(X3)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl3_2
<=> ! [X3] : big_p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f29,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f28]) ).
fof(f28,plain,
( $false
| ~ spl3_3 ),
inference(resolution,[],[f26,f15]) ).
fof(f15,plain,
big_p(sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f26,plain,
( ! [X3] : ~ big_p(X3)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl3_3
<=> ! [X3] : ~ big_p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f27,plain,
( spl3_3
| spl3_1 ),
inference(avatar_split_clause,[],[f12,f17,f25]) ).
fof(f17,plain,
( spl3_1
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f12,plain,
! [X3] :
( big_p(sK2)
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f13,f21,f17]) ).
fof(f13,plain,
! [X3] :
( big_p(X3)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN376+1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/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.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 30 17:57:44 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_EPR_NEQ problem
% 0.20/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.oEnC0i2lVF/Vampire---4.8_21022
% 0.56/0.73 % (21211)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.56/0.73 % (21216)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.56/0.73 % (21216)First to succeed.
% 0.56/0.73 % (21211)Also succeeded, but the first one will report.
% 0.56/0.73 % (21209)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.56/0.73 % (21210)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.56/0.73 % (21213)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.56/0.73 % (21214)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.56/0.73 % (21212)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.56/0.73 % (21216)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for Vampire---4
% 0.56/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.73 % (21216)------------------------------
% 0.56/0.73 % (21216)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.73 % (21216)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (21216)Memory used [KB]: 968
% 0.56/0.73 % (21216)Time elapsed: 0.002 s
% 0.56/0.73 % (21216)Instructions burned: 2 (million)
% 0.56/0.73 % (21216)------------------------------
% 0.56/0.73 % (21216)------------------------------
% 0.56/0.73 % (21158)Success in time 0.373 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------