TSTP Solution File: REL005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL005-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 : Mon Jul 18 19:53:26 EDT 2022
% Result : Unsatisfiable 2.13s 2.41s
% Output : Refutation 2.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : REL005-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 : 600
% 0.12/0.33 % DateTime : Fri Jul 8 12:58:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.13/2.41 ============================== Prover9 ===============================
% 2.13/2.41 Prover9 (32) version 2009-11A, November 2009.
% 2.13/2.41 Process 32633 was started by sandbox on n024.cluster.edu,
% 2.13/2.41 Fri Jul 8 12:58:59 2022
% 2.13/2.41 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32480_n024.cluster.edu".
% 2.13/2.41 ============================== end of head ===========================
% 2.13/2.41
% 2.13/2.41 ============================== INPUT =================================
% 2.13/2.41
% 2.13/2.41 % Reading from file /tmp/Prover9_32480_n024.cluster.edu
% 2.13/2.41
% 2.13/2.41 set(prolog_style_variables).
% 2.13/2.41 set(auto2).
% 2.13/2.41 % set(auto2) -> set(auto).
% 2.13/2.41 % set(auto) -> set(auto_inference).
% 2.13/2.41 % set(auto) -> set(auto_setup).
% 2.13/2.41 % set(auto_setup) -> set(predicate_elim).
% 2.13/2.41 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.13/2.41 % set(auto) -> set(auto_limits).
% 2.13/2.41 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.13/2.41 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.13/2.41 % set(auto) -> set(auto_denials).
% 2.13/2.41 % set(auto) -> set(auto_process).
% 2.13/2.41 % set(auto2) -> assign(new_constants, 1).
% 2.13/2.41 % set(auto2) -> assign(fold_denial_max, 3).
% 2.13/2.41 % set(auto2) -> assign(max_weight, "200.000").
% 2.13/2.41 % set(auto2) -> assign(max_hours, 1).
% 2.13/2.41 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.13/2.41 % set(auto2) -> assign(max_seconds, 0).
% 2.13/2.41 % set(auto2) -> assign(max_minutes, 5).
% 2.13/2.41 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.13/2.41 % set(auto2) -> set(sort_initial_sos).
% 2.13/2.41 % set(auto2) -> assign(sos_limit, -1).
% 2.13/2.41 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.13/2.41 % set(auto2) -> assign(max_megs, 400).
% 2.13/2.41 % set(auto2) -> assign(stats, some).
% 2.13/2.41 % set(auto2) -> clear(echo_input).
% 2.13/2.41 % set(auto2) -> set(quiet).
% 2.13/2.41 % set(auto2) -> clear(print_initial_clauses).
% 2.13/2.41 % set(auto2) -> clear(print_given).
% 2.13/2.41 assign(lrs_ticks,-1).
% 2.13/2.41 assign(sos_limit,10000).
% 2.13/2.41 assign(order,kbo).
% 2.13/2.41 set(lex_order_vars).
% 2.13/2.41 clear(print_given).
% 2.13/2.41
% 2.13/2.41 % formulas(sos). % not echoed (14 formulas)
% 2.13/2.41
% 2.13/2.41 ============================== end of input ==========================
% 2.13/2.41
% 2.13/2.41 % From the command line: assign(max_seconds, 300).
% 2.13/2.41
% 2.13/2.41 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.13/2.41
% 2.13/2.41 % Formulas that are not ordinary clauses:
% 2.13/2.41
% 2.13/2.41 ============================== end of process non-clausal formulas ===
% 2.13/2.41
% 2.13/2.41 ============================== PROCESS INITIAL CLAUSES ===============
% 2.13/2.41
% 2.13/2.41 ============================== PREDICATE ELIMINATION =================
% 2.13/2.41
% 2.13/2.41 ============================== end predicate elimination =============
% 2.13/2.41
% 2.13/2.41 Auto_denials:
% 2.13/2.41 % copying label goals_14 to answer in negative clause
% 2.13/2.41
% 2.13/2.41 Term ordering decisions:
% 2.13/2.41 Function symbol KB weights: one=1. top=1. zero=1. sk1=1. sk2=1. join=1. composition=1. meet=1. complement=1. converse=1.
% 2.13/2.41
% 2.13/2.41 ============================== end of process initial clauses ========
% 2.13/2.41
% 2.13/2.41 ============================== CLAUSES FOR SEARCH ====================
% 2.13/2.41
% 2.13/2.41 ============================== end of clauses for search =============
% 2.13/2.41
% 2.13/2.41 ============================== SEARCH ================================
% 2.13/2.41
% 2.13/2.41 % Starting search at 0.01 seconds.
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=38.000, iters=3354
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=35.000, iters=3378
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=32.000, iters=3358
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=31.000, iters=3407
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=30.000, iters=3370
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=29.000, iters=3336
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=28.000, iters=3339
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=27.000, iters=3406
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=26.000, iters=3336
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=25.000, iters=3366
% 2.13/2.41
% 2.13/2.41 Low Water (keep): wt=24.000, iters=3335
% 2.13/2.41
% 2.13/2.41 ============================== PROOF =================================
% 2.13/2.41 % SZS status Unsatisfiable
% 2.13/2.41 % SZS output start Refutation
% 2.13/2.41
% 2.13/2.41 % Proof 1 at 1.40 (+ 0.05) seconds: goals_14.
% 2.13/2.41 % Length of proof is 72.
% 2.13/2.41 % Level of proof is 26.
% 2.13/2.41 % Maximum clause weight is 16.000.
% 2.13/2.41 % Given clauses 519.
% 2.13/2.41
% 2.13/2.41 1 composition(A,one) = A # label(composition_identity_6) # label(axiom). [assumption].
% 2.13/2.41 2 converse(converse(A)) = A # label(converse_idempotence_8) # label(axiom). [assumption].
% 2.13/2.41 3 top = join(A,complement(A)) # label(def_top_12) # label(axiom). [assumption].
% 2.13/2.41 4 join(A,complement(A)) = top. [copy(3),flip(a)].
% 2.13/2.41 5 zero = meet(A,complement(A)) # label(def_zero_13) # label(axiom). [assumption].
% 2.13/2.41 6 meet(A,complement(A)) = zero. [copy(5),flip(a)].
% 2.13/2.41 7 join(A,B) = join(B,A) # label(maddux1_join_commutativity_1) # label(axiom). [assumption].
% 2.13/2.41 8 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet_4) # label(axiom). [assumption].
% 2.13/2.41 9 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity_9) # label(axiom). [assumption].
% 2.13/2.41 10 join(converse(A),converse(B)) = converse(join(A,B)). [copy(9),flip(a)].
% 2.13/2.41 11 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity_10) # label(axiom). [assumption].
% 2.13/2.41 12 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(11),flip(a)].
% 2.13/2.41 13 join(A,join(B,C)) = join(join(A,B),C) # label(maddux2_join_associativity_2) # label(axiom). [assumption].
% 2.13/2.41 14 join(A,join(B,C)) = join(C,join(A,B)). [copy(13),rewrite([7(4)])].
% 2.13/2.41 15 composition(A,composition(B,C)) = composition(composition(A,B),C) # label(composition_associativity_5) # label(axiom). [assumption].
% 2.13/2.41 16 composition(composition(A,B),C) = composition(A,composition(B,C)). [copy(15),flip(a)].
% 2.13/2.41 19 join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B) # label(converse_cancellativity_11) # label(axiom). [assumption].
% 2.13/2.41 20 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(19),rewrite([7(6)])].
% 2.13/2.41 21 A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) # label(maddux3_a_kind_of_de_Morgan_3) # label(axiom). [assumption].
% 2.13/2.41 22 join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))) = B. [copy(21),rewrite([7(6),7(8)]),flip(a),rewrite([7(6)])].
% 2.13/2.41 23 converse(meet(sk1,sk2)) != meet(converse(sk1),converse(sk2)) # label(goals_14) # label(negated_conjecture) # answer(goals_14). [assumption].
% 2.13/2.41 24 complement(join(complement(converse(sk1)),complement(converse(sk2)))) != converse(complement(join(complement(sk1),complement(sk2)))) # answer(goals_14). [copy(23),rewrite([8(3),8(12)]),flip(a)].
% 2.13/2.41 25 complement(top) = zero. [back_rewrite(6),rewrite([8(2),4(4)])].
% 2.13/2.41 28 converse(composition(converse(A),B)) = composition(converse(B),A). [para(2(a,1),12(a,1,2)),flip(a)].
% 2.13/2.41 29 join(A,join(B,complement(A))) = join(B,top). [para(4(a,1),14(a,2,2)),rewrite([7(2)])].
% 2.13/2.41 30 composition(A,composition(one,B)) = composition(A,B). [para(1(a,1),16(a,1,1)),flip(a)].
% 2.13/2.41 36 join(complement(one),composition(converse(A),complement(A))) = complement(one). [para(1(a,1),20(a,1,2,2,1))].
% 2.13/2.41 41 join(zero,complement(join(complement(A),complement(A)))) = A. [para(4(a,1),22(a,1,1,1)),rewrite([25(2)])].
% 2.13/2.41 49 join(complement(join(top,complement(A))),complement(join(zero,complement(A)))) = A. [para(25(a,1),22(a,1,2,1,1))].
% 2.13/2.41 62 composition(converse(one),A) = A. [para(1(a,1),28(a,1,1)),rewrite([2(2)]),flip(a)].
% 2.13/2.41 68 converse(one) = one. [para(62(a,1),1(a,1)),flip(a)].
% 2.13/2.41 72 join(complement(A),complement(composition(one,A))) = complement(A). [para(62(a,1),20(a,1,2))].
% 2.13/2.41 73 composition(one,A) = A. [para(62(a,1),30(a,2)),rewrite([68(2),30(4)])].
% 2.13/2.41 74 join(complement(A),complement(A)) = complement(A). [back_rewrite(72),rewrite([73(3)])].
% 2.13/2.41 75 join(zero,complement(complement(A))) = A. [back_rewrite(41),rewrite([74(4)])].
% 2.13/2.41 76 converse(join(A,one)) = join(one,converse(A)). [para(68(a,1),10(a,1,1)),rewrite([7(5)]),flip(a)].
% 2.13/2.41 80 join(top,complement(A)) = top. [para(74(a,1),29(a,1,2)),rewrite([4(2),7(4)]),flip(a)].
% 2.13/2.41 81 join(zero,complement(join(zero,complement(A)))) = A. [back_rewrite(49),rewrite([80(3),25(2)])].
% 2.13/2.41 82 join(top,top) = join(A,top). [para(80(a,1),29(a,1,2)),flip(a)].
% 2.13/2.41 87 join(A,top) = join(B,top). [para(82(a,1),29(a,2)),rewrite([80(3)])].
% 2.13/2.41 88 join(A,top) = c_0. [new_symbol(87)].
% 2.13/2.41 91 join(A,join(B,complement(A))) = c_0. [back_rewrite(29),rewrite([88(5)])].
% 2.13/2.41 102 c_0 = top. [para(75(a,1),91(a,1,2)),rewrite([7(2),4(2)]),flip(a)].
% 2.13/2.41 103 join(A,join(B,complement(A))) = top. [back_rewrite(91),rewrite([102(4)])].
% 2.13/2.41 130 join(zero,complement(A)) = complement(A). [para(75(a,1),81(a,1,2,1))].
% 2.13/2.41 131 complement(complement(A)) = A. [back_rewrite(81),rewrite([130(4),130(4)])].
% 2.13/2.41 132 join(A,zero) = A. [back_rewrite(75),rewrite([131(3),7(2)])].
% 2.13/2.41 137 join(complement(join(A,B)),complement(join(B,complement(A)))) = complement(B). [para(131(a,1),22(a,1,1,1,2)),rewrite([131(5),7(4)])].
% 2.13/2.41 139 join(A,A) = A. [para(131(a,1),74(a,1,1)),rewrite([131(2),131(3)])].
% 2.13/2.41 143 join(A,join(A,B)) = join(A,B). [para(139(a,1),14(a,1)),rewrite([7(3),14(4,R),7(3),14(3,R),139(2)]),flip(a)].
% 2.13/2.41 144 join(A,complement(join(B,complement(A)))) = A. [para(22(a,1),143(a,1,2)),rewrite([7(4),22(12)])].
% 2.13/2.41 146 join(A,join(B,complement(join(C,complement(A))))) = join(A,B). [para(144(a,1),14(a,2,2)),rewrite([7(4),7(6)])].
% 2.13/2.41 149 join(complement(A),complement(join(A,B))) = complement(A). [para(131(a,1),144(a,1,2,1,2)),rewrite([7(2)])].
% 2.13/2.41 157 join(complement(one),composition(converse(complement(A)),A)) = complement(one). [para(131(a,1),36(a,1,2,2))].
% 2.13/2.41 160 join(complement(converse(A)),complement(converse(join(A,B)))) = complement(converse(A)). [para(10(a,1),149(a,1,2,1))].
% 2.13/2.41 211 join(complement(one),converse(complement(one))) = complement(one). [para(1(a,1),157(a,1,2))].
% 2.13/2.41 215 converse(complement(one)) = complement(one). [para(211(a,1),10(a,2,1)),rewrite([2(7),7(6),211(6)]),flip(a)].
% 2.13/2.41 220 converse(top) = top. [para(215(a,1),76(a,2,2)),rewrite([7(4),4(4),4(6)])].
% 2.13/2.41 2501 join(A,complement(join(A,B))) = join(A,complement(B)). [para(137(a,1),146(a,1,2)),flip(a)].
% 2.13/2.41 2929 join(complement(converse(A)),converse(join(A,B))) = top. [para(160(a,1),103(a,1,2)),rewrite([7(5)])].
% 2.13/2.41 2955 join(A,join(B,converse(complement(converse(A))))) = top. [para(2929(a,1),10(a,2,1)),rewrite([2(6),14(5),7(4),14(5,R),7(4),220(7)])].
% 2.13/2.41 2986 join(A,converse(complement(converse(A)))) = top. [para(139(a,1),2955(a,1,2))].
% 2.13/2.41 3023 join(A,complement(converse(complement(converse(A))))) = A. [para(2986(a,1),2501(a,1,2,1)),rewrite([25(2),132(2)]),flip(a)].
% 2.13/2.41 3024 join(converse(A),complement(converse(complement(A)))) = converse(A). [para(2(a,1),3023(a,1,2,1,1,1))].
% 2.13/2.41 3027 join(A,converse(complement(converse(complement(A))))) = converse(complement(converse(complement(A)))). [para(3023(a,1),22(a,1,2,1)),rewrite([131(9),7(8),2501(8),131(6)])].
% 2.13/2.41 3146 converse(complement(converse(complement(A)))) = A. [para(3024(a,1),10(a,2,1)),rewrite([2(2),3027(5),2(6)])].
% 2.13/2.41 3169 complement(converse(complement(A))) = converse(A). [para(3146(a,1),2(a,1,1)),flip(a)].
% 2.13/2.41 3238 converse(complement(A)) = complement(converse(A)). [para(3169(a,1),131(a,1,1)),flip(a)].
% 2.13/2.41 3424 complement(join(complement(converse(sk1)),complement(converse(sk2)))) != complement(converse(join(complement(sk1),complement(sk2)))) # answer(goals_14). [back_rewrite(24),rewrite([3238(15)])].
% 2.13/2.41 3425 join(complement(converse(A)),converse(B)) = converse(join(B,complement(A))). [para(3238(a,1),10(a,1,1)),rewrite([7(6)])].
% 2.13/2.41 9548 join(complement(converse(A)),complement(converse(B))) = converse(join(complement(A),complement(B))). [para(3238(a,1),3425(a,1,2)),rewrite([7(8)])].
% 2.13/2.41 9589 $F # answer(goals_14). [back_rewrite(3424),rewrite([9548(7)]),xx(a)].
% 2.13/2.41
% 2.13/2.41 % SZS output end Refutation
% 2.13/2.41 ============================== end of proof ==========================
% 2.13/2.41
% 2.13/2.41 ============================== STATISTICS ============================
% 2.13/2.41
% 2.13/2.41 Given=519. Generated=71041. Kept=9578. proofs=1.
% 2.13/2.41 Usable=414. Sos=7357. Demods=7370. Limbo=41, Disabled=1780. Hints=0.
% 2.13/2.41 Megabytes=11.84.
% 2.13/2.41 User_CPU=1.40, System_CPU=0.05, Wall_clock=2.
% 2.13/2.41
% 2.13/2.41 ============================== end of statistics =====================
% 2.13/2.41
% 2.13/2.41 ============================== end of search =========================
% 2.13/2.41
% 2.13/2.41 THEOREM PROVED
% 2.13/2.41 % SZS status Unsatisfiable
% 2.13/2.41
% 2.13/2.41 Exiting with 1 proof.
% 2.13/2.41
% 2.13/2.41 Process 32633 exit (max_proofs) Fri Jul 8 12:59:01 2022
% 2.13/2.41 Prover9 interrupted
%------------------------------------------------------------------------------