TSTP Solution File: SET007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : 600s
% DateTime : Tue Jul 19 04:25:31 EDT 2022
% Result : Unsatisfiable 110.25s 110.52s
% Output : Refutation 110.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 00:39:13 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.44/1.06 ============================== Prover9 ===============================
% 0.44/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.06 Process 14547 was started by sandbox on n020.cluster.edu,
% 0.44/1.06 Sun Jul 10 00:39:14 2022
% 0.44/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14386_n020.cluster.edu".
% 0.44/1.06 ============================== end of head ===========================
% 0.44/1.06
% 0.44/1.06 ============================== INPUT =================================
% 0.44/1.06
% 0.44/1.06 % Reading from file /tmp/Prover9_14386_n020.cluster.edu
% 0.44/1.06
% 0.44/1.06 set(prolog_style_variables).
% 0.44/1.06 set(auto2).
% 0.44/1.06 % set(auto2) -> set(auto).
% 0.44/1.06 % set(auto) -> set(auto_inference).
% 0.44/1.06 % set(auto) -> set(auto_setup).
% 0.44/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.06 % set(auto) -> set(auto_limits).
% 0.44/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.06 % set(auto) -> set(auto_denials).
% 0.44/1.06 % set(auto) -> set(auto_process).
% 0.44/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.06 % set(auto2) -> assign(stats, some).
% 0.44/1.06 % set(auto2) -> clear(echo_input).
% 0.44/1.06 % set(auto2) -> set(quiet).
% 0.44/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.06 % set(auto2) -> clear(print_given).
% 0.44/1.06 assign(lrs_ticks,-1).
% 0.44/1.06 assign(sos_limit,10000).
% 0.44/1.06 assign(order,kbo).
% 0.44/1.06 set(lex_order_vars).
% 0.44/1.06 clear(print_given).
% 0.44/1.06
% 0.44/1.06 % formulas(sos). % not echoed (23 formulas)
% 0.44/1.06
% 0.44/1.06 ============================== end of input ==========================
% 0.44/1.06
% 0.44/1.06 % From the command line: assign(max_seconds, 300).
% 0.44/1.06
% 0.44/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.06
% 0.44/1.06 % Formulas that are not ordinary clauses:
% 0.44/1.06
% 0.44/1.06 ============================== end of process non-clausal formulas ===
% 0.44/1.06
% 0.44/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.06
% 0.44/1.06 ============================== PREDICATE ELIMINATION =================
% 0.44/1.06 1 -union(aIb,aIc,aI_bUc) # label(prove_aIb_union_aIc_is_aI_bUc) # label(negated_conjecture). [assumption].
% 0.44/1.06 2 union(b,c,bUc) # label(b_union_c) # label(axiom). [assumption].
% 0.44/1.06 3 union(A,B,C) | member(g(A,B,C),A) | member(g(A,B,C),B) | member(g(A,B,C),C) # label(union_axiom1) # label(axiom). [assumption].
% 0.44/1.06 Derived: member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aIc) | member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(1,a,3,a)].
% 0.44/1.06 4 -union(A,B,C) | -member(D,A) | member(D,C) # label(member_of_set1_is_member_of_union) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,b) | member(A,bUc). [resolve(4,a,2,a)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(g(B,D,C),B) | member(g(B,D,C),D) | member(g(B,D,C),C). [resolve(4,a,3,a)].
% 0.44/1.06 5 -union(A,B,C) | -member(D,B) | member(D,C) # label(member_of_set2_is_member_of_union) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,c) | member(A,bUc). [resolve(5,a,2,a)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(g(D,B,C),D) | member(g(D,B,C),B) | member(g(D,B,C),C). [resolve(5,a,3,a)].
% 0.44/1.06 6 -union(A,B,C) | -member(D,C) | member(D,A) | member(D,B) # label(member_of_union_is_member_of_one_set) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,bUc) | member(A,b) | member(A,c). [resolve(6,a,2,a)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(A,D) | member(g(C,D,B),C) | member(g(C,D,B),D) | member(g(C,D,B),B). [resolve(6,a,3,a)].
% 0.44/1.06 7 -member(g(A,B,C),A) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom2) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(g(aIb,aIc,aI_bUc),aIb) | -member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(7,c,1,a)].
% 0.44/1.06 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,A) | member(D,C). [resolve(7,c,4,a)].
% 0.44/1.06 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,B) | member(D,C). [resolve(7,c,5,a)].
% 0.44/1.06 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,C) | member(D,A) | member(D,B). [resolve(7,c,6,a)].
% 0.44/1.06 8 -member(g(A,B,C),B) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom3) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(g(aIb,aIc,aI_bUc),aIc) | -member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(8,c,1,a)].
% 0.44/1.06 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,A) | member(D,C). [resolve(8,c,4,a)].
% 0.44/1.06 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,B) | member(D,C). [resolve(8,c,5,a)].
% 0.44/1.06 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,C) | member(D,A) | member(D,B). [resolve(8,c,6,a)].
% 0.44/1.06 9 -intersection(A,B,C) | -member(D,C) | member(D,A) # label(member_of_intersection_is_member_of_set1) # label(axiom). [assumption].
% 0.44/1.06 10 intersection(a,b,aIb) # label(a_intersection_b) # label(axiom). [assumption].
% 0.44/1.06 11 intersection(a,c,aIc) # label(a_intersection_c) # label(axiom). [assumption].
% 0.44/1.06 12 intersection(a,bUc,aI_bUc) # label(a_intersection_bUc) # label(axiom). [assumption].
% 0.44/1.06 13 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),A) # label(intersection_axiom1) # label(axiom). [assumption].
% 0.44/1.06 14 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),B) # label(intersection_axiom2) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,aIb) | member(A,a). [resolve(9,a,10,a)].
% 0.44/1.06 Derived: -member(A,aIc) | member(A,a). [resolve(9,a,11,a)].
% 0.44/1.06 Derived: -member(A,aI_bUc) | member(A,a). [resolve(9,a,12,a)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),C). [resolve(9,a,13,b)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),D). [resolve(9,a,14,b)].
% 0.44/1.06 15 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,aIb) | member(A,b). [resolve(15,a,10,a)].
% 0.44/1.06 Derived: -member(A,aIc) | member(A,c). [resolve(15,a,11,a)].
% 0.44/1.06 Derived: -member(A,aI_bUc) | member(A,bUc). [resolve(15,a,12,a)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),D). [resolve(15,a,13,b)].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),C). [resolve(15,a,14,b)].
% 0.44/1.06 16 -intersection(A,B,C) | -member(D,B) | -member(D,A) | member(D,C) # label(member_of_both_is_member_of_intersection) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,b) | -member(A,a) | member(A,aIb). [resolve(16,a,10,a)].
% 0.44/1.06 Derived: -member(A,c) | -member(A,a) | member(A,aIc). [resolve(16,a,11,a)].
% 0.44/1.06 Derived: -member(A,bUc) | -member(A,a) | member(A,aI_bUc). [resolve(16,a,12,a)].
% 0.44/1.06 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),C). [resolve(16,a,13,b)].
% 0.44/1.06 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),B). [resolve(16,a,14,b)].
% 0.44/1.06 17 -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | intersection(A,B,C) # label(intersection_axiom3) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | -member(D,C) | member(D,A). [resolve(17,d,9,a)].
% 0.44/1.06 Derived: -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | -member(D,C) | member(D,B). [resolve(17,d,15,a)].
% 0.44/1.06 Derived: -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | -member(D,B) | -member(D,A) | member(D,C). [resolve(17,d,16,a)].
% 0.44/1.06 18 -subset(A,B) | -subset(B,A) | equal_sets(B,A) # label(subsets_are_set_equal_sets) # label(axiom). [assumption].
% 0.44/1.06 19 -equal_sets(A,B) | subset(A,B) # label(set_equal_sets_are_subsets1) # label(axiom). [assumption].
% 0.44/1.06 20 -equal_sets(A,B) | subset(B,A) # label(set_equal_sets_are_subsets2) # label(axiom). [assumption].
% 0.44/1.06 21 -member(A,B) | -subset(B,C) | member(A,C) # label(membership_in_subsets) # label(axiom). [assumption].
% 0.44/1.06 22 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 0.44/1.06 23 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 0.44/1.06 Derived: -member(A,B) | member(A,C) | member(member_of_1_not_of_2(B,C),B). [resolve(21,b,22,a)].
% 110.25/110.52 Derived: -member(A,B) | member(A,C) | -member(member_of_1_not_of_2(B,C),C). [resolve(21,b,23,b)].
% 110.25/110.52
% 110.25/110.52 ============================== end predicate elimination =============
% 110.25/110.52
% 110.25/110.52 Auto_denials: (non-Horn, no changes).
% 110.25/110.52
% 110.25/110.52 Term ordering decisions:
% 110.25/110.52 Function symbol KB weights: aI_bUc=1. aIb=1. aIc=1. a=1. bUc=1. b=1. c=1. member_of_1_not_of_2=1. g=1. h=1.
% 110.25/110.52
% 110.25/110.52 ============================== end of process initial clauses ========
% 110.25/110.52
% 110.25/110.52 ============================== CLAUSES FOR SEARCH ====================
% 110.25/110.52
% 110.25/110.52 ============================== end of clauses for search =============
% 110.25/110.52
% 110.25/110.52 ============================== SEARCH ================================
% 110.25/110.52
% 110.25/110.52 % Starting search at 0.02 seconds.
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=42.000, iters=3353
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=38.000, iters=3401
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=4865, wt=60.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=11722, wt=33.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=11724, wt=32.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=11728, wt=27.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=11777, wt=22.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=12349, wt=21.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=12731, wt=20.000
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=33.000, iters=3333
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=32.000, iters=3350
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=30.000, iters=3336
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=29.000, iters=3365
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=27.000, iters=3342
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=21128, wt=17.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=21391, wt=16.000
% 110.25/110.52
% 110.25/110.52 Low Water (displace): id=21879, wt=15.000
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=25.000, iters=3333
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=24.000, iters=3385
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=23.000, iters=3336
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=22.000, iters=3341
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=21.000, iters=3335
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=20.000, iters=3333
% 110.25/110.52
% 110.25/110.52 Low Water (keep): wt=17.000, iters=3360
% 110.25/110.52
% 110.25/110.52 ============================== PROOF =================================
% 110.25/110.52 % SZS status Unsatisfiable
% 110.25/110.52 % SZS output start Refutation
% 110.25/110.52
% 110.25/110.52 % Proof 1 at 101.20 (+ 8.26) seconds.
% 110.25/110.52 % Length of proof is 47.
% 110.25/110.52 % Level of proof is 12.
% 110.25/110.52 % Maximum clause weight is 18.000.
% 110.25/110.52 % Given clauses 32503.
% 110.25/110.52
% 110.25/110.52 1 -union(aIb,aIc,aI_bUc) # label(prove_aIb_union_aIc_is_aI_bUc) # label(negated_conjecture). [assumption].
% 110.25/110.52 2 union(b,c,bUc) # label(b_union_c) # label(axiom). [assumption].
% 110.25/110.52 3 union(A,B,C) | member(g(A,B,C),A) | member(g(A,B,C),B) | member(g(A,B,C),C) # label(union_axiom1) # label(axiom). [assumption].
% 110.25/110.52 4 -union(A,B,C) | -member(D,A) | member(D,C) # label(member_of_set1_is_member_of_union) # label(axiom). [assumption].
% 110.25/110.52 5 -union(A,B,C) | -member(D,B) | member(D,C) # label(member_of_set2_is_member_of_union) # label(axiom). [assumption].
% 110.25/110.52 6 -union(A,B,C) | -member(D,C) | member(D,A) | member(D,B) # label(member_of_union_is_member_of_one_set) # label(axiom). [assumption].
% 110.25/110.52 7 -member(g(A,B,C),A) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom2) # label(axiom). [assumption].
% 110.25/110.52 8 -member(g(A,B,C),B) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom3) # label(axiom). [assumption].
% 110.25/110.52 9 -intersection(A,B,C) | -member(D,C) | member(D,A) # label(member_of_intersection_is_member_of_set1) # label(axiom). [assumption].
% 110.25/110.52 10 intersection(a,b,aIb) # label(a_intersection_b) # label(axiom). [assumption].
% 110.25/110.52 11 intersection(a,c,aIc) # label(a_intersection_c) # label(axiom). [assumption].
% 110.25/110.52 12 intersection(a,bUc,aI_bUc) # label(a_intersection_bUc) # label(axiom). [assumption].
% 110.25/110.52 15 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 110.25/110.52 16 -intersection(A,B,C) | -member(D,B) | -member(D,A) | member(D,C) # label(member_of_both_is_member_of_intersection) # label(axiom). [assumption].
% 110.25/110.52 24 member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aIc) | member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(1,a,3,a)].
% 110.25/110.52 25 -member(A,b) | member(A,bUc). [resolve(4,a,2,a)].
% 110.25/110.52 27 -member(A,c) | member(A,bUc). [resolve(5,a,2,a)].
% 110.25/110.52 29 -member(A,bUc) | member(A,b) | member(A,c). [resolve(6,a,2,a)].
% 110.25/110.52 31 -member(g(aIb,aIc,aI_bUc),aIb) | -member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(7,c,1,a)].
% 110.25/110.52 35 -member(g(aIb,aIc,aI_bUc),aIc) | -member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(8,c,1,a)].
% 110.25/110.52 39 -member(A,aIb) | member(A,a). [resolve(9,a,10,a)].
% 110.25/110.52 40 -member(A,aIc) | member(A,a). [resolve(9,a,11,a)].
% 110.25/110.52 41 -member(A,aI_bUc) | member(A,a). [resolve(9,a,12,a)].
% 110.25/110.52 44 -member(A,aIb) | member(A,b). [resolve(15,a,10,a)].
% 110.25/110.52 45 -member(A,aIc) | member(A,c). [resolve(15,a,11,a)].
% 110.25/110.52 46 -member(A,aI_bUc) | member(A,bUc). [resolve(15,a,12,a)].
% 110.25/110.52 49 -member(A,b) | -member(A,a) | member(A,aIb). [resolve(16,a,10,a)].
% 110.25/110.52 50 -member(A,c) | -member(A,a) | member(A,aIc). [resolve(16,a,11,a)].
% 110.25/110.52 51 -member(A,bUc) | -member(A,a) | member(A,aI_bUc). [resolve(16,a,12,a)].
% 110.25/110.52 133 member(g(aIb,aIc,aI_bUc),a) | member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(40,a,24,b)].
% 110.25/110.52 143 member(g(aIb,aIc,aI_bUc),c) | member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(45,a,24,b)].
% 110.25/110.52 17657 member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aI_bUc) | member(g(aIb,aIc,aI_bUc),bUc). [resolve(143,a,27,a)].
% 110.25/110.52 52517 member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aI_bUc) | -member(g(aIb,aIc,aI_bUc),a). [resolve(17657,c,51,a),merge(d)].
% 110.25/110.52 81585 member(g(aIb,aIc,aI_bUc),aIb) | member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(52517,c,133,a),merge(c),merge(d)].
% 110.25/110.52 81592 member(g(aIb,aIc,aI_bUc),aI_bUc) | member(g(aIb,aIc,aI_bUc),b). [resolve(81585,a,44,a)].
% 110.25/110.52 81593 member(g(aIb,aIc,aI_bUc),aI_bUc) | member(g(aIb,aIc,aI_bUc),a). [resolve(81585,a,39,a)].
% 110.25/110.52 81633 member(g(aIb,aIc,aI_bUc),aI_bUc) | member(g(aIb,aIc,aI_bUc),bUc). [resolve(81592,b,25,a)].
% 110.25/110.52 81765 member(g(aIb,aIc,aI_bUc),aI_bUc) | -member(g(aIb,aIc,aI_bUc),a). [resolve(81633,b,51,a),merge(c)].
% 110.25/110.52 81865 member(g(aIb,aIc,aI_bUc),aI_bUc). [resolve(81765,b,81593,b),merge(b)].
% 110.25/110.52 81866 -member(g(aIb,aIc,aI_bUc),aIc). [back_unit_del(35),unit_del(b,81865)].
% 110.25/110.52 81867 -member(g(aIb,aIc,aI_bUc),aIb). [back_unit_del(31),unit_del(b,81865)].
% 110.25/110.52 82160 member(g(aIb,aIc,aI_bUc),bUc). [resolve(81865,a,46,a)].
% 110.25/110.52 82163 member(g(aIb,aIc,aI_bUc),a). [resolve(81865,a,41,a)].
% 110.25/110.52 85960 member(g(aIb,aIc,aI_bUc),b) | member(g(aIb,aIc,aI_bUc),c). [resolve(82160,a,29,a)].
% 110.25/110.52 85967 -member(g(aIb,aIc,aI_bUc),c). [ur(50,b,82163,a,c,81866,a)].
% 110.25/110.52 85968 -member(g(aIb,aIc,aI_bUc),b). [ur(49,b,82163,a,c,81867,a)].
% 110.25/110.52 85969 $F. [back_unit_del(85960),unit_del(a,85968),unit_del(b,85967)].
% 110.25/110.52
% 110.25/110.52 % SZS output end Refutation
% 110.25/110.52 ============================== end of proof ==========================
% 110.25/110.52
% 110.25/110.52 ============================== STATISTICS ============================
% 110.25/110.52
% 110.25/110.52 Given=32503. Generated=16179085. Kept=85945. proofs=1.
% 110.25/110.52 Usable=1980. Sos=3474. Demods=0. Limbo=2, Disabled=80547. Hints=0.
% 110.25/110.52 Megabytes=59.31.
% 110.25/110.52 User_CPU=101.20, System_CPU=8.26, Wall_clock=109.
% 110.25/110.52
% 110.25/110.52 ============================== end of statistics =====================
% 110.25/110.52
% 110.25/110.52 ============================== end of search =========================
% 110.25/110.52
% 110.25/110.52 THEOREM PROVED
% 110.25/110.52 % SZS status Unsatisfiable
% 110.25/110.52
% 110.25/110.52 Exiting with 1 proof.
% 110.25/110.52
% 110.25/110.52 Process 14547 exit (max_proofs) Sun Jul 10 00:41:03 2022
% 110.25/110.52 Prover9 interrupted
%------------------------------------------------------------------------------