TSTP Solution File: SET633+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET633+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n006.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 Sep 20 05:07:26 EDT 2022
% Result : Theorem 0.11s 0.36s
% Output : Proof 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET633+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Sat Sep 3 07:00:54 EDT 2022
% 0.11/0.34 % CPUTime :
% 0.11/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.34 Usage: tptp [options] [-file:]file
% 0.11/0.34 -h, -? prints this message.
% 0.11/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.11/0.34 -m, -model generate model.
% 0.11/0.34 -p, -proof generate proof.
% 0.11/0.34 -c, -core generate unsat core of named formulas.
% 0.11/0.34 -st, -statistics display statistics.
% 0.11/0.34 -t:timeout set timeout (in second).
% 0.11/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.11/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.34 -<param>:<value> configuration parameter and value.
% 0.11/0.34 -o:<output-file> file to place output in.
% 0.11/0.36 % SZS status Theorem
% 0.11/0.36 % SZS output start Proof
% 0.11/0.36 tff(subset_type, type, (
% 0.11/0.36 subset: ( $i * $i ) > $o)).
% 0.11/0.36 tff(tptp_fun_D_2_type, type, (
% 0.11/0.36 tptp_fun_D_2: $i)).
% 0.11/0.36 tff(union_type, type, (
% 0.11/0.36 union: ( $i * $i ) > $i)).
% 0.11/0.36 tff(difference_type, type, (
% 0.11/0.36 difference: ( $i * $i ) > $i)).
% 0.11/0.36 tff(tptp_fun_C_3_type, type, (
% 0.11/0.36 tptp_fun_C_3: $i)).
% 0.11/0.36 tff(tptp_fun_B_4_type, type, (
% 0.11/0.36 tptp_fun_B_4: $i)).
% 0.11/0.36 tff(symmetric_difference_type, type, (
% 0.11/0.36 symmetric_difference: ( $i * $i ) > $i)).
% 0.11/0.36 tff(1,plain,
% 0.11/0.36 (^[B: $i, C: $i] : refl((symmetric_difference(B, C) = symmetric_difference(C, B)) <=> (symmetric_difference(B, C) = symmetric_difference(C, B)))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(2,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B)) <=> ![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[1])).
% 0.11/0.36 tff(3,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B)) <=> ![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(4,axiom,(![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','commutativity_of_symmetric_difference')).
% 0.11/0.36 tff(5,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.11/0.36 tff(6,plain,(
% 0.11/0.36 ![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))),
% 0.11/0.36 inference(skolemize,[status(sab)],[5])).
% 0.11/0.36 tff(7,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.11/0.36 tff(8,plain,
% 0.11/0.36 ((~![B: $i, C: $i] : (symmetric_difference(B, C) = symmetric_difference(C, B))) | (symmetric_difference(C!3, B!4) = symmetric_difference(B!4, C!3))),
% 0.11/0.36 inference(quant_inst,[status(thm)],[])).
% 0.11/0.36 tff(9,plain,
% 0.11/0.36 (symmetric_difference(C!3, B!4) = symmetric_difference(B!4, C!3)),
% 0.11/0.36 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.11/0.36 tff(10,plain,
% 0.11/0.36 (^[B: $i, C: $i] : refl((symmetric_difference(B, C) = union(difference(B, C), difference(C, B))) <=> (symmetric_difference(B, C) = union(difference(B, C), difference(C, B))))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(11,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B))) <=> ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[10])).
% 0.11/0.36 tff(12,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B))) <=> ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(13,axiom,(![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','symmetric_difference_defn')).
% 0.11/0.36 tff(14,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.11/0.36 tff(15,plain,(
% 0.11/0.36 ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.36 inference(skolemize,[status(sab)],[14])).
% 0.11/0.36 tff(16,plain,
% 0.11/0.36 (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[15, 11])).
% 0.11/0.36 tff(17,plain,
% 0.11/0.36 ((~![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))) | (symmetric_difference(C!3, B!4) = union(difference(C!3, B!4), difference(B!4, C!3)))),
% 0.11/0.36 inference(quant_inst,[status(thm)],[])).
% 0.11/0.36 tff(18,plain,
% 0.11/0.36 (symmetric_difference(C!3, B!4) = union(difference(C!3, B!4), difference(B!4, C!3))),
% 0.11/0.36 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.11/0.36 tff(19,plain,
% 0.11/0.36 (union(difference(C!3, B!4), difference(B!4, C!3)) = symmetric_difference(C!3, B!4)),
% 0.11/0.36 inference(symmetry,[status(thm)],[18])).
% 0.11/0.36 tff(20,plain,
% 0.11/0.36 (union(difference(C!3, B!4), difference(B!4, C!3)) = symmetric_difference(B!4, C!3)),
% 0.11/0.36 inference(transitivity,[status(thm)],[19, 9])).
% 0.11/0.36 tff(21,plain,
% 0.11/0.36 (subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2) <=> subset(symmetric_difference(B!4, C!3), D!2)),
% 0.11/0.36 inference(monotonicity,[status(thm)],[20])).
% 0.11/0.36 tff(22,plain,
% 0.11/0.36 (subset(symmetric_difference(B!4, C!3), D!2) <=> subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2)),
% 0.11/0.36 inference(symmetry,[status(thm)],[21])).
% 0.11/0.36 tff(23,plain,
% 0.11/0.36 ((~subset(symmetric_difference(B!4, C!3), D!2)) <=> (~subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2))),
% 0.11/0.36 inference(monotonicity,[status(thm)],[22])).
% 0.11/0.36 tff(24,plain,
% 0.11/0.36 ((~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))) <=> (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D)))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(25,plain,
% 0.11/0.36 ((~![B: $i, C: $i, D: $i] : ((subset(difference(B, C), D) & subset(difference(C, B), D)) => subset(symmetric_difference(B, C), D))) <=> (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D)))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(26,axiom,(~![B: $i, C: $i, D: $i] : ((subset(difference(B, C), D) & subset(difference(C, B), D)) => subset(symmetric_difference(B, C), D))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_th115')).
% 0.11/0.36 tff(27,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.11/0.36 tff(28,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[27, 24])).
% 0.11/0.36 tff(29,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[28, 24])).
% 0.11/0.36 tff(30,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[29, 24])).
% 0.11/0.36 tff(31,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[30, 24])).
% 0.11/0.36 tff(32,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[31, 24])).
% 0.11/0.36 tff(33,plain,
% 0.11/0.36 (~![B: $i, C: $i, D: $i] : ((~(subset(difference(B, C), D) & subset(difference(C, B), D))) | subset(symmetric_difference(B, C), D))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[32, 24])).
% 0.11/0.36 tff(34,plain,(
% 0.11/0.36 ~((~(subset(difference(B!4, C!3), D!2) & subset(difference(C!3, B!4), D!2))) | subset(symmetric_difference(B!4, C!3), D!2))),
% 0.11/0.36 inference(skolemize,[status(sab)],[33])).
% 0.11/0.36 tff(35,plain,
% 0.11/0.36 (~subset(symmetric_difference(B!4, C!3), D!2)),
% 0.11/0.36 inference(or_elim,[status(thm)],[34])).
% 0.11/0.36 tff(36,plain,
% 0.11/0.36 (~subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2)),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[35, 23])).
% 0.11/0.36 tff(37,plain,
% 0.11/0.36 (subset(difference(B!4, C!3), D!2) & subset(difference(C!3, B!4), D!2)),
% 0.11/0.36 inference(or_elim,[status(thm)],[34])).
% 0.11/0.36 tff(38,plain,
% 0.11/0.36 (subset(difference(C!3, B!4), D!2)),
% 0.11/0.36 inference(and_elim,[status(thm)],[37])).
% 0.11/0.36 tff(39,plain,
% 0.11/0.36 (subset(difference(B!4, C!3), D!2)),
% 0.11/0.36 inference(and_elim,[status(thm)],[37])).
% 0.11/0.36 tff(40,plain,
% 0.11/0.36 (^[B: $i, C: $i, D: $i] : refl((subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C))) <=> (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C))))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(41,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C))) <=> ![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[40])).
% 0.11/0.36 tff(42,plain,
% 0.11/0.36 (^[B: $i, C: $i, D: $i] : trans(monotonicity(trans(monotonicity(rewrite((subset(B, C) & subset(D, C)) <=> (~((~subset(B, C)) | (~subset(D, C))))), ((~(subset(B, C) & subset(D, C))) <=> (~(~((~subset(B, C)) | (~subset(D, C))))))), rewrite((~(~((~subset(B, C)) | (~subset(D, C))))) <=> ((~subset(B, C)) | (~subset(D, C)))), ((~(subset(B, C) & subset(D, C))) <=> ((~subset(B, C)) | (~subset(D, C))))), (((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C)) <=> (((~subset(B, C)) | (~subset(D, C))) | subset(union(B, D), C)))), rewrite((((~subset(B, C)) | (~subset(D, C))) | subset(union(B, D), C)) <=> (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))), (((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C)) <=> (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(43,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C)) <=> ![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[42])).
% 0.11/0.36 tff(44,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C)) <=> ![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(45,plain,
% 0.11/0.36 (^[B: $i, C: $i, D: $i] : rewrite(((subset(B, C) & subset(D, C)) => subset(union(B, D), C)) <=> ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C)))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(46,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : ((subset(B, C) & subset(D, C)) => subset(union(B, D), C)) <=> ![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[45])).
% 0.11/0.36 tff(47,axiom,(![B: $i, C: $i, D: $i] : ((subset(B, C) & subset(D, C)) => subset(union(B, D), C))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','union_subset')).
% 0.11/0.36 tff(48,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[47, 46])).
% 0.11/0.36 tff(49,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[48, 44])).
% 0.11/0.36 tff(50,plain,(
% 0.11/0.36 ![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(D, C))) | subset(union(B, D), C))),
% 0.11/0.36 inference(skolemize,[status(sab)],[49])).
% 0.11/0.36 tff(51,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[50, 43])).
% 0.11/0.36 tff(52,plain,
% 0.11/0.36 (![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))),
% 0.11/0.36 inference(modus_ponens,[status(thm)],[51, 41])).
% 0.11/0.36 tff(53,plain,
% 0.11/0.36 (((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | ((~subset(difference(B!4, C!3), D!2)) | (~subset(difference(C!3, B!4), D!2)) | subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2))) <=> ((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | (~subset(difference(B!4, C!3), D!2)) | (~subset(difference(C!3, B!4), D!2)) | subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(54,plain,
% 0.11/0.36 ((subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2) | (~subset(difference(C!3, B!4), D!2)) | (~subset(difference(B!4, C!3), D!2))) <=> ((~subset(difference(B!4, C!3), D!2)) | (~subset(difference(C!3, B!4), D!2)) | subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2))),
% 0.11/0.36 inference(rewrite,[status(thm)],[])).
% 0.11/0.36 tff(55,plain,
% 0.11/0.36 (((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | (subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2) | (~subset(difference(C!3, B!4), D!2)) | (~subset(difference(B!4, C!3), D!2)))) <=> ((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | ((~subset(difference(B!4, C!3), D!2)) | (~subset(difference(C!3, B!4), D!2)) | subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2)))),
% 0.11/0.37 inference(monotonicity,[status(thm)],[54])).
% 0.11/0.37 tff(56,plain,
% 0.11/0.37 (((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | (subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2) | (~subset(difference(C!3, B!4), D!2)) | (~subset(difference(B!4, C!3), D!2)))) <=> ((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | (~subset(difference(B!4, C!3), D!2)) | (~subset(difference(C!3, B!4), D!2)) | subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2))),
% 0.11/0.37 inference(transitivity,[status(thm)],[55, 53])).
% 0.11/0.37 tff(57,plain,
% 0.11/0.37 ((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | (subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2) | (~subset(difference(C!3, B!4), D!2)) | (~subset(difference(B!4, C!3), D!2)))),
% 0.11/0.37 inference(quant_inst,[status(thm)],[])).
% 0.11/0.37 tff(58,plain,
% 0.11/0.37 ((~![B: $i, C: $i, D: $i] : (subset(union(B, D), C) | (~subset(B, C)) | (~subset(D, C)))) | (~subset(difference(B!4, C!3), D!2)) | (~subset(difference(C!3, B!4), D!2)) | subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2)),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[57, 56])).
% 0.11/0.37 tff(59,plain,
% 0.11/0.37 (subset(union(difference(C!3, B!4), difference(B!4, C!3)), D!2)),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[58, 52, 39, 38])).
% 0.11/0.37 tff(60,plain,
% 0.11/0.37 ($false),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[59, 36])).
% 0.11/0.37 % SZS output end Proof
%------------------------------------------------------------------------------