TSTP Solution File: SYN398+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN398+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 : n006.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:18 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 92 ( 35 ~; 31 |; 18 &)
% ( 5 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 17 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,plain,
$false,
inference(avatar_sat_refutation,[],[f30,f31,f33,f35]) ).
fof(f35,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f34]) ).
fof(f34,plain,
( $false
| spl2_1 ),
inference(resolution,[],[f21,f16]) ).
fof(f16,plain,
! [X3] : f(X3),
inference(condensation,[],[f13]) ).
fof(f13,plain,
! [X2,X3] :
( f(X2)
| f(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ~ f(sK0)
| ~ p
| ~ f(sK1)
| ~ p )
& ( ( ! [X2] : f(X2)
& p )
| ! [X3] :
( f(X3)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] : ~ f(X0)
=> ~ f(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] :
( ~ f(X1)
| ~ p )
=> ( ~ f(sK1)
| ~ p ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ? [X0] : ~ f(X0)
| ~ p
| ? [X1] :
( ~ f(X1)
| ~ p ) )
& ( ( ! [X2] : f(X2)
& p )
| ! [X3] :
( f(X3)
& p ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ? [X1] : ~ f(X1)
| ~ p
| ? [X0] :
( ~ f(X0)
| ~ p ) )
& ( ( ! [X1] : f(X1)
& p )
| ! [X0] :
( f(X0)
& p ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ( ? [X1] : ~ f(X1)
| ~ p
| ? [X0] :
( ~ f(X0)
| ~ p ) )
& ( ( ! [X1] : f(X1)
& p )
| ! [X0] :
( f(X0)
& p ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ! [X0] :
( f(X0)
& p )
<~> ( ! [X1] : f(X1)
& p ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( f(X0)
& p )
<=> ( ! [X1] : f(X1)
& p ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( f(X0)
& p )
<=> ( ! [X1] : f(X1)
& p ) ),
file('/export/starexec/sandbox/tmp/tmp.BKDVePi091/Vampire---4.8_347',kalish215) ).
fof(f21,plain,
( ~ f(sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_1
<=> f(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f33,plain,
spl2_3,
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| spl2_3 ),
inference(resolution,[],[f29,f16]) ).
fof(f29,plain,
( ~ f(sK0)
| spl2_3 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_3
<=> f(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f31,plain,
spl2_2,
inference(avatar_split_clause,[],[f15,f23]) ).
fof(f23,plain,
( spl2_2
<=> p ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f15,plain,
p,
inference(duplicate_literal_removal,[],[f10]) ).
fof(f10,plain,
( p
| p ),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f17,f27,f23,f19]) ).
fof(f17,plain,
( ~ f(sK0)
| ~ p
| ~ f(sK1) ),
inference(duplicate_literal_removal,[],[f14]) ).
fof(f14,plain,
( ~ f(sK0)
| ~ p
| ~ f(sK1)
| ~ p ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% 0.09/0.11 % 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.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 17:18:35 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_EPR_NEQ problem
% 0.10/0.31 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.BKDVePi091/Vampire---4.8_347
% 0.61/0.78 % (458)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.78 % (457)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.78 % (455)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.78 % (459)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.78 % (456)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.78 % (460)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.78 % (461)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.78 % (462)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.79 % (456)First to succeed.
% 0.61/0.79 % (457)Also succeeded, but the first one will report.
% 0.61/0.79 % (455)Also succeeded, but the first one will report.
% 0.61/0.79 % (456)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for Vampire---4
% 0.61/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.79 % (456)------------------------------
% 0.61/0.79 % (456)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (456)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (456)Memory used [KB]: 975
% 0.61/0.79 % (456)Time elapsed: 0.003 s
% 0.61/0.79 % (456)Instructions burned: 2 (million)
% 0.61/0.79 % (456)------------------------------
% 0.61/0.79 % (456)------------------------------
% 0.61/0.79 % (454)Success in time 0.476 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------