TSTP Solution File: SET019+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET019+4 : 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 : n024.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:18:27 EDT 2022
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 9 |; 15 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,plain,
$false,
inference(subsumption_resolution,[],[f43,f30]) ).
fof(f30,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( ~ equal_set(sK1,sK0)
& subset(sK1,sK0)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f22]) ).
fof(f22,plain,
( ? [X0,X1] :
( ~ equal_set(X1,X0)
& subset(X1,X0)
& subset(X0,X1) )
=> ( ~ equal_set(sK1,sK0)
& subset(sK1,sK0)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1] :
( ~ equal_set(X1,X0)
& subset(X1,X0)
& subset(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
? [X1,X0] :
( ~ equal_set(X1,X0)
& subset(X0,X1)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI02) ).
fof(f43,plain,
~ subset(sK1,sK0),
inference(subsumption_resolution,[],[f42,f29]) ).
fof(f29,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
( ~ subset(sK0,sK1)
| ~ subset(sK1,sK0) ),
inference(resolution,[],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X1,X0) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X1,X0] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f31,plain,
~ equal_set(sK1,sK0),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET019+4 : TPTP v8.1.0. Released v2.2.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.14/0.34 % Computer : n024.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 12:57:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.50 % (29028)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.21/0.50 % (29037)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.50 % (29037)First to succeed.
% 0.21/0.50 % (29037)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50 % (29037)------------------------------
% 0.21/0.50 % (29037)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (29037)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (29037)Termination reason: Refutation
% 0.21/0.50
% 0.21/0.50 % (29037)Memory used [KB]: 5884
% 0.21/0.50 % (29037)Time elapsed: 0.094 s
% 0.21/0.50 % (29037)Instructions burned: 1 (million)
% 0.21/0.50 % (29037)------------------------------
% 0.21/0.50 % (29037)------------------------------
% 0.21/0.50 % (29021)Success in time 0.15 s
%------------------------------------------------------------------------------