TSTP Solution File: SET592+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET592+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 : n027.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:31 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 72 ( 24 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 68 ( 22 ~; 13 |; 26 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 31 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f112,plain,
$false,
inference(subsumption_resolution,[],[f109,f40]) ).
fof(f40,plain,
empty_set != sK1,
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( subset(sK1,sK2)
& empty_set = intersection(sK0,sK2)
& empty_set != sK1
& subset(sK1,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f22,f23]) ).
fof(f23,plain,
( ? [X0,X1,X2] :
( subset(X1,X2)
& empty_set = intersection(X0,X2)
& empty_set != X1
& subset(X1,X0) )
=> ( subset(sK1,sK2)
& empty_set = intersection(sK0,sK2)
& empty_set != sK1
& subset(sK1,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1,X2] :
( subset(X1,X2)
& empty_set = intersection(X0,X2)
& empty_set != X1
& subset(X1,X0) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
? [X2,X1,X0] :
( subset(X1,X0)
& empty_set = intersection(X2,X0)
& empty_set != X1
& subset(X1,X2) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
? [X0,X2,X1] :
( empty_set != X1
& empty_set = intersection(X2,X0)
& subset(X1,X2)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0,X2,X1] :
( ( empty_set = intersection(X2,X0)
& subset(X1,X2)
& subset(X1,X0) )
=> empty_set = X1 ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X2,X0,X1] :
( ( subset(X0,X2)
& empty_set = intersection(X1,X2)
& subset(X0,X1) )
=> empty_set = X0 ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X2,X0,X1] :
( ( subset(X0,X2)
& empty_set = intersection(X1,X2)
& subset(X0,X1) )
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
fof(f109,plain,
empty_set = sK1,
inference(resolution,[],[f106,f60]) ).
fof(f60,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).
fof(f106,plain,
subset(sK1,empty_set),
inference(subsumption_resolution,[],[f96,f39]) ).
fof(f39,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f24]) ).
fof(f96,plain,
( subset(sK1,empty_set)
| ~ subset(sK1,sK0) ),
inference(resolution,[],[f87,f42]) ).
fof(f42,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f87,plain,
! [X2] :
( ~ subset(X2,sK2)
| ~ subset(X2,sK0)
| subset(X2,empty_set) ),
inference(superposition,[],[f46,f41]) ).
fof(f41,plain,
empty_set = intersection(sK0,sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f46,plain,
! [X2,X0,X1] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X1,X2,X0] :
( subset(X1,intersection(X2,X0))
| ~ subset(X1,X0)
| ~ subset(X1,X2) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X1,X2,X0] :
( subset(X1,intersection(X2,X0))
| ~ subset(X1,X2)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1,X2,X0] :
( ( subset(X1,X2)
& subset(X1,X0) )
=> subset(X1,intersection(X2,X0)) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET592+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/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 : n027.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:18:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (14403)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52 % (14396)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.19/0.52 % (14390)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52 % (14395)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.52 % (14390)First to succeed.
% 0.19/0.52 % (14405)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (14403)Instruction limit reached!
% 0.19/0.52 % (14403)------------------------------
% 0.19/0.52 % (14403)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (14403)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (14403)Termination reason: Unknown
% 0.19/0.52 % (14403)Termination phase: Saturation
% 0.19/0.52
% 0.19/0.52 % (14403)Memory used [KB]: 6012
% 0.19/0.52 % (14403)Time elapsed: 0.075 s
% 0.19/0.52 % (14403)Instructions burned: 4 (million)
% 0.19/0.52 % (14403)------------------------------
% 0.19/0.52 % (14403)------------------------------
% 0.19/0.52 % (14398)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.52 % (14390)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (14390)------------------------------
% 0.19/0.53 % (14390)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (14390)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (14390)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (14390)Memory used [KB]: 6012
% 0.19/0.53 % (14390)Time elapsed: 0.113 s
% 0.19/0.53 % (14390)Instructions burned: 3 (million)
% 0.19/0.53 % (14390)------------------------------
% 0.19/0.53 % (14390)------------------------------
% 0.19/0.53 % (14388)Success in time 0.175 s
%------------------------------------------------------------------------------