TSTP Solution File: REL009-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL009-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:33 EDT 2022
% Result : Unsatisfiable 0.82s 1.10s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL009-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n029.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 09:42:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.82/1.10 ============================== Prover9 ===============================
% 0.82/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.10 Process 22461 was started by sandbox2 on n029.cluster.edu,
% 0.82/1.10 Fri Jul 8 09:42:30 2022
% 0.82/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22308_n029.cluster.edu".
% 0.82/1.10 ============================== end of head ===========================
% 0.82/1.10
% 0.82/1.10 ============================== INPUT =================================
% 0.82/1.10
% 0.82/1.10 % Reading from file /tmp/Prover9_22308_n029.cluster.edu
% 0.82/1.10
% 0.82/1.10 set(prolog_style_variables).
% 0.82/1.10 set(auto2).
% 0.82/1.10 % set(auto2) -> set(auto).
% 0.82/1.10 % set(auto) -> set(auto_inference).
% 0.82/1.10 % set(auto) -> set(auto_setup).
% 0.82/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.10 % set(auto) -> set(auto_limits).
% 0.82/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.10 % set(auto) -> set(auto_denials).
% 0.82/1.10 % set(auto) -> set(auto_process).
% 0.82/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.10 % set(auto2) -> assign(stats, some).
% 0.82/1.10 % set(auto2) -> clear(echo_input).
% 0.82/1.10 % set(auto2) -> set(quiet).
% 0.82/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.10 % set(auto2) -> clear(print_given).
% 0.82/1.10 assign(lrs_ticks,-1).
% 0.82/1.10 assign(sos_limit,10000).
% 0.82/1.10 assign(order,kbo).
% 0.82/1.10 set(lex_order_vars).
% 0.82/1.10 clear(print_given).
% 0.82/1.10
% 0.82/1.10 % formulas(sos). % not echoed (15 formulas)
% 0.82/1.10
% 0.82/1.10 ============================== end of input ==========================
% 0.82/1.10
% 0.82/1.10 % From the command line: assign(max_seconds, 300).
% 0.82/1.10
% 0.82/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.10
% 0.82/1.10 % Formulas that are not ordinary clauses:
% 0.82/1.10
% 0.82/1.10 ============================== end of process non-clausal formulas ===
% 0.82/1.10
% 0.82/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.10
% 0.82/1.10 ============================== PREDICATE ELIMINATION =================
% 0.82/1.10
% 0.82/1.10 ============================== end predicate elimination =============
% 0.82/1.10
% 0.82/1.10 Auto_denials:
% 0.82/1.10 % copying label goals_15 to answer in negative clause
% 0.82/1.10
% 0.82/1.10 Term ordering decisions:
% 0.82/1.10 Function symbol KB weights: sk2=1. one=1. sk1=1. top=1. zero=1. sk3=1. join=1. composition=1. meet=1. complement=1. converse=1.
% 0.82/1.10
% 0.82/1.10 ============================== end of process initial clauses ========
% 0.82/1.10
% 0.82/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.10
% 0.82/1.10 ============================== end of clauses for search =============
% 0.82/1.10
% 0.82/1.10 ============================== SEARCH ================================
% 0.82/1.10
% 0.82/1.10 % Starting search at 0.01 seconds.
% 0.82/1.10
% 0.82/1.10 ============================== PROOF =================================
% 0.82/1.10 % SZS status Unsatisfiable
% 0.82/1.10 % SZS output start Refutation
% 0.82/1.10
% 0.82/1.10 % Proof 1 at 0.14 (+ 0.01) seconds: goals_15.
% 0.82/1.10 % Length of proof is 18.
% 0.82/1.10 % Level of proof is 5.
% 0.82/1.10 % Maximum clause weight is 20.000.
% 0.82/1.10 % Given clauses 126.
% 0.82/1.10
% 0.82/1.10 2 converse(converse(A)) = A # label(converse_idempotence_8) # label(axiom). [assumption].
% 0.82/1.10 3 join(sk1,sk2) = sk2 # label(goals_14) # label(negated_conjecture). [assumption].
% 0.82/1.10 8 join(A,B) = join(B,A) # label(maddux1_join_commutativity_1) # label(axiom). [assumption].
% 0.82/1.10 10 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity_9) # label(axiom). [assumption].
% 0.82/1.10 11 join(converse(A),converse(B)) = converse(join(A,B)). [copy(10),flip(a)].
% 0.82/1.10 12 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity_10) # label(axiom). [assumption].
% 0.82/1.10 13 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(12),flip(a)].
% 0.82/1.10 18 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity_7) # label(axiom). [assumption].
% 0.82/1.10 19 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(18),flip(a)].
% 0.82/1.10 24 join(composition(sk1,sk3),composition(sk2,sk3)) != composition(sk2,sk3) | join(composition(sk3,sk1),composition(sk3,sk2)) != composition(sk3,sk2) # label(goals_15) # label(negated_conjecture) # answer(goals_15). [assumption].
% 0.82/1.10 25 composition(join(sk2,sk1),sk3) != composition(sk2,sk3) | join(composition(sk3,sk2),composition(sk3,sk1)) != composition(sk3,sk2) # answer(goals_15). [copy(24),rewrite([8(7),19(7),8(16)])].
% 0.82/1.10 26 join(sk2,sk1) = sk2. [back_rewrite(3),rewrite([8(3)])].
% 0.82/1.10 28 join(composition(sk3,sk2),composition(sk3,sk1)) != composition(sk3,sk2) # answer(goals_15). [back_rewrite(25),rewrite([26(3)]),xx(a)].
% 0.82/1.10 31 converse(composition(converse(A),B)) = composition(converse(B),A). [para(2(a,1),13(a,1,2)),flip(a)].
% 0.82/1.10 35 join(converse(composition(A,B)),composition(C,converse(A))) = composition(join(C,converse(B)),converse(A)). [para(13(a,1),19(a,1,1)),rewrite([8(7)])].
% 0.82/1.10 66 converse(join(A,composition(converse(B),C))) = join(composition(converse(C),B),converse(A)). [para(31(a,1),11(a,1,1)),rewrite([8(7)]),flip(a)].
% 0.82/1.11 659 join(composition(A,B),composition(A,C)) = composition(A,join(B,C)). [para(35(a,1),66(a,1,1)),rewrite([11(3),13(4),2(4),2(4),2(6)]),flip(a)].
% 0.82/1.11 691 $F # answer(goals_15). [back_rewrite(28),rewrite([659(7),26(4)]),xx(a)].
% 0.82/1.11
% 0.82/1.11 % SZS output end Refutation
% 0.82/1.11 ============================== end of proof ==========================
% 0.82/1.11
% 0.82/1.11 ============================== STATISTICS ============================
% 0.82/1.11
% 0.82/1.11 Given=126. Generated=4220. Kept=680. proofs=1.
% 0.82/1.11 Usable=99. Sos=401. Demods=515. Limbo=32, Disabled=163. Hints=0.
% 0.82/1.11 Megabytes=0.88.
% 0.82/1.11 User_CPU=0.14, System_CPU=0.01, Wall_clock=0.
% 0.82/1.11
% 0.82/1.11 ============================== end of statistics =====================
% 0.82/1.11
% 0.82/1.11 ============================== end of search =========================
% 0.82/1.11
% 0.82/1.11 THEOREM PROVED
% 0.82/1.11 % SZS status Unsatisfiable
% 0.82/1.11
% 0.82/1.11 Exiting with 1 proof.
% 0.82/1.11
% 0.82/1.11 Process 22461 exit (max_proofs) Fri Jul 8 09:42:30 2022
% 0.82/1.11 Prover9 interrupted
%------------------------------------------------------------------------------