TSTP Solution File: NUM531+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM531+2 : 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 : n003.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:00:24 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 86 ( 20 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 97 ( 39 ~; 21 |; 30 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 35 ( 25 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,plain,
$false,
inference(subsumption_resolution,[],[f48,f40]) ).
fof(f40,plain,
isFinite0(sK1),
inference(definition_unfolding,[],[f36,f34]) ).
fof(f34,plain,
slcrc0 = sK1,
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( aSet0(sK1)
& slcrc0 = sK1
& isCountable0(sK1)
& ! [X1] : ~ aElementOf0(X1,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f20,f26]) ).
fof(f26,plain,
( ? [X0] :
( aSet0(X0)
& slcrc0 = X0
& isCountable0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) )
=> ( aSet0(sK1)
& slcrc0 = sK1
& isCountable0(sK1)
& ! [X1] : ~ aElementOf0(X1,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0] :
( aSet0(X0)
& slcrc0 = X0
& isCountable0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0] :
( slcrc0 = X0
& ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0)
& isCountable0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0] :
( ( aSet0(X0)
& isCountable0(X0) )
=> ~ ( slcrc0 = X0
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0] :
( ( aSet0(X0)
& isCountable0(X0) )
=> ~ ( slcrc0 = X0
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f36,plain,
isFinite0(slcrc0),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).
fof(f48,plain,
~ isFinite0(sK1),
inference(subsumption_resolution,[],[f47,f41]) ).
fof(f41,plain,
aSet0(sK1),
inference(equality_resolution,[],[f38]) ).
fof(f38,plain,
! [X0] :
( aSet0(X0)
| sK1 != X0 ),
inference(definition_unfolding,[],[f29,f34]) ).
fof(f29,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ( slcrc0 = X0
| ~ aSet0(X0)
| aElementOf0(sK0(X0),X0) )
& ( ( aSet0(X0)
& ! [X2] : ~ aElementOf0(X2,X0) )
| slcrc0 != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f24]) ).
fof(f24,plain,
! [X0] :
( ? [X1] : aElementOf0(X1,X0)
=> aElementOf0(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0] :
( ( slcrc0 = X0
| ~ aSet0(X0)
| ? [X1] : aElementOf0(X1,X0) )
& ( ( aSet0(X0)
& ! [X2] : ~ aElementOf0(X2,X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X0] :
( ( slcrc0 = X0
| ~ aSet0(X0)
| ? [X1] : aElementOf0(X1,X0) )
& ( ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0] :
( ( slcrc0 = X0
| ~ aSet0(X0)
| ? [X1] : aElementOf0(X1,X0) )
& ( ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] :
( slcrc0 = X0
<=> ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ( aSet0(X0)
& ~ ? [X1] : aElementOf0(X1,X0) )
<=> slcrc0 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(f47,plain,
( ~ aSet0(sK1)
| ~ isFinite0(sK1) ),
inference(resolution,[],[f33,f31]) ).
fof(f31,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ isFinite0(X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] :
( ~ aSet0(X0)
| ~ isCountable0(X0)
| ~ isFinite0(X0) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X0] :
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ isFinite0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
fof(f33,plain,
isCountable0(sK1),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 06:58:52 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.50 % (25547)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.51 % (25553)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.51 % (25553)Instruction limit reached!
% 0.21/0.51 % (25553)------------------------------
% 0.21/0.51 % (25553)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (25553)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (25553)Termination reason: Unknown
% 0.21/0.51 % (25553)Termination phase: Saturation
% 0.21/0.51
% 0.21/0.51 % (25553)Memory used [KB]: 5884
% 0.21/0.51 % (25553)Time elapsed: 0.086 s
% 0.21/0.51 % (25553)Instructions burned: 2 (million)
% 0.21/0.51 % (25553)------------------------------
% 0.21/0.51 % (25553)------------------------------
% 0.21/0.51 % (25547)First to succeed.
% 0.21/0.51 % (25547)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (25547)------------------------------
% 0.21/0.51 % (25547)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (25547)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (25547)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (25547)Memory used [KB]: 1407
% 0.21/0.51 % (25547)Time elapsed: 0.085 s
% 0.21/0.51 % (25547)Instructions burned: 2 (million)
% 0.21/0.51 % (25547)------------------------------
% 0.21/0.51 % (25547)------------------------------
% 0.21/0.51 % (25534)Success in time 0.153 s
%------------------------------------------------------------------------------