TSTP Solution File: SET638+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET638+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 : n013.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:42 EDT 2022
% Result : Theorem 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 27 unt; 0 def)
% Number of atoms : 60 ( 33 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 33 ( 11 ~; 2 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 43 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f131,plain,
$false,
inference(subsumption_resolution,[],[f130,f50]) ).
fof(f50,plain,
~ subset(sK1,sK0),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
( subset(sK1,union(sK0,sK2))
& ~ subset(sK1,sK0)
& empty_set = intersection(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f28,f29]) ).
fof(f29,plain,
( ? [X0,X1,X2] :
( subset(X1,union(X0,X2))
& ~ subset(X1,X0)
& empty_set = intersection(X1,X2) )
=> ( subset(sK1,union(sK0,sK2))
& ~ subset(sK1,sK0)
& empty_set = intersection(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0,X1,X2] :
( subset(X1,union(X0,X2))
& ~ subset(X1,X0)
& empty_set = intersection(X1,X2) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
? [X2,X0,X1] :
( subset(X0,union(X2,X1))
& ~ subset(X0,X2)
& intersection(X0,X1) = empty_set ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
? [X0,X2,X1] :
( ~ subset(X0,X2)
& intersection(X0,X1) = empty_set
& subset(X0,union(X2,X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X0,X2,X1] :
( ( intersection(X0,X1) = empty_set
& subset(X0,union(X2,X1)) )
=> subset(X0,X2) ),
inference(rectify,[],[f16]) ).
fof(f16,negated_conjecture,
~ ! [X0,X2,X1] :
( ( empty_set = intersection(X0,X2)
& subset(X0,union(X1,X2)) )
=> subset(X0,X1) ),
inference(negated_conjecture,[],[f15]) ).
fof(f15,conjecture,
! [X0,X2,X1] :
( ( empty_set = intersection(X0,X2)
& subset(X0,union(X1,X2)) )
=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th120) ).
fof(f130,plain,
subset(sK1,sK0),
inference(superposition,[],[f65,f123]) ).
fof(f123,plain,
sK1 = intersection(sK0,sK1),
inference(forward_demodulation,[],[f122,f72]) ).
fof(f72,plain,
! [X0] : union(X0,empty_set) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : union(X0,empty_set) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_empty_set) ).
fof(f122,plain,
sK1 = union(intersection(sK0,sK1),empty_set),
inference(forward_demodulation,[],[f121,f80]) ).
fof(f80,plain,
empty_set = intersection(sK2,sK1),
inference(forward_demodulation,[],[f49,f71]) ).
fof(f71,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f49,plain,
empty_set = intersection(sK1,sK2),
inference(cnf_transformation,[],[f30]) ).
fof(f121,plain,
sK1 = union(intersection(sK0,sK1),intersection(sK2,sK1)),
inference(forward_demodulation,[],[f120,f66]) ).
fof(f66,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f120,plain,
sK1 = union(intersection(sK2,sK1),intersection(sK0,sK1)),
inference(forward_demodulation,[],[f119,f71]) ).
fof(f119,plain,
sK1 = union(intersection(sK2,sK1),intersection(sK1,sK0)),
inference(forward_demodulation,[],[f118,f66]) ).
fof(f118,plain,
sK1 = union(intersection(sK1,sK0),intersection(sK2,sK1)),
inference(forward_demodulation,[],[f117,f71]) ).
fof(f117,plain,
sK1 = union(intersection(sK1,sK0),intersection(sK1,sK2)),
inference(forward_demodulation,[],[f114,f67]) ).
fof(f67,plain,
! [X2,X0,X1] : union(intersection(X2,X1),intersection(X2,X0)) = intersection(X2,union(X1,X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] : union(intersection(X2,X1),intersection(X2,X0)) = intersection(X2,union(X1,X0)),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X2,X0] : union(intersection(X0,X2),intersection(X0,X1)) = intersection(X0,union(X2,X1)),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] : intersection(X0,union(X1,X2)) = union(intersection(X0,X1),intersection(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_distributes_over_union) ).
fof(f114,plain,
sK1 = intersection(sK1,union(sK0,sK2)),
inference(resolution,[],[f64,f51]) ).
fof(f51,plain,
subset(sK1,union(sK0,sK2)),
inference(cnf_transformation,[],[f30]) ).
fof(f64,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| intersection(X0,X1) = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( intersection(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).
fof(f65,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_is_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET638+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 14:05:17 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.47 % (15656)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.48 % (15648)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.17/0.48 % (15665)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.48 % (15647)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.17/0.49 % (15664)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.17/0.49 % (15657)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.17/0.49 % (15649)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.17/0.49 % (15656)First to succeed.
% 0.17/0.49 % (15663)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.17/0.49 % (15655)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.17/0.49 % (15655)Instruction limit reached!
% 0.17/0.49 % (15655)------------------------------
% 0.17/0.49 % (15655)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (15655)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (15655)Termination reason: Unknown
% 0.17/0.49 % (15655)Termination phase: Saturation
% 0.17/0.49
% 0.17/0.49 % (15655)Memory used [KB]: 5884
% 0.17/0.49 % (15655)Time elapsed: 0.104 s
% 0.17/0.49 % (15655)Instructions burned: 3 (million)
% 0.17/0.49 % (15655)------------------------------
% 0.17/0.49 % (15655)------------------------------
% 0.17/0.50 % (15656)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Theorem for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (15656)------------------------------
% 0.17/0.50 % (15656)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (15656)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (15656)Termination reason: Refutation
% 0.17/0.50
% 0.17/0.50 % (15656)Memory used [KB]: 6012
% 0.17/0.50 % (15656)Time elapsed: 0.106 s
% 0.17/0.50 % (15656)Instructions burned: 4 (million)
% 0.17/0.50 % (15656)------------------------------
% 0.17/0.50 % (15656)------------------------------
% 0.17/0.50 % (15640)Success in time 0.165 s
%------------------------------------------------------------------------------