TSTP Solution File: NUN069+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n026.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:08:04 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 75 ( 24 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 75 ( 22 ~; 11 |; 38 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-1 aty)
% Number of variables : 52 ( 27 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f116,plain,
$false,
inference(resolution,[],[f115,f71]) ).
fof(f71,plain,
! [X0] : r1(sK5(X0)),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] :
( r1(sK5(X0))
& sK4(X0) = sK5(X0)
& r1(sK6(X0))
& r4(X0,sK6(X0),sK4(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f32,f35,f34,f33]) ).
fof(f33,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( r1(X2)
& X1 = X2 )
& ? [X3] :
( r1(X3)
& r4(X0,X3,X1) ) )
=> ( ? [X2] :
( r1(X2)
& sK4(X0) = X2 )
& ? [X3] :
( r1(X3)
& r4(X0,X3,sK4(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0] :
( ? [X2] :
( r1(X2)
& sK4(X0) = X2 )
=> ( r1(sK5(X0))
& sK4(X0) = sK5(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0] :
( ? [X3] :
( r1(X3)
& r4(X0,X3,sK4(X0)) )
=> ( r1(sK6(X0))
& r4(X0,sK6(X0),sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& X1 = X2 )
& ? [X3] :
( r1(X3)
& r4(X0,X3,X1) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X0] :
? [X1] :
( ? [X3] :
( r1(X3)
& X1 = X3 )
& ? [X2] :
( r1(X2)
& r4(X0,X2,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X32] :
? [X33] :
( ? [X34] :
( r1(X34)
& r4(X32,X34,X33) )
& ? [X35] :
( r1(X35)
& X33 = X35 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5a) ).
fof(f115,plain,
! [X0] : ~ r1(X0),
inference(resolution,[],[f113,f103]) ).
fof(f103,plain,
! [X0] : r2(X0,sK0(X0)),
inference(equality_resolution,[],[f63]) ).
fof(f63,plain,
! [X2,X0] :
( r2(X0,X2)
| sK0(X0) != X2 ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X2] :
( ( r2(X0,X2)
& sK0(X0) = X2 )
| ( sK0(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f26]) ).
fof(f26,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( r2(X0,X2)
& X1 = X2 )
| ( X1 != X2
& ~ r2(X0,X2) ) )
=> ! [X2] :
( ( r2(X0,X2)
& sK0(X0) = X2 )
| ( sK0(X0) != X2
& ~ r2(X0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0] :
? [X1] :
! [X2] :
( ( r2(X0,X2)
& X1 = X2 )
| ( X1 != X2
& ~ r2(X0,X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( X3 != X4
& ~ r2(X2,X4) )
| ( X3 = X4
& r2(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f113,plain,
! [X0,X1] :
( ~ r2(X1,X0)
| ~ r1(X1) ),
inference(trivial_inequality_removal,[],[f81]) ).
fof(f81,plain,
! [X0,X1] :
( ~ r2(X1,X0)
| X0 != X0
| ~ r1(X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( X0 != X0
| ! [X1] :
( ~ r2(X1,X0)
| ~ r1(X1) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ? [X0] :
( X0 = X0
& ? [X1] :
( r1(X1)
& r2(X1,X0) ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ? [X38] :
( X38 = X38
& ? [X21] :
( r2(X21,X38)
& r1(X21) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
? [X38] :
( X38 = X38
& ? [X21] :
( r2(X21,X38)
& r1(X21) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneeqone) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 10:00:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.49 % (16043)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.49 % (16051)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.49 % (16051)First to succeed.
% 0.19/0.49 % (16055)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (16051)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (16051)------------------------------
% 0.19/0.50 % (16051)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (16051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (16051)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (16051)Memory used [KB]: 5500
% 0.19/0.50 % (16051)Time elapsed: 0.103 s
% 0.19/0.50 % (16051)Instructions burned: 2 (million)
% 0.19/0.50 % (16051)------------------------------
% 0.19/0.50 % (16051)------------------------------
% 0.19/0.50 % (16033)Success in time 0.159 s
%------------------------------------------------------------------------------