TSTP Solution File: REL024-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL024-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:54 EDT 2022
% Result : Unsatisfiable 0.86s 1.15s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : REL024-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 13:12:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.86/1.15 ============================== Prover9 ===============================
% 0.86/1.15 Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.15 Process 12557 was started by sandbox on n023.cluster.edu,
% 0.86/1.15 Fri Jul 8 13:12:41 2022
% 0.86/1.15 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12404_n023.cluster.edu".
% 0.86/1.15 ============================== end of head ===========================
% 0.86/1.15
% 0.86/1.15 ============================== INPUT =================================
% 0.86/1.15
% 0.86/1.15 % Reading from file /tmp/Prover9_12404_n023.cluster.edu
% 0.86/1.15
% 0.86/1.15 set(prolog_style_variables).
% 0.86/1.15 set(auto2).
% 0.86/1.15 % set(auto2) -> set(auto).
% 0.86/1.15 % set(auto) -> set(auto_inference).
% 0.86/1.15 % set(auto) -> set(auto_setup).
% 0.86/1.15 % set(auto_setup) -> set(predicate_elim).
% 0.86/1.15 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.15 % set(auto) -> set(auto_limits).
% 0.86/1.15 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.15 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.15 % set(auto) -> set(auto_denials).
% 0.86/1.15 % set(auto) -> set(auto_process).
% 0.86/1.15 % set(auto2) -> assign(new_constants, 1).
% 0.86/1.15 % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.15 % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.15 % set(auto2) -> assign(max_hours, 1).
% 0.86/1.15 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.15 % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.15 % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.15 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.15 % set(auto2) -> set(sort_initial_sos).
% 0.86/1.15 % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.15 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.15 % set(auto2) -> assign(max_megs, 400).
% 0.86/1.15 % set(auto2) -> assign(stats, some).
% 0.86/1.15 % set(auto2) -> clear(echo_input).
% 0.86/1.15 % set(auto2) -> set(quiet).
% 0.86/1.15 % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.15 % set(auto2) -> clear(print_given).
% 0.86/1.15 assign(lrs_ticks,-1).
% 0.86/1.15 assign(sos_limit,10000).
% 0.86/1.15 assign(order,kbo).
% 0.86/1.15 set(lex_order_vars).
% 0.86/1.15 clear(print_given).
% 0.86/1.15
% 0.86/1.15 % formulas(sos). % not echoed (14 formulas)
% 0.86/1.15
% 0.86/1.15 ============================== end of input ==========================
% 0.86/1.15
% 0.86/1.15 % From the command line: assign(max_seconds, 300).
% 0.86/1.15
% 0.86/1.15 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.15
% 0.86/1.15 % Formulas that are not ordinary clauses:
% 0.86/1.15
% 0.86/1.15 ============================== end of process non-clausal formulas ===
% 0.86/1.15
% 0.86/1.15 ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.15
% 0.86/1.15 ============================== PREDICATE ELIMINATION =================
% 0.86/1.15
% 0.86/1.15 ============================== end predicate elimination =============
% 0.86/1.15
% 0.86/1.15 Auto_denials:
% 0.86/1.15 % copying label goals_14 to answer in negative clause
% 0.86/1.15
% 0.86/1.15 Term ordering decisions:
% 0.86/1.15 Function symbol KB weights: one=1. top=1. zero=1. sk1=1. sk2=1. sk3=1. join=1. composition=1. meet=1. complement=1. converse=1.
% 0.86/1.15
% 0.86/1.15 ============================== end of process initial clauses ========
% 0.86/1.15
% 0.86/1.15 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.15
% 0.86/1.15 ============================== end of clauses for search =============
% 0.86/1.15
% 0.86/1.15 ============================== SEARCH ================================
% 0.86/1.15
% 0.86/1.15 % Starting search at 0.01 seconds.
% 0.86/1.15
% 0.86/1.15 ============================== PROOF =================================
% 0.86/1.15 % SZS status Unsatisfiable
% 0.86/1.15 % SZS output start Refutation
% 0.86/1.15
% 0.86/1.15 % Proof 1 at 0.14 (+ 0.00) seconds: goals_14.
% 0.86/1.15 % Length of proof is 47.
% 0.86/1.15 % Level of proof is 14.
% 0.86/1.15 % Maximum clause weight is 34.000.
% 0.86/1.15 % Given clauses 125.
% 0.86/1.15
% 0.86/1.15 1 composition(A,one) = A # label(composition_identity_6) # label(axiom). [assumption].
% 0.86/1.15 2 converse(converse(A)) = A # label(converse_idempotence_8) # label(axiom). [assumption].
% 0.86/1.15 3 top = join(A,complement(A)) # label(def_top_12) # label(axiom). [assumption].
% 0.86/1.15 4 join(A,complement(A)) = top. [copy(3),flip(a)].
% 0.86/1.15 5 zero = meet(A,complement(A)) # label(def_zero_13) # label(axiom). [assumption].
% 0.86/1.15 6 meet(A,complement(A)) = zero. [copy(5),flip(a)].
% 0.86/1.15 7 join(A,B) = join(B,A) # label(maddux1_join_commutativity_1) # label(axiom). [assumption].
% 0.86/1.15 8 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet_4) # label(axiom). [assumption].
% 0.86/1.15 9 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity_9) # label(axiom). [assumption].
% 0.86/1.15 10 join(converse(A),converse(B)) = converse(join(A,B)). [copy(9),flip(a)].
% 0.86/1.15 11 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity_10) # label(axiom). [assumption].
% 0.86/1.15 12 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(11),flip(a)].
% 0.86/1.15 13 join(A,join(B,C)) = join(join(A,B),C) # label(maddux2_join_associativity_2) # label(axiom). [assumption].
% 0.86/1.15 14 join(A,join(B,C)) = join(C,join(A,B)). [copy(13),rewrite([7(4)])].
% 0.86/1.15 15 composition(A,composition(B,C)) = composition(composition(A,B),C) # label(composition_associativity_5) # label(axiom). [assumption].
% 0.86/1.15 16 composition(composition(A,B),C) = composition(A,composition(B,C)). [copy(15),flip(a)].
% 0.86/1.15 17 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity_7) # label(axiom). [assumption].
% 0.86/1.15 18 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(17),flip(a)].
% 0.86/1.15 19 join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B) # label(converse_cancellativity_11) # label(axiom). [assumption].
% 0.86/1.15 20 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(19),rewrite([7(6)])].
% 0.86/1.15 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.86/1.15 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.86/1.15 23 join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),sk3)) != composition(meet(sk1,converse(sk2)),sk3) # label(goals_14) # label(negated_conjecture) # answer(goals_14). [assumption].
% 0.86/1.15 24 join(composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),composition(complement(join(complement(sk1),complement(converse(sk2)))),complement(join(complement(sk2),complement(sk3))))) != composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3) # answer(goals_14). [copy(23),rewrite([8(4),8(10),8(18),7(24),8(28)])].
% 0.86/1.15 25 complement(top) = zero. [back_rewrite(6),rewrite([8(2),4(4)])].
% 0.86/1.15 28 converse(composition(converse(A),B)) = composition(converse(B),A). [para(2(a,1),12(a,1,2)),flip(a)].
% 0.86/1.15 29 join(A,join(B,complement(A))) = join(B,top). [para(4(a,1),14(a,2,2)),rewrite([7(2)])].
% 0.86/1.15 30 composition(A,composition(one,B)) = composition(A,B). [para(1(a,1),16(a,1,1)),flip(a)].
% 0.86/1.15 32 join(converse(composition(A,B)),composition(C,converse(A))) = composition(join(C,converse(B)),converse(A)). [para(12(a,1),18(a,1,1)),rewrite([7(7)])].
% 0.86/1.15 41 join(zero,complement(join(complement(A),complement(A)))) = A. [para(4(a,1),22(a,1,1,1)),rewrite([25(2)])].
% 0.86/1.15 49 join(complement(join(top,complement(A))),complement(join(zero,complement(A)))) = A. [para(25(a,1),22(a,1,2,1,1))].
% 0.86/1.15 62 composition(converse(one),A) = A. [para(1(a,1),28(a,1,1)),rewrite([2(2)]),flip(a)].
% 0.86/1.15 63 converse(join(A,composition(converse(B),C))) = join(composition(converse(C),B),converse(A)). [para(28(a,1),10(a,1,1)),rewrite([7(7)]),flip(a)].
% 0.86/1.15 68 converse(one) = one. [para(62(a,1),1(a,1)),flip(a)].
% 0.86/1.15 72 join(complement(A),complement(composition(one,A))) = complement(A). [para(62(a,1),20(a,1,2))].
% 0.86/1.15 73 composition(one,A) = A. [para(62(a,1),30(a,2)),rewrite([68(2),30(4)])].
% 0.86/1.15 74 join(complement(A),complement(A)) = complement(A). [back_rewrite(72),rewrite([73(3)])].
% 0.86/1.15 75 join(zero,complement(complement(A))) = A. [back_rewrite(41),rewrite([74(4)])].
% 0.86/1.15 80 join(top,complement(A)) = top. [para(74(a,1),29(a,1,2)),rewrite([4(2),7(4)]),flip(a)].
% 0.86/1.15 81 join(zero,complement(join(zero,complement(A)))) = A. [back_rewrite(49),rewrite([80(3),25(2)])].
% 0.86/1.15 130 join(zero,complement(A)) = complement(A). [para(75(a,1),81(a,1,2,1))].
% 0.86/1.15 131 complement(complement(A)) = A. [back_rewrite(81),rewrite([130(4),130(4)])].
% 0.86/1.15 139 join(A,A) = A. [para(131(a,1),74(a,1,1)),rewrite([131(2),131(3)])].
% 0.86/1.15 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)].
% 0.86/1.15 144 join(A,complement(join(B,complement(A)))) = A. [para(22(a,1),143(a,1,2)),rewrite([7(4),22(12)])].
% 0.86/1.15 665 join(composition(A,B),composition(A,C)) = composition(A,join(B,C)). [para(32(a,1),63(a,1,1)),rewrite([10(3),12(4),2(4),2(4),2(6)]),flip(a)].
% 0.86/1.15 697 $F # answer(goals_14). [back_rewrite(24),rewrite([665(24),144(15)]),xx(a)].
% 0.86/1.15
% 0.86/1.15 % SZS output end Refutation
% 0.86/1.15 ============================== end of proof ==========================
% 0.86/1.15
% 0.86/1.15 ============================== STATISTICS ============================
% 0.86/1.15
% 0.86/1.15 Given=125. Generated=4387. Kept=686. proofs=1.
% 0.86/1.15 Usable=98. Sos=409. Demods=522. Limbo=32, Disabled=161. Hints=0.
% 0.86/1.15 Megabytes=0.87.
% 0.86/1.15 User_CPU=0.14, System_CPU=0.00, Wall_clock=1.
% 0.86/1.15
% 0.86/1.15 ============================== end of statistics =====================
% 0.86/1.15
% 0.86/1.15 ============================== end of search =========================
% 0.86/1.15
% 0.86/1.15 THEOREM PROVED
% 0.86/1.15 % SZS status Unsatisfiable
% 0.86/1.15
% 0.86/1.15 Exiting with 1 proof.
% 0.86/1.15
% 0.86/1.15 Process 12557 exit (max_proofs) Fri Jul 8 13:12:42 2022
% 0.86/1.15 Prover9 interrupted
%------------------------------------------------------------------------------