TSTP Solution File: SET583+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET583+3 : TPTP v8.1.0. Released v2.2.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 : n022.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:21:30 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 58 ( 20 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 60 ( 21 ~; 12 |; 22 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 16 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(subsumption_resolution,[],[f36,f29]) ).
fof(f29,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( subset(sK2,sK1)
& sK1 != sK2
& subset(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] :
( subset(X1,X0)
& X0 != X1
& subset(X0,X1) )
=> ( subset(sK2,sK1)
& sK1 != sK2
& subset(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1] :
( subset(X1,X0)
& X0 != X1
& subset(X0,X1) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X1,X0] :
( subset(X0,X1)
& X0 != X1
& subset(X1,X0) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
? [X1,X0] :
( X0 != X1
& subset(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
~ ! [X1,X0] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X1,X0] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X1,X0] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_extensionality) ).
fof(f36,plain,
sK1 = sK2,
inference(subsumption_resolution,[],[f33,f30]) ).
fof(f30,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f33,plain,
( ~ subset(sK2,sK1)
| sK1 = sK2 ),
inference(resolution,[],[f28,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f28,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/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.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:03:56 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.47 % (13405)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.47 % (13412)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.48 % (13412)First to succeed.
% 0.20/0.48 % (13412)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (13412)------------------------------
% 0.20/0.48 % (13412)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (13412)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (13412)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (13412)Memory used [KB]: 5884
% 0.20/0.48 % (13412)Time elapsed: 0.091 s
% 0.20/0.48 % (13412)Instructions burned: 1 (million)
% 0.20/0.48 % (13412)------------------------------
% 0.20/0.48 % (13412)------------------------------
% 0.20/0.48 % (13404)Success in time 0.128 s
%------------------------------------------------------------------------------