TSTP Solution File: REL023-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL023-2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:53 EDT 2022
% Result : Unsatisfiable 0.70s 1.07s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL023-2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.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:20:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.07 ============================== Prover9 ===============================
% 0.70/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.07 Process 21348 was started by sandbox2 on n021.cluster.edu,
% 0.70/1.07 Fri Jul 8 12:20:36 2022
% 0.70/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21194_n021.cluster.edu".
% 0.70/1.07 ============================== end of head ===========================
% 0.70/1.07
% 0.70/1.07 ============================== INPUT =================================
% 0.70/1.07
% 0.70/1.07 % Reading from file /tmp/Prover9_21194_n021.cluster.edu
% 0.70/1.07
% 0.70/1.07 set(prolog_style_variables).
% 0.70/1.07 set(auto2).
% 0.70/1.07 % set(auto2) -> set(auto).
% 0.70/1.07 % set(auto) -> set(auto_inference).
% 0.70/1.07 % set(auto) -> set(auto_setup).
% 0.70/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.07 % set(auto) -> set(auto_limits).
% 0.70/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.07 % set(auto) -> set(auto_denials).
% 0.70/1.07 % set(auto) -> set(auto_process).
% 0.70/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.07 % set(auto2) -> assign(stats, some).
% 0.70/1.07 % set(auto2) -> clear(echo_input).
% 0.70/1.07 % set(auto2) -> set(quiet).
% 0.70/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.07 % set(auto2) -> clear(print_given).
% 0.70/1.07 assign(lrs_ticks,-1).
% 0.70/1.07 assign(sos_limit,10000).
% 0.70/1.07 assign(order,kbo).
% 0.70/1.07 set(lex_order_vars).
% 0.70/1.07 clear(print_given).
% 0.70/1.07
% 0.70/1.07 % formulas(sos). % not echoed (17 formulas)
% 0.70/1.07
% 0.70/1.07 ============================== end of input ==========================
% 0.70/1.07
% 0.70/1.07 % From the command line: assign(max_seconds, 300).
% 0.70/1.07
% 0.70/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.07
% 0.70/1.07 % Formulas that are not ordinary clauses:
% 0.70/1.07
% 0.70/1.07 ============================== end of process non-clausal formulas ===
% 0.70/1.07
% 0.70/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.07
% 0.70/1.07 ============================== PREDICATE ELIMINATION =================
% 0.70/1.07
% 0.70/1.07 ============================== end predicate elimination =============
% 0.70/1.07
% 0.70/1.07 Auto_denials:
% 0.70/1.07 % copying label goals_17 to answer in negative clause
% 0.70/1.07
% 0.70/1.07 Term ordering decisions:
% 0.70/1.07 Function symbol KB weights: one=1. top=1. zero=1. sk1=1. sk2=1. sk3=1. composition=1. join=1. meet=1. converse=1. complement=1.
% 0.70/1.07
% 0.70/1.07 ============================== end of process initial clauses ========
% 0.70/1.07
% 0.70/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.07
% 0.70/1.07 ============================== end of clauses for search =============
% 0.70/1.07
% 0.70/1.07 ============================== SEARCH ================================
% 0.70/1.07
% 0.70/1.07 % Starting search at 0.01 seconds.
% 0.70/1.07
% 0.70/1.07 ============================== PROOF =================================
% 0.70/1.07 % SZS status Unsatisfiable
% 0.70/1.07 % SZS output start Refutation
% 0.70/1.07
% 0.70/1.07 % Proof 1 at 0.10 (+ 0.00) seconds: goals_17.
% 0.70/1.07 % Length of proof is 48.
% 0.70/1.07 % Level of proof is 16.
% 0.70/1.07 % Maximum clause weight is 42.000.
% 0.70/1.07 % Given clauses 73.
% 0.70/1.07
% 0.70/1.07 1 composition(A,one) = A # label(composition_identity_6) # label(axiom). [assumption].
% 0.70/1.07 2 converse(converse(A)) = A # label(converse_idempotence_8) # label(axiom). [assumption].
% 0.70/1.07 3 top = join(A,complement(A)) # label(def_top_12) # label(axiom). [assumption].
% 0.70/1.07 4 join(A,complement(A)) = top. [copy(3),flip(a)].
% 0.70/1.07 5 zero = meet(A,complement(A)) # label(def_zero_13) # label(axiom). [assumption].
% 0.70/1.07 6 meet(A,complement(A)) = zero. [copy(5),flip(a)].
% 0.70/1.07 7 join(A,B) = join(B,A) # label(maddux1_join_commutativity_1) # label(axiom). [assumption].
% 0.70/1.07 8 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet_4) # label(axiom). [assumption].
% 0.70/1.07 11 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity_10) # label(axiom). [assumption].
% 0.70/1.07 12 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(11),flip(a)].
% 0.70/1.07 13 join(A,join(B,C)) = join(join(A,B),C) # label(maddux2_join_associativity_2) # label(axiom). [assumption].
% 0.70/1.07 14 join(A,join(B,C)) = join(C,join(A,B)). [copy(13),rewrite([7(4)])].
% 0.70/1.07 15 composition(A,composition(B,C)) = composition(composition(A,B),C) # label(composition_associativity_5) # label(axiom). [assumption].
% 0.70/1.07 16 composition(composition(A,B),C) = composition(A,composition(B,C)). [copy(15),flip(a)].
% 0.70/1.07 17 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity_7) # label(axiom). [assumption].
% 0.70/1.07 18 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(17),flip(a)].
% 0.70/1.07 19 join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B) # label(converse_cancellativity_11) # label(axiom). [assumption].
% 0.70/1.07 20 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(19),rewrite([7(6)])].
% 0.70/1.07 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].
% 0.70/1.07 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)])].
% 0.70/1.07 23 join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C) # label(modular_law_1_15) # label(axiom). [assumption].
% 0.70/1.07 24 join(complement(join(complement(A),complement(composition(B,C)))),complement(join(complement(A),complement(composition(B,complement(join(complement(C),complement(composition(converse(B),A))))))))) = complement(join(complement(A),complement(composition(B,complement(join(complement(C),complement(composition(converse(B),A)))))))). [copy(23),rewrite([8(2),7(4),8(8),8(13),7(15),8(20),8(25),7(27)])].
% 0.70/1.07 29 join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)) # label(goals_17) # label(negated_conjecture) # answer(goals_17). [assumption].
% 0.70/1.07 30 composition(join(sk1,complement(join(complement(sk1),complement(converse(sk2))))),complement(join(complement(sk2),complement(sk3)))) != composition(sk1,complement(join(complement(sk2),complement(sk3)))) # answer(goals_17). [copy(29),rewrite([8(4),8(10),8(18),7(23),18(23),8(20)])].
% 0.70/1.07 31 complement(top) = zero. [back_rewrite(6),rewrite([8(2),4(4)])].
% 0.70/1.07 34 converse(composition(converse(A),B)) = composition(converse(B),A). [para(2(a,1),12(a,1,2)),flip(a)].
% 0.70/1.07 35 join(A,join(B,complement(A))) = join(B,top). [para(4(a,1),14(a,2,2)),rewrite([7(2)])].
% 0.70/1.07 36 composition(A,composition(one,B)) = composition(A,B). [para(1(a,1),16(a,1,1)),flip(a)].
% 0.70/1.07 47 join(zero,complement(join(complement(A),complement(A)))) = A. [para(4(a,1),22(a,1,1,1)),rewrite([31(2)])].
% 0.70/1.07 48 join(zero,complement(join(A,complement(complement(A))))) = complement(A). [para(4(a,1),22(a,1,2,1)),rewrite([31(6),7(6)])].
% 0.70/1.07 51 join(complement(A),complement(join(join(B,complement(A)),complement(join(complement(B),complement(A)))))) = join(complement(B),complement(A)). [para(22(a,1),22(a,1,2,1)),rewrite([7(10)])].
% 0.70/1.07 112 composition(converse(one),A) = A. [para(1(a,1),34(a,1,1)),rewrite([2(2)]),flip(a)].
% 0.70/1.07 121 join(top,complement(join(A,complement(B)))) = join(top,complement(A)). [para(22(a,1),35(a,1,2)),rewrite([7(4),35(4),7(3),7(8)]),flip(a)].
% 0.70/1.07 122 join(top,complement(complement(A))) = top. [para(24(a,1),35(a,1,2)),rewrite([4(22),7(8),121(8)]),flip(a)].
% 0.70/1.07 123 converse(one) = one. [para(112(a,1),1(a,1)),flip(a)].
% 0.70/1.07 127 join(complement(A),complement(composition(one,A))) = complement(A). [para(112(a,1),20(a,1,2))].
% 0.70/1.07 141 composition(one,A) = A. [para(112(a,1),36(a,2)),rewrite([123(2),36(4)])].
% 0.70/1.07 147 join(complement(A),complement(A)) = complement(A). [back_rewrite(127),rewrite([141(3)])].
% 0.70/1.07 148 join(zero,complement(complement(A))) = A. [back_rewrite(47),rewrite([147(4)])].
% 0.70/1.07 150 join(zero,complement(A)) = complement(A). [para(122(a,1),22(a,1,1,1)),rewrite([31(2),31(3),148(5)])].
% 0.70/1.07 153 complement(complement(A)) = A. [back_rewrite(148),rewrite([150(4)])].
% 0.70/1.07 163 complement(join(A,A)) = complement(A). [back_rewrite(48),rewrite([153(3),150(4)])].
% 0.70/1.07 204 join(A,A) = A. [para(163(a,1),22(a,1,1,1,2)),rewrite([163(6),22(8)]),flip(a)].
% 0.70/1.07 211 join(A,join(A,B)) = join(A,B). [para(204(a,1),14(a,1)),rewrite([7(3),14(4,R),7(3),14(3,R),204(2)]),flip(a)].
% 0.70/1.07 229 join(A,complement(join(B,complement(A)))) = A. [para(22(a,1),211(a,1,2)),rewrite([7(4),22(12)])].
% 0.70/1.07 234 join(complement(A),complement(join(A,B))) = complement(A). [para(153(a,1),229(a,1,2,1,2)),rewrite([7(2)])].
% 0.70/1.07 435 join(A,complement(join(complement(A),complement(B)))) = A. [para(51(a,1),234(a,1,2,1)),rewrite([153(2),7(3),153(7)])].
% 0.70/1.07 452 $F # answer(goals_17). [back_rewrite(30),rewrite([435(9)]),xx(a)].
% 0.70/1.07
% 0.70/1.07 % SZS output end Refutation
% 0.70/1.07 ============================== end of proof ==========================
% 0.70/1.07
% 0.70/1.07 ============================== STATISTICS ============================
% 0.70/1.07
% 0.70/1.07 Given=73. Generated=1912. Kept=438. proofs=1.
% 0.70/1.07 Usable=60. Sos=246. Demods=310. Limbo=17, Disabled=132. Hints=0.
% 0.70/1.07 Megabytes=0.75.
% 0.70/1.07 User_CPU=0.10, System_CPU=0.00, Wall_clock=0.
% 0.70/1.07
% 0.70/1.07 ============================== end of statistics =====================
% 0.70/1.07
% 0.70/1.07 ============================== end of search =========================
% 0.70/1.07
% 0.70/1.07 THEOREM PROVED
% 0.70/1.07 % SZS status Unsatisfiable
% 0.70/1.07
% 0.70/1.07 Exiting with 1 proof.
% 0.70/1.07
% 0.70/1.07 Process 21348 exit (max_proofs) Fri Jul 8 12:20:36 2022
% 0.70/1.07 Prover9 interrupted
%------------------------------------------------------------------------------