TSTP Solution File: SET002-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n011.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 : Tue Apr 30 15:03:53 EDT 2024
% Result : Unsatisfiable 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 14 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(subsumption_resolution,[],[f49,f44]) ).
fof(f44,plain,
~ subset(aUa,a),
inference(subsumption_resolution,[],[f42,f14]) ).
fof(f14,axiom,
~ equal_sets(aUa,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_equals_aUa) ).
fof(f42,plain,
( ~ subset(aUa,a)
| equal_sets(aUa,a) ),
inference(resolution,[],[f38,f6]) ).
fof(f6,axiom,
! [X3,X4] :
( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_sets(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsets_are_set_equal_sets) ).
fof(f38,plain,
subset(a,aUa),
inference(resolution,[],[f36,f3]) ).
fof(f3,axiom,
! [X2,X1] :
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsets_axiom2) ).
fof(f36,plain,
member(member_of_1_not_of_2(a,aUa),aUa),
inference(resolution,[],[f34,f17]) ).
fof(f17,plain,
! [X0] :
( ~ member(X0,a)
| member(X0,aUa) ),
inference(resolution,[],[f8,f13]) ).
fof(f13,axiom,
union(a,a,aUa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_union_a_is_aUa) ).
fof(f8,axiom,
! [X3,X0,X4,X5] :
( ~ union(X3,X4,X5)
| member(X0,X5)
| ~ member(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_of_set1_is_member_of_union) ).
fof(f34,plain,
member(member_of_1_not_of_2(a,aUa),a),
inference(subsumption_resolution,[],[f33,f14]) ).
fof(f33,plain,
( member(member_of_1_not_of_2(a,aUa),a)
| equal_sets(aUa,a) ),
inference(duplicate_literal_removal,[],[f30]) ).
fof(f30,plain,
( member(member_of_1_not_of_2(a,aUa),a)
| equal_sets(aUa,a)
| member(member_of_1_not_of_2(a,aUa),a) ),
inference(resolution,[],[f27,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| equal_sets(X0,X1)
| member(member_of_1_not_of_2(X1,X0),X1) ),
inference(resolution,[],[f6,f2]) ).
fof(f2,axiom,
! [X2,X1] :
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsets_axiom1) ).
fof(f27,plain,
( subset(aUa,a)
| member(member_of_1_not_of_2(a,aUa),a) ),
inference(resolution,[],[f25,f3]) ).
fof(f25,plain,
( member(member_of_1_not_of_2(aUa,a),a)
| member(member_of_1_not_of_2(a,aUa),a) ),
inference(resolution,[],[f22,f21]) ).
fof(f21,plain,
! [X0] :
( ~ member(X0,aUa)
| member(X0,a) ),
inference(duplicate_literal_removal,[],[f20]) ).
fof(f20,plain,
! [X0] :
( member(X0,a)
| member(X0,a)
| ~ member(X0,aUa) ),
inference(resolution,[],[f7,f13]) ).
fof(f7,axiom,
! [X3,X0,X4,X5] :
( ~ union(X3,X4,X5)
| member(X0,X4)
| member(X0,X3)
| ~ member(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_of_union_is_member_of_one_set) ).
fof(f22,plain,
( member(member_of_1_not_of_2(aUa,a),aUa)
| member(member_of_1_not_of_2(a,aUa),a) ),
inference(resolution,[],[f19,f14]) ).
fof(f19,plain,
! [X0,X1] :
( equal_sets(X0,X1)
| member(member_of_1_not_of_2(X1,X0),X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
inference(resolution,[],[f16,f2]) ).
fof(f49,plain,
subset(aUa,a),
inference(resolution,[],[f47,f3]) ).
fof(f47,plain,
member(member_of_1_not_of_2(aUa,a),a),
inference(resolution,[],[f46,f21]) ).
fof(f46,plain,
member(member_of_1_not_of_2(aUa,a),aUa),
inference(resolution,[],[f44,f2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n011.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 Apr 30 01:48:16 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % (3194)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34 % (3197)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.11/0.34 % (3201)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.34 % (3198)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.34 % (3195)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34 % (3196)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34 % (3200)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.34 % (3202)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.11/0.34 Detected minimum model sizes of [1,1]
% 0.11/0.34 Detected maximum model sizes of [max,2]
% 0.11/0.34 Detected minimum model sizes of [1,1]
% 0.11/0.34 Detected maximum model sizes of [max,2]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [1,1]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 % (3200)First to succeed.
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [2,1]
% 0.11/0.34 TRYING [1,1]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2,1]
% 0.11/0.34 TRYING [2,2]
% 0.11/0.34 TRYING [2,2]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.35 TRYING [3,2]
% 0.11/0.35 % (3201)Also succeeded, but the first one will report.
% 0.11/0.35 % (3200)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.35 % (3200)------------------------------
% 0.11/0.35 % (3200)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.11/0.35 % (3200)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (3200)Memory used [KB]: 783
% 0.11/0.35 % (3200)Time elapsed: 0.003 s
% 0.11/0.35 % (3200)Instructions burned: 4 (million)
% 0.11/0.35 % (3200)------------------------------
% 0.11/0.35 % (3200)------------------------------
% 0.11/0.35 % (3194)Success in time 0.018 s
%------------------------------------------------------------------------------