TSTP Solution File: SEU149+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU149+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 : n027.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:54 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 147 ( 101 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 185 ( 66 ~; 68 |; 39 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 64 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f58,plain,
$false,
inference(subsumption_resolution,[],[f56,f33]) ).
fof(f33,plain,
sK2 != sK1,
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( sK2 != sK1
& unordered_pair(sK1,sK3) = singleton(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = singleton(X1) )
=> ( sK2 != sK1
& unordered_pair(sK1,sK3) = singleton(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = singleton(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
~ ! [X0,X1,X2] :
( unordered_pair(X0,X2) = singleton(X1)
=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f56,plain,
sK2 = sK1,
inference(resolution,[],[f50,f41]) ).
fof(f41,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 )
& ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 ) ) )
& ( ! [X3] :
( ( X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| X0 != X3 ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) )
=> ( ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 )
& ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) )
& ( ! [X3] :
( ( X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| X0 != X3 ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) )
& ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( X0 = X2
<=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f50,plain,
in(sK1,singleton(sK2)),
inference(superposition,[],[f46,f32]) ).
fof(f32,plain,
unordered_pair(sK1,sK3) = singleton(sK2),
inference(cnf_transformation,[],[f20]) ).
fof(f46,plain,
! [X2,X4] : in(X4,unordered_pair(X4,X2)),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X2,X1,X4] :
( in(X4,X1)
| unordered_pair(X4,X2) != X1 ),
inference(equality_resolution,[],[f36]) ).
fof(f36,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| X0 != X4
| unordered_pair(X0,X2) != X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X2) = X1
| ( ( ~ in(sK4(X0,X1,X2),X1)
| ( sK4(X0,X1,X2) != X0
& sK4(X0,X1,X2) != X2 ) )
& ( in(sK4(X0,X1,X2),X1)
| sK4(X0,X1,X2) = X0
| sK4(X0,X1,X2) = X2 ) ) )
& ( ! [X4] :
( ( X0 = X4
| X2 = X4
| ~ in(X4,X1) )
& ( in(X4,X1)
| ( X0 != X4
& X2 != X4 ) ) )
| unordered_pair(X0,X2) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f24,f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ( X0 != X3
& X2 != X3 ) )
& ( in(X3,X1)
| X0 = X3
| X2 = X3 ) )
=> ( ( ~ in(sK4(X0,X1,X2),X1)
| ( sK4(X0,X1,X2) != X0
& sK4(X0,X1,X2) != X2 ) )
& ( in(sK4(X0,X1,X2),X1)
| sK4(X0,X1,X2) = X0
| sK4(X0,X1,X2) = X2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( X0 != X3
& X2 != X3 ) )
& ( in(X3,X1)
| X0 = X3
| X2 = X3 ) ) )
& ( ! [X4] :
( ( X0 = X4
| X2 = X4
| ~ in(X4,X1) )
& ( in(X4,X1)
| ( X0 != X4
& X2 != X4 ) ) )
| unordered_pair(X0,X2) != X1 ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X1,X2,X0] :
( ( unordered_pair(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( in(X3,X2)
| X1 = X3
| X0 = X3 ) ) )
& ( ! [X3] :
( ( X1 = X3
| X0 = X3
| ~ in(X3,X2) )
& ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| unordered_pair(X1,X0) != X2 ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X1,X2,X0] :
( ( unordered_pair(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( in(X3,X2)
| X1 = X3
| X0 = X3 ) ) )
& ( ! [X3] :
( ( X1 = X3
| X0 = X3
| ~ in(X3,X2) )
& ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| unordered_pair(X1,X0) != X2 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X1,X2,X0] :
( unordered_pair(X1,X0) = X2
<=> ! [X3] :
( ( X1 = X3
| X0 = X3 )
<=> in(X3,X2) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X0 = X3
| X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.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.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 15:01:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 % (1574)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.45 % (1591)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.46 % (1574)First to succeed.
% 0.19/0.46 % (1574)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (1574)------------------------------
% 0.19/0.46 % (1574)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (1574)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (1574)Termination reason: Refutation
% 0.19/0.46
% 0.19/0.46 % (1574)Memory used [KB]: 5884
% 0.19/0.46 % (1574)Time elapsed: 0.081 s
% 0.19/0.46 % (1574)Instructions burned: 2 (million)
% 0.19/0.46 % (1574)------------------------------
% 0.19/0.46 % (1574)------------------------------
% 0.19/0.46 % (1566)Success in time 0.116 s
%------------------------------------------------------------------------------