TSTP Solution File: SET688+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET688+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 : n002.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:53 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 153 ( 59 ~; 37 |; 48 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 56 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f71,plain,
$false,
inference(subsumption_resolution,[],[f69,f50]) ).
fof(f50,plain,
~ subset(sK1,sK2),
inference(subsumption_resolution,[],[f47,f30]) ).
fof(f30,plain,
~ equal_set(sK2,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( equal_set(sK2,sK0)
& ~ equal_set(sK1,sK0)
& ~ equal_set(sK2,sK1)
& subset(sK1,sK0)
& subset(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2] :
( equal_set(X2,X0)
& ~ equal_set(X1,X0)
& ~ equal_set(X2,X1)
& subset(X1,X0)
& subset(X2,X1) )
=> ( equal_set(sK2,sK0)
& ~ equal_set(sK1,sK0)
& ~ equal_set(sK2,sK1)
& subset(sK1,sK0)
& subset(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1,X2] :
( equal_set(X2,X0)
& ~ equal_set(X1,X0)
& ~ equal_set(X2,X1)
& subset(X1,X0)
& subset(X2,X1) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X1,X2,X0] :
( equal_set(X0,X1)
& ~ equal_set(X2,X1)
& ~ equal_set(X0,X2)
& subset(X2,X1)
& subset(X0,X2) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X2,X0,X1] :
( equal_set(X0,X1)
& ~ equal_set(X0,X2)
& subset(X0,X2)
& subset(X2,X1)
& ~ equal_set(X2,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X2,X0,X1] :
( ( ~ equal_set(X0,X2)
& subset(X0,X2)
& subset(X2,X1)
& ~ equal_set(X2,X1) )
=> ~ equal_set(X0,X1) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X5,X1] :
( ( subset(X1,X5)
& ~ equal_set(X1,X5)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X5,X1] :
( ( subset(X1,X5)
& ~ equal_set(X1,X5)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI04) ).
fof(f47,plain,
( equal_set(sK2,sK1)
| ~ subset(sK1,sK2) ),
inference(resolution,[],[f36,f28]) ).
fof(f28,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| equal_set(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X1,X0) )
& ( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X0] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) )
& ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) )
& ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> equal_set(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f69,plain,
subset(sK1,sK2),
inference(resolution,[],[f67,f29]) ).
fof(f29,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f20]) ).
fof(f67,plain,
! [X0] :
( ~ subset(X0,sK0)
| subset(X0,sK2) ),
inference(duplicate_literal_removal,[],[f65]) ).
fof(f65,plain,
! [X0] :
( subset(X0,sK2)
| subset(X0,sK2)
| ~ subset(X0,sK0) ),
inference(resolution,[],[f61,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ member(sK3(X0,X1),X0)
& member(sK3(X0,X1),X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) )
=> ( ~ member(sK3(X0,X1),X0)
& member(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f61,plain,
! [X3,X4] :
( member(sK3(X4,X3),sK2)
| ~ subset(X3,sK0)
| subset(X3,X4) ),
inference(resolution,[],[f58,f40]) ).
fof(f40,plain,
subset(sK0,sK2),
inference(resolution,[],[f38,f32]) ).
fof(f32,plain,
equal_set(sK2,sK0),
inference(cnf_transformation,[],[f20]) ).
fof(f38,plain,
! [X0,X1] :
( ~ equal_set(X1,X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f58,plain,
! [X2,X3,X4,X5] :
( ~ subset(X4,X5)
| ~ subset(X2,X4)
| member(sK3(X3,X2),X5)
| subset(X2,X3) ),
inference(resolution,[],[f43,f33]) ).
fof(f33,plain,
! [X3,X0,X1] :
( ~ member(X3,X1)
| ~ subset(X1,X0)
| member(X3,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X2,X0,X1] :
( member(sK3(X2,X0),X1)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(resolution,[],[f33,f34]) ).
fof(f34,plain,
! [X0,X1] :
( member(sK3(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET688+4 : 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.13/0.34 % Computer : n002.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:26:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (21804)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50 % (21820)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.50 % (21804)First to succeed.
% 0.20/0.50 % (21804)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 % (21804)------------------------------
% 0.20/0.50 % (21804)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (21804)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (21804)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (21804)Memory used [KB]: 5884
% 0.20/0.50 % (21804)Time elapsed: 0.100 s
% 0.20/0.50 % (21804)Instructions burned: 2 (million)
% 0.20/0.50 % (21804)------------------------------
% 0.20/0.50 % (21804)------------------------------
% 0.20/0.50 % (21796)Success in time 0.15 s
%------------------------------------------------------------------------------