TSTP Solution File: NUN089+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.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 : n002.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 08:44:37 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 66 ( 13 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 76 ( 29 ~; 19 |; 24 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 40 ( 24 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f70,plain,
$false,
inference(resolution,[],[f69,f51]) ).
fof(f51,plain,
r2(sK2,sK1),
inference(definition_unfolding,[],[f34,f35]) ).
fof(f35,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( r1(sK1)
& sK0 = sK1
& r2(sK2,sK0)
& r2(sK3,sK2)
& r1(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f19,f23,f22,f21,f20]) ).
fof(f20,plain,
( ? [X0] :
( ? [X1] :
( r1(X1)
& X0 = X1 )
& ? [X2] :
( r2(X2,X0)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) )
=> ( ? [X1] :
( r1(X1)
& sK0 = X1 )
& ? [X2] :
( r2(X2,sK0)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X1] :
( r1(X1)
& sK0 = X1 )
=> ( r1(sK1)
& sK0 = sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ? [X2] :
( r2(X2,sK0)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) )
=> ( r2(sK2,sK0)
& ? [X3] :
( r2(X3,sK2)
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ? [X3] :
( r2(X3,sK2)
& r1(X3) )
=> ( r2(sK3,sK2)
& r1(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0] :
( ? [X1] :
( r1(X1)
& X0 = X1 )
& ? [X2] :
( r2(X2,X0)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0] :
( ! [X1] :
( ~ r1(X1)
| X0 != X1 )
| ! [X2] :
( ~ r2(X2,X0)
| ! [X3] :
( ~ r2(X3,X2)
| ~ r1(X3) ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X38] :
( ! [X15] :
( ~ r1(X15)
| X15 != X38 )
| ! [X21] :
( ~ r2(X21,X38)
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X38] :
( ! [X15] :
( ~ r1(X15)
| X15 != X38 )
| ! [X21] :
( ~ r2(X21,X38)
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.VMsS8Plghn/Vampire---4.8_14453',zerouneqtwo) ).
fof(f34,plain,
r2(sK2,sK0),
inference(cnf_transformation,[],[f24]) ).
fof(f69,plain,
! [X0] : ~ r2(X0,sK1),
inference(resolution,[],[f36,f52]) ).
fof(f52,plain,
! [X2,X0] :
( ~ r1(X2)
| ~ r2(X0,X2) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X1 != X2
| ~ r1(X2) ) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X40,X41] :
( ~ r2(X40,X41)
| ! [X42] :
( X41 != X42
| ~ r1(X42) ) ),
file('/export/starexec/sandbox/tmp/tmp.VMsS8Plghn/Vampire---4.8_14453',axiom_7a) ).
fof(f36,plain,
r1(sK1),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.15 % 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.16/0.36 % Computer : n002.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 18:52:08 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.VMsS8Plghn/Vampire---4.8_14453
% 0.60/0.75 % (14856)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.60/0.76 % (14849)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.60/0.76 % (14856)First to succeed.
% 0.60/0.76 % (14851)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.60/0.76 % (14852)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.60/0.76 % (14850)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.60/0.76 % (14853)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.60/0.76 % (14854)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.60/0.76 % (14856)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14707"
% 0.60/0.76 % (14855)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 (2996ds/83Mi)
% 0.60/0.76 % (14856)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (14856)------------------------------
% 0.60/0.76 % (14856)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (14856)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (14856)Memory used [KB]: 1041
% 0.60/0.76 % (14856)Time elapsed: 0.002 s
% 0.60/0.76 % (14856)Instructions burned: 3 (million)
% 0.60/0.76 % (14707)Success in time 0.382 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------