TSTP Solution File: SEU148+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU148+3 : TPTP v8.1.0. Released v3.2.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 : n006.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:09 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 99 ( 59 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 110 ( 42 ~; 38 |; 20 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 44 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,plain,
$false,
inference(subsumption_resolution,[],[f66,f30]) ).
fof(f30,plain,
sK1 != sK0,
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( sK1 != sK0
& subset(singleton(sK0),singleton(sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f17]) ).
fof(f17,plain,
( ? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) )
=> ( sK1 != sK0
& subset(singleton(sK0),singleton(sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
? [X1,X0] :
( X0 != X1
& subset(singleton(X1),singleton(X0)) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X1,X0] :
( subset(singleton(X1),singleton(X0))
=> X0 = X1 ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X1,X0] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X1,X0] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f66,plain,
sK1 = sK0,
inference(resolution,[],[f62,f44]) ).
fof(f44,plain,
! [X3,X1] :
( ~ in(X3,singleton(X1))
| X1 = X3 ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X3,X0,X1] :
( X1 = X3
| ~ in(X3,X0)
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ( ( ~ in(sK3(X0,X1),X0)
| sK3(X0,X1) != X1 )
& ( in(sK3(X0,X1),X0)
| sK3(X0,X1) = X1 ) ) )
& ( ! [X3] :
( ( X1 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| X1 != X3 ) )
| singleton(X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) )
=> ( ( ~ in(sK3(X0,X1),X0)
| sK3(X0,X1) != X1 )
& ( in(sK3(X0,X1),X0)
| sK3(X0,X1) = X1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) ) )
& ( ! [X3] :
( ( X1 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| X1 != X3 ) )
| singleton(X1) != X0 ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) ) )
& ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( singleton(X1) = X0
<=> ! [X2] :
( X1 = X2
<=> in(X2,X0) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f62,plain,
in(sK1,singleton(sK0)),
inference(superposition,[],[f46,f54]) ).
fof(f54,plain,
singleton(sK0) = singleton(sK1),
inference(subsumption_resolution,[],[f53,f33]) ).
fof(f33,plain,
! [X0] : singleton(X0) != empty_set,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f53,plain,
( empty_set = singleton(sK0)
| singleton(sK0) = singleton(sK1) ),
inference(resolution,[],[f40,f29]) ).
fof(f29,plain,
subset(singleton(sK0),singleton(sK1)),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
! [X0,X1] :
( ~ subset(X0,singleton(X1))
| empty_set = X0
| singleton(X1) = X0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f46,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X3,X0] :
( in(X3,X0)
| singleton(X3) != X0 ),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X3,X0,X1] :
( in(X3,X0)
| X1 != X3
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU148+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/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.34 % Computer : n006.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:44:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 % (16965)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.46 % (16956)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.47 % (16947)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.47 % (16956)First to succeed.
% 0.19/0.47 % (16956)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (16956)------------------------------
% 0.19/0.47 % (16956)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (16956)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (16956)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (16956)Memory used [KB]: 5373
% 0.19/0.47 % (16956)Time elapsed: 0.081 s
% 0.19/0.47 % (16956)Instructions burned: 3 (million)
% 0.19/0.47 % (16956)------------------------------
% 0.19/0.47 % (16956)------------------------------
% 0.19/0.47 % (16929)Success in time 0.125 s
%------------------------------------------------------------------------------