TSTP Solution File: SEU151+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.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 : n012.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:26:55 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 118 ( 89 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 157 ( 63 ~; 48 |; 40 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 71 ( 55 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,plain,
$false,
inference(unit_resulting_resolution,[],[f29,f31,f39,f36]) ).
fof(f36,plain,
! [X2,X1,X4] :
( ~ in(X4,unordered_pair(X2,X1))
| X2 = X4
| X1 = X4 ),
inference(equality_resolution,[],[f21]) ).
fof(f21,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X2 = X4
| ~ in(X4,X0)
| unordered_pair(X2,X1) != X0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( unordered_pair(X2,X1) = X0
| ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X2 )
| ~ in(sK0(X0,X1,X2),X0) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X2
| in(sK0(X0,X1,X2),X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ( X1 != X4
& X2 != X4 ) )
& ( X1 = X4
| X2 = X4
| ~ in(X4,X0) ) )
| unordered_pair(X2,X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X2 != X3 )
| ~ in(X3,X0) )
& ( X1 = X3
| X2 = X3
| in(X3,X0) ) )
=> ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X2 )
| ~ in(sK0(X0,X1,X2),X0) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X2
| in(sK0(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( unordered_pair(X2,X1) = X0
| ? [X3] :
( ( ( X1 != X3
& X2 != X3 )
| ~ in(X3,X0) )
& ( X1 = X3
| X2 = X3
| in(X3,X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ( X1 != X4
& X2 != X4 ) )
& ( X1 = X4
| X2 = X4
| ~ in(X4,X0) ) )
| unordered_pair(X2,X1) != X0 ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X2,X0,X1] :
( ( unordered_pair(X1,X0) = X2
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X0 = X3
| X1 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X1,X0) != X2 ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X2,X0,X1] :
( ( unordered_pair(X1,X0) = X2
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X0 = X3
| X1 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X1,X0) != X2 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
! [X2,X0,X1] :
( unordered_pair(X1,X0) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X0 = X3
| X1 = X3 ) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0,X2] :
( ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) )
<=> unordered_pair(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f39,plain,
in(sK4,unordered_pair(sK2,sK3)),
inference(superposition,[],[f35,f30]) ).
fof(f30,plain,
unordered_pair(sK4,sK1) = unordered_pair(sK2,sK3),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( sK4 != sK2
& unordered_pair(sK4,sK1) = unordered_pair(sK2,sK3)
& sK3 != sK4 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2,X3] :
( X1 != X3
& unordered_pair(X3,X0) = unordered_pair(X1,X2)
& X2 != X3 )
=> ( sK4 != sK2
& unordered_pair(sK4,sK1) = unordered_pair(sK2,sK3)
& sK3 != sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( X1 != X3
& unordered_pair(X3,X0) = unordered_pair(X1,X2)
& X2 != X3 ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X1,X3,X0,X2] :
( X2 != X3
& unordered_pair(X3,X0) = unordered_pair(X2,X1)
& X0 != X2 ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
~ ! [X2,X0,X1,X3] :
~ ( X2 != X3
& unordered_pair(X3,X0) = unordered_pair(X2,X1)
& X0 != X2 ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X3,X1,X0,X2] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X3,X1,X0,X2] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f35,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X4] :
( in(X4,X0)
| unordered_pair(X4,X1) != X0 ),
inference(equality_resolution,[],[f22]) ).
fof(f22,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| X2 != X4
| unordered_pair(X2,X1) != X0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
sK4 != sK2,
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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 : n012.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 14:45:05 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.20/0.48 % (23939)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.49 % (23939)First to succeed.
% 0.20/0.50 % (23939)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (23939)------------------------------
% 0.20/0.50 % (23939)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (23939)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (23939)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (23939)Memory used [KB]: 1535
% 0.20/0.50 % (23939)Time elapsed: 0.076 s
% 0.20/0.50 % (23939)Instructions burned: 2 (million)
% 0.20/0.50 % (23939)------------------------------
% 0.20/0.50 % (23939)------------------------------
% 0.20/0.50 % (23915)Success in time 0.15 s
%------------------------------------------------------------------------------