TSTP Solution File: SEU150+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU150+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 : n015.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 : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 6 |; 5 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 35 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f25]) ).
fof(f25,plain,
sK2 != sK1,
inference(backward_demodulation,[],[f17,f23]) ).
fof(f23,plain,
sK0 = sK1,
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X0] :
( singleton(X0) != singleton(sK1)
| sK0 = X0 ),
inference(superposition,[],[f19,f18]) ).
fof(f18,plain,
unordered_pair(sK0,sK2) = singleton(sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( unordered_pair(sK0,sK2) = singleton(sK1)
& sK2 != sK0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f13]) ).
fof(f13,plain,
( ? [X0,X1,X2] :
( singleton(X1) = unordered_pair(X0,X2)
& X0 != X2 )
=> ( unordered_pair(sK0,sK2) = singleton(sK1)
& sK2 != sK0 ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1,X2] :
( singleton(X1) = unordered_pair(X0,X2)
& X0 != X2 ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
? [X0,X2,X1] :
( unordered_pair(X0,X1) = singleton(X2)
& X0 != X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X0,X2,X1] :
( unordered_pair(X0,X1) = singleton(X2)
=> X0 = X1 ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X1,X2,X0] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X1,X2,X0] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f19,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X1) != singleton(X2)
| X0 = X2 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( unordered_pair(X0,X1) != singleton(X2)
| X0 = X2 ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1,X0,X2] :
( unordered_pair(X1,X0) != singleton(X2)
| X1 = X2 ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0,X2] :
( unordered_pair(X1,X0) = singleton(X2)
=> X1 = X2 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X1,X0] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f17,plain,
sK2 != sK0,
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
sK2 = sK1,
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X6] :
( singleton(X6) != singleton(sK1)
| sK2 = X6 ),
inference(superposition,[],[f22,f24]) ).
fof(f24,plain,
unordered_pair(sK1,sK2) = singleton(sK1),
inference(backward_demodulation,[],[f18,f23]) ).
fof(f22,plain,
! [X6,X4,X5] :
( singleton(X6) != unordered_pair(X5,X4)
| X4 = X6 ),
inference(superposition,[],[f19,f16]) ).
fof(f16,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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 : n015.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.35 % DateTime : Tue Aug 30 15:07:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (31708)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.50 % (31708)First to succeed.
% 0.20/0.50 % (31708)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 % (31708)------------------------------
% 0.20/0.50 % (31708)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (31708)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (31708)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (31708)Memory used [KB]: 5884
% 0.20/0.50 % (31708)Time elapsed: 0.078 s
% 0.20/0.50 % (31708)Instructions burned: 2 (million)
% 0.20/0.50 % (31708)------------------------------
% 0.20/0.50 % (31708)------------------------------
% 0.20/0.50 % (31693)Success in time 0.148 s
%------------------------------------------------------------------------------