TSTP Solution File: RNG121+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : RNG121+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n028.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 Aug 31 18:15:08 EDT 2022
% Result : Theorem 1.61s 0.59s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 126 ( 42 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 131 ( 31 ~; 24 |; 71 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 15 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f580,plain,
$false,
inference(subsumption_resolution,[],[f579,f337]) ).
fof(f337,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnf_transformation,[],[f199]) ).
fof(f199,plain,
( aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xa))
& aElement0(sK31)
& sz00 = sdtasdt0(xa,sK31)
& xa = sdtasdt0(xa,sK32)
& aElement0(sK32)
& sz00 = sdtasdt0(xb,sK33)
& aElement0(sK33)
& aElement0(sK34)
& xb = sdtasdt0(xb,sK34)
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32,sK33,sK34])],[f194,f198,f197,f196,f195]) ).
fof(f195,plain,
( ? [X0] :
( aElement0(X0)
& sz00 = sdtasdt0(xa,X0) )
=> ( aElement0(sK31)
& sz00 = sdtasdt0(xa,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f196,plain,
( ? [X1] :
( xa = sdtasdt0(xa,X1)
& aElement0(X1) )
=> ( xa = sdtasdt0(xa,sK32)
& aElement0(sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f197,plain,
( ? [X2] :
( sz00 = sdtasdt0(xb,X2)
& aElement0(X2) )
=> ( sz00 = sdtasdt0(xb,sK33)
& aElement0(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f198,plain,
( ? [X3] :
( aElement0(X3)
& xb = sdtasdt0(xb,X3) )
=> ( aElement0(sK34)
& xb = sdtasdt0(xb,sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f194,plain,
( aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X0] :
( aElement0(X0)
& sz00 = sdtasdt0(xa,X0) )
& ? [X1] :
( xa = sdtasdt0(xa,X1)
& aElement0(X1) )
& ? [X2] :
( sz00 = sdtasdt0(xb,X2)
& aElement0(X2) )
& ? [X3] :
( aElement0(X3)
& xb = sdtasdt0(xb,X3) )
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(rectify,[],[f61]) ).
fof(f61,plain,
( aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X0] :
( aElement0(X0)
& sz00 = sdtasdt0(xa,X0) )
& ? [X2] :
( xa = sdtasdt0(xa,X2)
& aElement0(X2) )
& ? [X1] :
( sz00 = sdtasdt0(xb,X1)
& aElement0(X1) )
& ? [X3] :
( aElement0(X3)
& xb = sdtasdt0(xb,X3) )
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(rectify,[],[f43]) ).
fof(f43,axiom,
( ? [X0] :
( aElement0(X0)
& sz00 = sdtasdt0(xa,X0) )
& ? [X0] :
( sz00 = sdtasdt0(xb,X0)
& aElement0(X0) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X0] :
( xa = sdtasdt0(xa,X0)
& aElement0(X0) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X0] :
( aElement0(X0)
& xb = sdtasdt0(xb,X0) )
& aElementOf0(xb,slsdtgt0(xb))
& aElementOf0(sz00,slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2203) ).
fof(f579,plain,
~ aElementOf0(xb,slsdtgt0(xb)),
inference(subsumption_resolution,[],[f578,f282]) ).
fof(f282,plain,
aElement0(xb),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(f578,plain,
( ~ aElement0(xb)
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(equality_resolution,[],[f577]) ).
fof(f577,plain,
! [X0] :
( xb != X0
| ~ aElementOf0(X0,slsdtgt0(xb))
| ~ aElement0(X0) ),
inference(subsumption_resolution,[],[f576,f346]) ).
fof(f346,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnf_transformation,[],[f199]) ).
fof(f576,plain,
! [X0] :
( ~ aElement0(X0)
| xb != X0
| ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(X0,slsdtgt0(xb)) ),
inference(superposition,[],[f252,f277]) ).
fof(f277,plain,
! [X0] :
( sdtpldt0(sz00,X0) = X0
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] :
( aElement0(X0)
=> ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).
fof(f252,plain,
! [X2,X3] :
( xb != sdtpldt0(X2,X3)
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ! [X0,X1] :
( sdtpldt0(X1,X0) != xb
| ~ aElementOf0(X0,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) )
& ! [X2,X3] :
( ~ aElementOf0(X2,slsdtgt0(xa))
| ~ aElementOf0(X3,slsdtgt0(xb))
| xb != sdtpldt0(X2,X3) )
& ~ aElementOf0(xb,xI) ),
inference(rectify,[],[f113]) ).
fof(f113,plain,
( ! [X1,X0] :
( sdtpldt0(X0,X1) != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa)) )
& ! [X3,X2] :
( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X2,slsdtgt0(xb))
| xb != sdtpldt0(X3,X2) )
& ~ aElementOf0(xb,xI) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,plain,
~ ( aElementOf0(xb,xI)
| ? [X3,X2] :
( xb = sdtpldt0(X3,X2)
& aElementOf0(X3,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb)) )
| ? [X1,X0] :
( aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xb
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ? [X1,X0] :
( aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xb
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X1,X0] :
( aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa))
& sdtpldt0(X0,X1) = xb )
| aElementOf0(xb,xI) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ? [X1,X0] :
( aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xb
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X1,X0] :
( aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa))
& sdtpldt0(X0,X1) = xb )
| aElementOf0(xb,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG121+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 12:22:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (6726)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.56 % (6727)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.56 % (6742)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.57 % (6735)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.57 % (6743)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.57 % (6734)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.57 % (6734)Instruction limit reached!
% 0.20/0.57 % (6734)------------------------------
% 0.20/0.57 % (6734)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (6734)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (6734)Termination reason: Unknown
% 0.20/0.57 % (6734)Termination phase: Preprocessing 3
% 0.20/0.57
% 0.20/0.57 % (6734)Memory used [KB]: 1535
% 0.20/0.57 % (6734)Time elapsed: 0.005 s
% 0.20/0.57 % (6734)Instructions burned: 3 (million)
% 0.20/0.57 % (6734)------------------------------
% 0.20/0.57 % (6734)------------------------------
% 0.20/0.58 % (6735)Instruction limit reached!
% 0.20/0.58 % (6735)------------------------------
% 0.20/0.58 % (6735)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (6735)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (6735)Termination reason: Unknown
% 0.20/0.58 % (6735)Termination phase: Saturation
% 0.20/0.58
% 0.20/0.58 % (6735)Memory used [KB]: 6140
% 0.20/0.58 % (6735)Time elapsed: 0.009 s
% 0.20/0.58 % (6735)Instructions burned: 8 (million)
% 0.20/0.58 % (6735)------------------------------
% 0.20/0.58 % (6735)------------------------------
% 0.20/0.58 % (6726)First to succeed.
% 1.61/0.59 % (6726)Refutation found. Thanks to Tanya!
% 1.61/0.59 % SZS status Theorem for theBenchmark
% 1.61/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.61/0.59 % (6726)------------------------------
% 1.61/0.59 % (6726)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.61/0.59 % (6726)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.61/0.59 % (6726)Termination reason: Refutation
% 1.61/0.59
% 1.61/0.59 % (6726)Memory used [KB]: 6396
% 1.61/0.59 % (6726)Time elapsed: 0.143 s
% 1.61/0.59 % (6726)Instructions burned: 13 (million)
% 1.61/0.59 % (6726)------------------------------
% 1.61/0.59 % (6726)------------------------------
% 1.61/0.59 % (6719)Success in time 0.232 s
%------------------------------------------------------------------------------