TSTP Solution File: SEU150+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n021.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:32:10 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 13 ~; 4 |; 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 : 38 ( 29 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f40,plain,
$false,
inference(subsumption_resolution,[],[f39,f31]) ).
fof(f31,plain,
sK1 != sK2,
inference(superposition,[],[f17,f27]) ).
fof(f27,plain,
sK1 = sK0,
inference(equality_resolution,[],[f23]) ).
fof(f23,plain,
! [X0] :
( singleton(X0) != singleton(sK1)
| sK0 = X0 ),
inference(superposition,[],[f15,f16]) ).
fof(f16,plain,
unordered_pair(sK0,sK2) = singleton(sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( sK2 != sK0
& unordered_pair(sK0,sK2) = singleton(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2] :
( X0 != X2
& unordered_pair(X0,X2) = singleton(X1) )
=> ( sK2 != sK0
& unordered_pair(sK0,sK2) = singleton(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( X0 != X2
& unordered_pair(X0,X2) = singleton(X1) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X0,X2,X1] :
( X0 != X1
& unordered_pair(X0,X1) = singleton(X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2] :
( 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(f15,plain,
! [X2,X0,X1] :
( singleton(X1) != unordered_pair(X2,X0)
| X1 = X2 ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X1) != unordered_pair(X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
! [X1,X2,X0] :
( singleton(X1) = unordered_pair(X2,X0)
=> X1 = X2 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( 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,[],[f13]) ).
fof(f39,plain,
sK1 = sK2,
inference(equality_resolution,[],[f26]) ).
fof(f26,plain,
! [X7] :
( singleton(X7) != singleton(sK1)
| sK2 = X7 ),
inference(superposition,[],[f15,f19]) ).
fof(f19,plain,
unordered_pair(sK2,sK0) = singleton(sK1),
inference(superposition,[],[f18,f16]) ).
fof(f18,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,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.04/0.12 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % 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 : n021.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:47:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (28572)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.54 % (28571)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54 TRYING [1]
% 0.19/0.54 TRYING [2]
% 0.19/0.54 TRYING [3]
% 0.19/0.54 % (28572)First to succeed.
% 0.19/0.54 TRYING [4]
% 0.19/0.54 % (28572)Refutation found. Thanks to Tanya!
% 0.19/0.54 % SZS status Theorem for theBenchmark
% 0.19/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.54 % (28572)------------------------------
% 0.19/0.54 % (28572)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (28572)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (28572)Termination reason: Refutation
% 0.19/0.54
% 0.19/0.54 % (28572)Memory used [KB]: 5373
% 0.19/0.54 % (28572)Time elapsed: 0.131 s
% 0.19/0.54 % (28572)Instructions burned: 2 (million)
% 0.19/0.54 % (28572)------------------------------
% 0.19/0.54 % (28572)------------------------------
% 0.19/0.54 % (28564)Success in time 0.191 s
%------------------------------------------------------------------------------