TSTP Solution File: SET013-2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET013-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Sun May 5 09:09:25 EDT 2024
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 22 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3615,plain,
$false,
inference(subsumption_resolution,[],[f3609,f24]) ).
fof(f24,axiom,
~ equal_sets(cs,ds),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
fof(f3609,plain,
equal_sets(cs,ds),
inference(resolution,[],[f3599,f71]) ).
fof(f71,plain,
! [X0] :
( ~ equal_sets(X0,intersection(bs,as))
| equal_sets(X0,ds) ),
inference(resolution,[],[f18,f23]) ).
fof(f23,axiom,
equal_sets(intersection(bs,as),ds),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_b_and_a_is_d) ).
fof(f18,axiom,
! [X8,X4,X5] :
( ~ equal_sets(X5,X8)
| ~ equal_sets(X4,X5)
| equal_sets(X4,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_for_set_equal) ).
fof(f3599,plain,
equal_sets(cs,intersection(bs,as)),
inference(subsumption_resolution,[],[f3591,f1786]) ).
fof(f1786,plain,
! [X0,X1] : subset(intersection(X0,X1),intersection(X1,X0)),
inference(duplicate_literal_removal,[],[f1751]) ).
fof(f1751,plain,
! [X0,X1] :
( subset(intersection(X0,X1),intersection(X1,X0))
| subset(intersection(X0,X1),intersection(X1,X0)) ),
inference(resolution,[],[f260,f50]) ).
fof(f50,plain,
! [X2,X0,X1] :
( member(member_of_1_not_of_2(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f12,f3]) ).
fof(f3,axiom,
! [X2,X3] :
( member(member_of_1_not_of_2(X2,X3),X2)
| subset(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsets_axiom1) ).
fof(f12,axiom,
! [X0,X4,X5] :
( ~ member(X0,intersection(X4,X5))
| member(X0,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_intersection_is_member_of_set2) ).
fof(f260,plain,
! [X2,X0,X1] :
( ~ member(member_of_1_not_of_2(intersection(X0,X1),intersection(X2,X0)),X2)
| subset(intersection(X0,X1),intersection(X2,X0)) ),
inference(duplicate_literal_removal,[],[f246]) ).
fof(f246,plain,
! [X2,X0,X1] :
( ~ member(member_of_1_not_of_2(intersection(X0,X1),intersection(X2,X0)),X2)
| subset(intersection(X0,X1),intersection(X2,X0))
| subset(intersection(X0,X1),intersection(X2,X0)) ),
inference(resolution,[],[f93,f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( member(member_of_1_not_of_2(intersection(X0,X1),X2),X0)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f11,f3]) ).
fof(f11,axiom,
! [X0,X4,X5] :
( ~ member(X0,intersection(X4,X5))
| member(X0,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_intersection_is_member_of_set1) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ member(member_of_1_not_of_2(X0,intersection(X1,X2)),X2)
| ~ member(member_of_1_not_of_2(X0,intersection(X1,X2)),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[],[f10,f4]) ).
fof(f4,axiom,
! [X2,X3] :
( ~ member(member_of_1_not_of_2(X2,X3),X3)
| subset(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsets_axiom2) ).
fof(f10,axiom,
! [X0,X4,X5] :
( member(X0,intersection(X4,X5))
| ~ member(X0,X5)
| ~ member(X0,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_both_is_member_of_intersection) ).
fof(f3591,plain,
( ~ subset(intersection(as,bs),intersection(bs,as))
| equal_sets(cs,intersection(bs,as)) ),
inference(resolution,[],[f1786,f196]) ).
fof(f196,plain,
! [X0] :
( ~ subset(X0,intersection(as,bs))
| ~ subset(intersection(as,bs),X0)
| equal_sets(cs,X0) ),
inference(resolution,[],[f69,f32]) ).
fof(f32,plain,
equal_sets(cs,intersection(as,bs)),
inference(resolution,[],[f17,f22]) ).
fof(f22,axiom,
equal_sets(intersection(as,bs),cs),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_a_and_b_is_c) ).
fof(f17,axiom,
! [X4,X5] :
( ~ equal_sets(X4,X5)
| equal_sets(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_for_set_equal) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ equal_sets(X0,X1)
| equal_sets(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(resolution,[],[f18,f15]) ).
fof(f15,axiom,
! [X6,X7] :
( equal_sets(X7,X6)
| ~ subset(X7,X6)
| ~ subset(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsets_are_set_equal_sets) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SET013-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 16:35:37 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % (5393)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.35 % (5398)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.35 % (5395)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.35 % (5396)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.12/0.35 % (5397)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.12/0.35 % (5399)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.12/0.35 % (5400)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.35 TRYING [1]
% 0.12/0.35 TRYING [1,1,1]
% 0.12/0.35 TRYING [1,1,1]
% 0.12/0.35 TRYING [2]
% 0.12/0.35 % (5394)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.35 TRYING [2,1,1]
% 0.12/0.35 TRYING [2,1,1]
% 0.12/0.35 TRYING [3]
% 0.12/0.35 TRYING [3,1,1]
% 0.12/0.35 TRYING [3,1,1]
% 0.12/0.36 TRYING [1]
% 0.12/0.36 TRYING [2]
% 0.12/0.36 TRYING [3]
% 0.12/0.36 TRYING [4,1,1]
% 0.12/0.36 TRYING [4,1,1]
% 0.12/0.36 TRYING [4]
% 0.12/0.36 TRYING [4]
% 0.12/0.36 TRYING [3,2,1]
% 0.12/0.36 TRYING [3,2,1]
% 0.12/0.36 TRYING [4,2,1]
% 0.12/0.36 TRYING [4,2,1]
% 0.12/0.36 TRYING [5]
% 0.12/0.37 TRYING [5]
% 0.12/0.37 TRYING [3,3,1]
% 0.12/0.37 TRYING [3,3,1]
% 0.12/0.37 TRYING [4,3,1]
% 0.12/0.37 TRYING [4,3,1]
% 0.19/0.37 TRYING [5,1,1]
% 0.19/0.37 TRYING [5,1,1]
% 0.19/0.38 TRYING [5,2,1]
% 0.19/0.38 TRYING [5,2,1]
% 0.19/0.39 TRYING [5,3,1]
% 0.19/0.39 TRYING [5,3,1]
% 0.19/0.40 TRYING [6]
% 0.19/0.40 TRYING [4,4,1]
% 0.19/0.40 TRYING [4,4,1]
% 0.19/0.40 TRYING [6]
% 0.19/0.41 TRYING [5,4,1]
% 0.19/0.41 TRYING [5,4,1]
% 0.19/0.42 % (5399)First to succeed.
% 0.19/0.42 % (5399)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5393"
% 0.19/0.42 % (5399)Refutation found. Thanks to Tanya!
% 0.19/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.42 % (5399)------------------------------
% 0.19/0.42 % (5399)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.42 % (5399)Termination reason: Refutation
% 0.19/0.42
% 0.19/0.42 % (5399)Memory used [KB]: 1942
% 0.19/0.42 % (5399)Time elapsed: 0.069 s
% 0.19/0.42 % (5399)Instructions burned: 142 (million)
% 0.19/0.42 % (5393)Success in time 0.084 s
%------------------------------------------------------------------------------