TSTP Solution File: SYN951+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN951+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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 12:07:57 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 3 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 93 ( 33 ~; 28 |; 17 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 20 ( 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f31,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f26,f27,f28,f30]) ).
fof(f30,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f29]) ).
fof(f29,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f16,f9]) ).
fof(f9,plain,
p(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ( ( ~ q
& q )
| ( b
& ~ b )
| ! [X0] : ~ p(X0) )
& p(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
( ? [X1] : p(X1)
=> p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ( ~ q
& q )
| ( b
& ~ b )
| ! [X0] : ~ p(X0) )
& ? [X1] : p(X1) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ( ~ q
& q )
| ( b
& ~ b )
| ! [X1] : ~ p(X1) )
& ? [X0] : p(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,plain,
~ ( ? [X0] : p(X0)
=> ( ( q
=> q )
& ( ~ b
| b )
& ? [X1] : p(X1) ) ),
inference(pure_predicate_removal,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] : p(X0)
=> ( ( a
=> ( ( q
=> q )
& ( ~ b
| b ) ) )
& ? [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] : p(X0)
=> ( ( a
=> ( ( q
=> q )
& ( ~ b
| b ) ) )
& ? [X0] : p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] : p(X0)
=> ( ( a
=> ( ( q
=> q )
& ( ~ b
| b ) ) )
& ? [X0] : p(X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6fmQgLHl0g/Vampire---4.8_6770',prove_this) ).
fof(f16,plain,
( ! [X0] : ~ p(X0)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f15,plain,
( spl1_1
<=> ! [X0] : ~ p(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f28,plain,
( spl1_1
| ~ spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f10,f22,f18,f15]) ).
fof(f18,plain,
( spl1_2
<=> b ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f22,plain,
( spl1_3
<=> q ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f10,plain,
! [X0] :
( q
| ~ b
| ~ p(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
( spl1_1
| spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f11,f22,f18,f15]) ).
fof(f11,plain,
! [X0] :
( q
| b
| ~ p(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
( spl1_1
| ~ spl1_2
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f12,f22,f18,f15]) ).
fof(f12,plain,
! [X0] :
( ~ q
| ~ b
| ~ p(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f25,plain,
( spl1_1
| spl1_2
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f13,f22,f18,f15]) ).
fof(f13,plain,
! [X0] :
( ~ q
| b
| ~ p(X0) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% 0.15/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.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 17:08:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.15/0.36 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.6fmQgLHl0g/Vampire---4.8_6770
% 0.61/0.81 % (7172)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.61/0.81 % (7172)First to succeed.
% 0.61/0.81 % (7165)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.61/0.81 % (7166)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.61/0.81 % (7167)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.61/0.81 % (7168)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.61/0.81 % (7169)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.61/0.81 % (7172)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6983"
% 0.61/0.81 % (7170)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.61/0.81 % (7171)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.61/0.81 % (7172)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (7172)------------------------------
% 0.61/0.81 % (7172)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (7172)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (7172)Memory used [KB]: 967
% 0.61/0.81 % (7172)Time elapsed: 0.002 s
% 0.61/0.81 % (7172)Instructions burned: 2 (million)
% 0.61/0.81 % (6983)Success in time 0.443 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------