TSTP Solution File: SET005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:30 EDT 2022
% Result : Unsatisfiable 6.70s 7.00s
% Output : Refutation 6.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : SET005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.07 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.26 % Computer : n025.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Sun Jul 10 12:46:16 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.44/0.75 ============================== Prover9 ===============================
% 0.44/0.75 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.75 Process 6058 was started by sandbox on n025.cluster.edu,
% 0.44/0.75 Sun Jul 10 12:46:16 2022
% 0.44/0.75 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5890_n025.cluster.edu".
% 0.44/0.75 ============================== end of head ===========================
% 0.44/0.75
% 0.44/0.75 ============================== INPUT =================================
% 0.44/0.75
% 0.44/0.75 % Reading from file /tmp/Prover9_5890_n025.cluster.edu
% 0.44/0.75
% 0.44/0.75 set(prolog_style_variables).
% 0.44/0.75 set(auto2).
% 0.44/0.75 % set(auto2) -> set(auto).
% 0.44/0.75 % set(auto) -> set(auto_inference).
% 0.44/0.75 % set(auto) -> set(auto_setup).
% 0.44/0.75 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.75 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.75 % set(auto) -> set(auto_limits).
% 0.44/0.75 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.75 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.75 % set(auto) -> set(auto_denials).
% 0.44/0.75 % set(auto) -> set(auto_process).
% 0.44/0.75 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.75 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.75 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.75 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.75 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.75 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.75 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.75 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.75 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.75 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.75 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.75 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.75 % set(auto2) -> assign(stats, some).
% 0.44/0.75 % set(auto2) -> clear(echo_input).
% 0.44/0.75 % set(auto2) -> set(quiet).
% 0.44/0.75 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.75 % set(auto2) -> clear(print_given).
% 0.44/0.75 assign(lrs_ticks,-1).
% 0.44/0.75 assign(sos_limit,10000).
% 0.44/0.75 assign(order,kbo).
% 0.44/0.75 set(lex_order_vars).
% 0.44/0.75 clear(print_given).
% 0.44/0.75
% 0.44/0.75 % formulas(sos). % not echoed (16 formulas)
% 0.44/0.75
% 0.44/0.75 ============================== end of input ==========================
% 0.44/0.75
% 0.44/0.75 % From the command line: assign(max_seconds, 300).
% 0.44/0.75
% 0.44/0.75 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.75
% 0.44/0.75 % Formulas that are not ordinary clauses:
% 0.44/0.75
% 0.44/0.75 ============================== end of process non-clausal formulas ===
% 0.44/0.75
% 0.44/0.75 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.75
% 0.44/0.75 ============================== PREDICATE ELIMINATION =================
% 0.44/0.75 1 -intersection(aIb,c,aIbIc) # label(prove_aIb_intersection_c_is_aIbIc) # label(negated_conjecture). [assumption].
% 0.44/0.75 2 intersection(a,b,aIb) # label(a_intersection_b) # label(axiom). [assumption].
% 0.44/0.75 3 intersection(b,c,bIc) # label(b_intersection_c) # label(axiom). [assumption].
% 0.44/0.75 4 intersection(a,bIc,aIbIc) # label(a_intersection_bIc) # label(axiom). [assumption].
% 0.44/0.75 5 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),A) # label(intersection_axiom1) # label(axiom). [assumption].
% 0.44/0.75 6 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),B) # label(intersection_axiom2) # label(axiom). [assumption].
% 0.44/0.75 Derived: member(h(aIb,c,aIbIc),aIbIc) | member(h(aIb,c,aIbIc),aIb). [resolve(1,a,5,b)].
% 0.44/0.75 Derived: member(h(aIb,c,aIbIc),aIbIc) | member(h(aIb,c,aIbIc),c). [resolve(1,a,6,b)].
% 0.44/0.75 7 -intersection(A,B,C) | -member(D,C) | member(D,A) # label(member_of_intersection_is_member_of_set1) # label(axiom). [assumption].
% 0.44/0.75 Derived: -member(A,aIb) | member(A,a). [resolve(7,a,2,a)].
% 0.44/0.75 Derived: -member(A,bIc) | member(A,b). [resolve(7,a,3,a)].
% 0.44/0.75 Derived: -member(A,aIbIc) | member(A,a). [resolve(7,a,4,a)].
% 0.44/0.75 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),C). [resolve(7,a,5,b)].
% 0.44/0.75 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),D). [resolve(7,a,6,b)].
% 0.44/0.75 8 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 0.44/0.75 Derived: -member(A,aIb) | member(A,b). [resolve(8,a,2,a)].
% 0.44/0.75 Derived: -member(A,bIc) | member(A,c). [resolve(8,a,3,a)].
% 0.44/0.75 Derived: -member(A,aIbIc) | member(A,bIc). [resolve(8,a,4,a)].
% 0.44/0.75 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),D). [resolve(8,a,5,b)].
% 0.44/0.75 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),C). [resolve(8,a,6,b)].
% 6.70/7.00 9 -intersection(A,B,C) | -member(D,B) | -member(D,A) | member(D,C) # label(member_of_both_is_member_of_intersection) # label(axiom). [assumption].
% 6.70/7.00 Derived: -member(A,b) | -member(A,a) | member(A,aIb). [resolve(9,a,2,a)].
% 6.70/7.00 Derived: -member(A,c) | -member(A,b) | member(A,bIc). [resolve(9,a,3,a)].
% 6.70/7.00 Derived: -member(A,bIc) | -member(A,a) | member(A,aIbIc). [resolve(9,a,4,a)].
% 6.70/7.00 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),C). [resolve(9,a,5,b)].
% 6.70/7.00 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),B). [resolve(9,a,6,b)].
% 6.70/7.00 10 -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].
% 6.70/7.00 Derived: -member(h(aIb,c,aIbIc),aIbIc) | -member(h(aIb,c,aIbIc),c) | -member(h(aIb,c,aIbIc),aIb). [resolve(10,d,1,a)].
% 6.70/7.00 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(10,d,7,a)].
% 6.70/7.00 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(10,d,8,a)].
% 6.70/7.00 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(10,d,9,a)].
% 6.70/7.00 11 -subset(A,B) | -subset(B,A) | equal_sets(B,A) # label(subsets_are_set_equal_sets) # label(axiom). [assumption].
% 6.70/7.00 12 -equal_sets(A,B) | subset(A,B) # label(set_equal_sets_are_subsets1) # label(axiom). [assumption].
% 6.70/7.00 13 -equal_sets(A,B) | subset(B,A) # label(set_equal_sets_are_subsets2) # label(axiom). [assumption].
% 6.70/7.00 14 -member(A,B) | -subset(B,C) | member(A,C) # label(membership_in_subsets) # label(axiom). [assumption].
% 6.70/7.00 15 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 6.70/7.00 16 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 6.70/7.00 Derived: -member(A,B) | member(A,C) | member(member_of_1_not_of_2(B,C),B). [resolve(14,b,15,a)].
% 6.70/7.00 Derived: -member(A,B) | member(A,C) | -member(member_of_1_not_of_2(B,C),C). [resolve(14,b,16,b)].
% 6.70/7.00
% 6.70/7.00 ============================== end predicate elimination =============
% 6.70/7.00
% 6.70/7.00 Auto_denials: (non-Horn, no changes).
% 6.70/7.00
% 6.70/7.00 Term ordering decisions:
% 6.70/7.00 Function symbol KB weights: aIbIc=1. aIb=1. c=1. bIc=1. a=1. b=1. member_of_1_not_of_2=1. h=1.
% 6.70/7.00
% 6.70/7.00 ============================== end of process initial clauses ========
% 6.70/7.00
% 6.70/7.00 ============================== CLAUSES FOR SEARCH ====================
% 6.70/7.00
% 6.70/7.00 ============================== end of clauses for search =============
% 6.70/7.00
% 6.70/7.00 ============================== SEARCH ================================
% 6.70/7.00
% 6.70/7.00 % Starting search at 0.02 seconds.
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=42.000, iters=3405
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=36.000, iters=3339
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=34.000, iters=3338
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=30.000, iters=3369
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=29.000, iters=3458
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=28.000, iters=3366
% 6.70/7.00
% 6.70/7.00 Low Water (displace): id=4413, wt=48.000
% 6.70/7.00
% 6.70/7.00 Low Water (displace): id=11617, wt=27.000
% 6.70/7.00
% 6.70/7.00 Low Water (displace): id=11658, wt=21.000
% 6.70/7.00
% 6.70/7.00 Low Water (displace): id=11678, wt=20.000
% 6.70/7.00
% 6.70/7.00 Low Water (displace): id=14210, wt=16.000
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=27.000, iters=3353
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=25.000, iters=3337
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=24.000, iters=3350
% 6.70/7.00
% 6.70/7.00 Low Water (displace): id=16943, wt=15.000
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=23.000, iters=3352
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=22.000, iters=3333
% 6.70/7.00
% 6.70/7.00 Low Water (keep): wt=21.000, iters=3333
% 6.70/7.00
% 6.70/7.00 ============================== PROOF =================================
% 6.70/7.00 % SZS status Unsatisfiable
% 6.70/7.00 % SZS output start Refutation
% 6.70/7.00
% 6.70/7.00 % Proof 1 at 6.00 (+ 0.27) seconds.
% 6.70/7.00 % Length of proof is 35.
% 6.70/7.00 % Level of proof is 9.
% 6.70/7.00 % Maximum clause weight is 18.000.
% 6.70/7.00 % Given clauses 3082.
% 6.70/7.00
% 6.70/7.00 1 -intersection(aIb,c,aIbIc) # label(prove_aIb_intersection_c_is_aIbIc) # label(negated_conjecture). [assumption].
% 6.70/7.00 2 intersection(a,b,aIb) # label(a_intersection_b) # label(axiom). [assumption].
% 6.70/7.00 3 intersection(b,c,bIc) # label(b_intersection_c) # label(axiom). [assumption].
% 6.70/7.00 4 intersection(a,bIc,aIbIc) # label(a_intersection_bIc) # label(axiom). [assumption].
% 6.70/7.00 5 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),A) # label(intersection_axiom1) # label(axiom). [assumption].
% 6.70/7.00 6 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),B) # label(intersection_axiom2) # label(axiom). [assumption].
% 6.70/7.00 7 -intersection(A,B,C) | -member(D,C) | member(D,A) # label(member_of_intersection_is_member_of_set1) # label(axiom). [assumption].
% 6.70/7.00 8 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 6.70/7.00 9 -intersection(A,B,C) | -member(D,B) | -member(D,A) | member(D,C) # label(member_of_both_is_member_of_intersection) # label(axiom). [assumption].
% 6.70/7.00 10 -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].
% 6.70/7.00 17 member(h(aIb,c,aIbIc),aIbIc) | member(h(aIb,c,aIbIc),aIb). [resolve(1,a,5,b)].
% 6.70/7.00 18 member(h(aIb,c,aIbIc),aIbIc) | member(h(aIb,c,aIbIc),c). [resolve(1,a,6,b)].
% 6.70/7.00 19 -member(A,aIb) | member(A,a). [resolve(7,a,2,a)].
% 6.70/7.00 20 -member(A,bIc) | member(A,b). [resolve(7,a,3,a)].
% 6.70/7.00 21 -member(A,aIbIc) | member(A,a). [resolve(7,a,4,a)].
% 6.70/7.00 24 -member(A,aIb) | member(A,b). [resolve(8,a,2,a)].
% 6.70/7.00 25 -member(A,bIc) | member(A,c). [resolve(8,a,3,a)].
% 6.70/7.00 26 -member(A,aIbIc) | member(A,bIc). [resolve(8,a,4,a)].
% 6.70/7.00 29 -member(A,b) | -member(A,a) | member(A,aIb). [resolve(9,a,2,a)].
% 6.70/7.00 30 -member(A,c) | -member(A,b) | member(A,bIc). [resolve(9,a,3,a)].
% 6.70/7.00 31 -member(A,bIc) | -member(A,a) | member(A,aIbIc). [resolve(9,a,4,a)].
% 6.70/7.00 34 -member(h(aIb,c,aIbIc),aIbIc) | -member(h(aIb,c,aIbIc),c) | -member(h(aIb,c,aIbIc),aIb). [resolve(10,d,1,a)].
% 6.70/7.00 47 member(h(aIb,c,aIbIc),a) | member(h(aIb,c,aIbIc),aIbIc). [resolve(19,a,17,b)].
% 6.70/7.00 60 member(h(aIb,c,aIbIc),b) | member(h(aIb,c,aIbIc),aIbIc). [resolve(24,a,17,b)].
% 6.70/7.00 150 member(h(aIb,c,aIbIc),aIbIc) | -member(h(aIb,c,aIbIc),bIc). [resolve(47,a,31,b),merge(c)].
% 6.70/7.00 1522 member(h(aIb,c,aIbIc),aIbIc) | -member(h(aIb,c,aIbIc),c) | member(h(aIb,c,aIbIc),bIc). [resolve(60,a,30,b)].
% 6.70/7.00 29564 member(h(aIb,c,aIbIc),aIbIc) | member(h(aIb,c,aIbIc),bIc). [resolve(1522,b,18,b),merge(c)].
% 6.70/7.00 29569 member(h(aIb,c,aIbIc),aIbIc). [resolve(29564,b,150,b),merge(b)].
% 6.70/7.00 29628 -member(h(aIb,c,aIbIc),c) | -member(h(aIb,c,aIbIc),aIb). [back_unit_del(34),unit_del(a,29569)].
% 6.70/7.00 29640 member(h(aIb,c,aIbIc),bIc). [resolve(29569,a,26,a)].
% 6.70/7.00 29643 member(h(aIb,c,aIbIc),a). [resolve(29569,a,21,a)].
% 6.70/7.00 29696 member(h(aIb,c,aIbIc),c). [resolve(29640,a,25,a)].
% 6.70/7.00 29699 member(h(aIb,c,aIbIc),b). [resolve(29640,a,20,a)].
% 6.70/7.00 29700 -member(h(aIb,c,aIbIc),aIb). [back_unit_del(29628),unit_del(a,29696)].
% 6.70/7.00 29982 $F. [ur(29,b,29643,a,c,29700,a),unit_del(a,29699)].
% 6.70/7.00
% 6.70/7.00 % SZS output end Refutation
% 6.70/7.00 ============================== end of proof ==========================
% 6.70/7.00
% 6.70/7.00 ============================== STATISTICS ============================
% 6.70/7.00
% 6.70/7.00 Given=3082. Generated=483723. Kept=29965. proofs=1.
% 6.70/7.00 Usable=577. Sos=4096. Demods=0. Limbo=18, Disabled=25313. Hints=0.
% 6.70/7.00 Megabytes=22.29.
% 6.70/7.00 User_CPU=6.00, System_CPU=0.27, Wall_clock=7.
% 6.70/7.00
% 6.70/7.00 ============================== end of statistics =====================
% 6.70/7.00
% 6.70/7.00 ============================== end of search =========================
% 6.70/7.00
% 6.70/7.00 THEOREM PROVED
% 6.70/7.00 % SZS status Unsatisfiable
% 6.70/7.00
% 6.70/7.00 Exiting with 1 proof.
% 6.70/7.00
% 6.70/7.00 Process 6058 exit (max_proofs) Sun Jul 10 12:46:23 2022
% 6.70/7.00 Prover9 interrupted
%------------------------------------------------------------------------------