TSTP Solution File: SET148+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET148+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_sat --cores 0 -t %d %s
% Computer : n014.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:23:57 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 12 unt; 0 def)
% Number of atoms : 108 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 107 ( 41 ~; 39 |; 17 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 66 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f314,plain,
$false,
inference(subsumption_resolution,[],[f312,f153]) ).
fof(f153,plain,
~ subset(sK1,sF4),
inference(subsumption_resolution,[],[f151,f92]) ).
fof(f92,plain,
~ equal_set(sF4,sK1),
inference(definition_folding,[],[f72,f91]) ).
fof(f91,plain,
intersection(sK1,sK1) = sF4,
introduced(function_definition,[]) ).
fof(f72,plain,
~ equal_set(intersection(sK1,sK1),sK1),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
~ equal_set(intersection(sK1,sK1),sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f29,f42]) ).
fof(f42,plain,
( ? [X0] : ~ equal_set(intersection(X0,X0),X0)
=> ~ equal_set(intersection(sK1,sK1),sK1) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0] : ~ equal_set(intersection(X0,X0),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(intersection(X0,X0),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] : equal_set(intersection(X0,X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI13) ).
fof(f151,plain,
( equal_set(sF4,sK1)
| ~ subset(sK1,sF4) ),
inference(resolution,[],[f150,f68]) ).
fof(f68,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X1,X0) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( equal_set(X1,X0)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
inference(rectify,[],[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(f150,plain,
subset(sF4,sK1),
inference(duplicate_literal_removal,[],[f147]) ).
fof(f147,plain,
( subset(sF4,sK1)
| subset(sF4,sK1) ),
inference(resolution,[],[f102,f85]) ).
fof(f85,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( member(sK3(X0,X1),X1)
& ~ member(sK3(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f57,f58]) ).
fof(f58,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) )
=> ( member(sK3(X0,X1),X1)
& ~ member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) ) ) ),
inference(rectify,[],[f56]) ).
fof(f56,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f102,plain,
! [X12] :
( member(sK3(X12,sF4),sK1)
| subset(sF4,X12) ),
inference(resolution,[],[f86,f94]) ).
fof(f94,plain,
! [X1] :
( ~ member(X1,sF4)
| member(X1,sK1) ),
inference(superposition,[],[f60,f91]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ~ member(X1,intersection(X0,X2))
| member(X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X0)
| ~ member(X1,X2) )
& ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X0)
| ~ member(X1,X2) )
& ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( member(X1,intersection(X0,X2))
<=> ( member(X1,X0)
& member(X1,X2) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] :
( ( member(X2,X1)
& member(X2,X0) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
fof(f86,plain,
! [X0,X1] :
( member(sK3(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f312,plain,
subset(sK1,sF4),
inference(superposition,[],[f303,f91]) ).
fof(f303,plain,
! [X0] : subset(X0,intersection(X0,X0)),
inference(duplicate_literal_removal,[],[f293]) ).
fof(f293,plain,
! [X0] :
( subset(X0,intersection(X0,X0))
| subset(X0,intersection(X0,X0)) ),
inference(resolution,[],[f280,f85]) ).
fof(f280,plain,
! [X0,X1] :
( member(sK3(X1,X0),intersection(X0,X0))
| subset(X0,X1) ),
inference(duplicate_literal_removal,[],[f261]) ).
fof(f261,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK3(X1,X0),intersection(X0,X0))
| subset(X0,X1) ),
inference(resolution,[],[f174,f86]) ).
fof(f174,plain,
! [X48,X46,X47] :
( ~ member(sK3(X46,X47),X48)
| subset(X47,X46)
| member(sK3(X46,X47),intersection(X47,X48)) ),
inference(resolution,[],[f62,f86]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ member(X1,X0)
| ~ member(X1,X2)
| member(X1,intersection(X0,X2)) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0.
% 0.13/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.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 13:23:33 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.48 % (21964)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.49 % (21942)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (21942)First to succeed.
% 0.20/0.50 % (21942)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 % (21942)------------------------------
% 0.20/0.50 % (21942)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (21942)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (21942)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (21942)Memory used [KB]: 5628
% 0.20/0.50 % (21942)Time elapsed: 0.078 s
% 0.20/0.50 % (21942)Instructions burned: 13 (million)
% 0.20/0.50 % (21942)------------------------------
% 0.20/0.50 % (21942)------------------------------
% 0.20/0.50 % (21937)Success in time 0.144 s
%------------------------------------------------------------------------------