TSTP Solution File: RNG095+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : RNG095+2 : TPTP v8.2.0. Released v4.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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 : Tue May 21 02:39:28 EDT 2024
% Result : Theorem 0.54s 0.71s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 172 ( 11 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 75 ( 29 ~; 24 |; 17 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 94 ( 94 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 6 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 32 ( 21 !; 10 ?; 16 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_8,type,
sQ14_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f233,plain,
$false,
inference(avatar_sat_refutation,[],[f218,f221,f232]) ).
tff(f232,plain,
spl15_2,
inference(avatar_contradiction_clause,[],[f231]) ).
tff(f231,plain,
( $false
| spl15_2 ),
inference(subsumption_resolution,[],[f230,f157]) ).
tff(f157,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
aElement0(sz10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
tff(f230,plain,
( ~ aElement0(sz10)
| spl15_2 ),
inference(resolution,[],[f217,f104]) ).
tff(f104,plain,
! [X0: $i] :
( aElementOf0(sK3(X0),xJ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f76]) ).
tff(f76,plain,
! [X0] :
( ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ( sdtpldt0(sK2(X0),sK3(X0)) = X0 )
& aElementOf0(sK3(X0),xJ)
& aElementOf0(sK2(X0),xI) )
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f39,f75]) ).
tff(f75,plain,
! [X0] :
( ? [X1,X2] :
( ( sdtpldt0(X1,X2) = X0 )
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) )
=> ( ( sdtpldt0(sK2(X0),sK3(X0)) = X0 )
& aElementOf0(sK3(X0),xJ)
& aElementOf0(sK2(X0),xI) ) ),
introduced(choice_axiom,[]) ).
tff(f39,plain,
! [X0] :
( ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( ( sdtpldt0(X1,X2) = X0 )
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f29]) ).
tff(f29,axiom,
! [X0] :
( aElement0(X0)
=> ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( ( sdtpldt0(X1,X2) = X0 )
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1205_03) ).
tff(f217,plain,
( ~ aElementOf0(sK3(sz10),xJ)
| spl15_2 ),
inference(avatar_component_clause,[],[f215]) ).
tff(f215,plain,
( spl15_2
<=> aElementOf0(sK3(sz10),xJ) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_2])]) ).
tff(f221,plain,
spl15_1,
inference(avatar_contradiction_clause,[],[f220]) ).
tff(f220,plain,
( $false
| spl15_1 ),
inference(subsumption_resolution,[],[f219,f157]) ).
tff(f219,plain,
( ~ aElement0(sz10)
| spl15_1 ),
inference(resolution,[],[f213,f103]) ).
tff(f103,plain,
! [X0: $i] :
( aElementOf0(sK2(X0),xI)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f76]) ).
tff(f213,plain,
( ~ aElementOf0(sK2(sz10),xI)
| spl15_1 ),
inference(avatar_component_clause,[],[f211]) ).
tff(f211,plain,
( spl15_1
<=> aElementOf0(sK2(sz10),xI) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_1])]) ).
tff(f218,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f209,f215,f211]) ).
tff(f209,plain,
( ~ aElementOf0(sK3(sz10),xJ)
| ~ aElementOf0(sK2(sz10),xI) ),
inference(subsumption_resolution,[],[f208,f157]) ).
tff(f208,plain,
( ~ aElement0(sz10)
| ~ aElementOf0(sK3(sz10),xJ)
| ~ aElementOf0(sK2(sz10),xI) ),
inference(resolution,[],[f207,f162]) ).
tff(f162,plain,
! [X0: $i,X1: $i] :
( ~ sQ14_eqProxy($i,sz10,sdtpldt0(X0,X1))
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(equality_proxy_replacement,[],[f109,f160]) ).
tff(f160,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ14_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ14_eqProxy])]) ).
tff(f109,plain,
! [X0: $i,X1: $i] :
( ( sz10 != sdtpldt0(X0,X1) )
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f40]) ).
tff(f40,plain,
! [X0,X1] :
( ( sz10 != sdtpldt0(X0,X1) )
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(ennf_transformation,[],[f32]) ).
tff(f32,negated_conjecture,
~ ? [X0,X1] :
( ( sz10 = sdtpldt0(X0,X1) )
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
inference(negated_conjecture,[],[f31]) ).
tff(f31,conjecture,
? [X0,X1] :
( ( sz10 = sdtpldt0(X0,X1) )
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f207,plain,
! [X0: $i] :
( sQ14_eqProxy($i,X0,sdtpldt0(sK2(X0),sK3(X0)))
| ~ aElement0(X0) ),
inference(forward_literal_rewriting,[],[f161,f190]) ).
tff(f190,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ14_eqProxy(X0,X2,X1)
| ~ sQ14_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f160]) ).
tff(f161,plain,
! [X0: $i] :
( sQ14_eqProxy($i,sdtpldt0(sK2(X0),sK3(X0)),X0)
| ~ aElement0(X0) ),
inference(equality_proxy_replacement,[],[f105,f160]) ).
tff(f105,plain,
! [X0: $i] :
( ( sdtpldt0(sK2(X0),sK3(X0)) = X0 )
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : RNG095+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 12:11:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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/benchmark/theBenchmark.p
% 0.54/0.70 % (31762)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.54/0.70 % (31760)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.70 % (31759)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.70 % (31761)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 theBenchmark for (2996ds/83Mi)
% 0.54/0.70 % (31755)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.70 % (31756)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 theBenchmark for (2996ds/51Mi)
% 0.54/0.70 % (31762)Refutation not found, incomplete strategy% (31762)------------------------------
% 0.54/0.70 % (31762)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.70 % (31762)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.70
% 0.54/0.70 % (31762)Memory used [KB]: 1140
% 0.54/0.70 % (31762)Time elapsed: 0.004 s
% 0.54/0.70 % (31762)Instructions burned: 8 (million)
% 0.54/0.70 % (31762)------------------------------
% 0.54/0.70 % (31762)------------------------------
% 0.54/0.70 % (31755)First to succeed.
% 0.54/0.70 % (31758)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.70 % (31755)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31754"
% 0.54/0.70 % (31756)Also succeeded, but the first one will report.
% 0.54/0.71 % (31755)Refutation found. Thanks to Tanya!
% 0.54/0.71 % SZS status Theorem for theBenchmark
% 0.54/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.71 % (31755)------------------------------
% 0.54/0.71 % (31755)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.71 % (31755)Termination reason: Refutation
% 0.54/0.71
% 0.54/0.71 % (31755)Memory used [KB]: 1102
% 0.54/0.71 % (31755)Time elapsed: 0.006 s
% 0.54/0.71 % (31755)Instructions burned: 8 (million)
% 0.54/0.71 % (31754)Success in time 0.334 s
% 0.54/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------