TSTP Solution File: REL049+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:54:32 EDT 2022
% Result : Theorem 0.75s 1.01s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 15:42:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.01 ============================== Prover9 ===============================
% 0.75/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.01 Process 10292 was started by sandbox on n018.cluster.edu,
% 0.75/1.01 Fri Jul 8 15:42:11 2022
% 0.75/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10139_n018.cluster.edu".
% 0.75/1.01 ============================== end of head ===========================
% 0.75/1.01
% 0.75/1.01 ============================== INPUT =================================
% 0.75/1.01
% 0.75/1.01 % Reading from file /tmp/Prover9_10139_n018.cluster.edu
% 0.75/1.01
% 0.75/1.01 set(prolog_style_variables).
% 0.75/1.01 set(auto2).
% 0.75/1.01 % set(auto2) -> set(auto).
% 0.75/1.01 % set(auto) -> set(auto_inference).
% 0.75/1.01 % set(auto) -> set(auto_setup).
% 0.75/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.01 % set(auto) -> set(auto_limits).
% 0.75/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.01 % set(auto) -> set(auto_denials).
% 0.75/1.01 % set(auto) -> set(auto_process).
% 0.75/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.01 % set(auto2) -> assign(stats, some).
% 0.75/1.01 % set(auto2) -> clear(echo_input).
% 0.75/1.01 % set(auto2) -> set(quiet).
% 0.75/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.01 % set(auto2) -> clear(print_given).
% 0.75/1.01 assign(lrs_ticks,-1).
% 0.75/1.01 assign(sos_limit,10000).
% 0.75/1.01 assign(order,kbo).
% 0.75/1.01 set(lex_order_vars).
% 0.75/1.01 clear(print_given).
% 0.75/1.01
% 0.75/1.01 % formulas(sos). % not echoed (14 formulas)
% 0.75/1.01
% 0.75/1.01 ============================== end of input ==========================
% 0.75/1.01
% 0.75/1.01 % From the command line: assign(max_seconds, 300).
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.01
% 0.75/1.01 % Formulas that are not ordinary clauses:
% 0.75/1.01 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 2 (all X0 all X1 all X2 join(X0,join(X1,X2)) = join(join(X0,X1),X2)) # label(maddux2_join_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 3 (all X0 all X1 X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))) # label(maddux3_a_kind_of_de_Morgan) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 4 (all X0 all X1 meet(X0,X1) = complement(join(complement(X0),complement(X1)))) # label(maddux4_definiton_of_meet) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 5 (all X0 all X1 all X2 composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2)) # label(composition_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 7 (all X0 all X1 all X2 composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2))) # label(composition_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 11 (all X0 all X1 join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1)) # label(converse_cancellativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 14 -(all X0 all X1 all X2 (join(X0,X1) = X1 & join(X2,X1) = X1 -> join(join(X0,X2),X1) = X1)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.01
% 0.75/1.01 ============================== end of process non-clausal formulas ===
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01
% 0.75/1.01 ============================== PREDICATE ELIMINATION =================
% 0.75/1.01
% 0.75/1.01 ============================== end predicate elimination =============
% 0.75/1.01
% 0.75/1.01 Auto_denials:
% 0.75/1.01 % copying label goals to answer in negative clause
% 0.75/1.01
% 0.75/1.01 Term ordering decisions:
% 0.75/1.01 Function symbol KB weights: one=1. top=1. zero=1. c1=1. c2=1. c3=1. join=1. composition=1. meet=1. complement=1. converse=1.
% 0.75/1.01
% 0.75/1.01 ============================== PROOF =================================
% 0.75/1.01 % SZS status Theorem
% 0.75/1.01 % SZS output start Refutation
% 0.75/1.01
% 0.75/1.01 % Proof 1 at 0.01 (+ 0.00) seconds: goals.
% 0.75/1.01 % Length of proof is 12.
% 0.75/1.01 % Level of proof is 4.
% 0.75/1.01 % Maximum clause weight is 11.000.
% 0.75/1.01 % Given clauses 0.
% 0.75/1.01
% 0.75/1.01 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 2 (all X0 all X1 all X2 join(X0,join(X1,X2)) = join(join(X0,X1),X2)) # label(maddux2_join_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 14 -(all X0 all X1 all X2 (join(X0,X1) = X1 & join(X2,X1) = X1 -> join(join(X0,X2),X1) = X1)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.01 17 join(c1,c2) = c2 # label(goals) # label(negated_conjecture). [clausify(14)].
% 0.75/1.01 18 join(c3,c2) = c2 # label(goals) # label(negated_conjecture). [clausify(14)].
% 0.75/1.01 21 join(A,B) = join(B,A) # label(maddux1_join_commutativity) # label(axiom). [clausify(1)].
% 0.75/1.01 27 join(join(A,B),C) = join(A,join(B,C)) # label(maddux2_join_associativity) # label(axiom). [clausify(2)].
% 0.75/1.01 28 join(A,join(B,C)) = join(C,join(A,B)). [copy(27),rewrite([21(2)]),flip(a)].
% 0.75/1.01 36 join(join(c1,c3),c2) != c2 # label(goals) # label(negated_conjecture) # answer(goals). [clausify(14)].
% 0.75/1.01 37 join(c1,join(c2,c3)) != c2 # answer(goals). [copy(36),rewrite([21(5),28(5,R),21(4)])].
% 0.75/1.01 38 join(c2,c3) = c2. [back_rewrite(18),rewrite([21(3)])].
% 0.75/1.01 40 $F # answer(goals). [back_rewrite(37),rewrite([38(4),17(3)]),xx(a)].
% 0.75/1.01
% 0.75/1.01 % SZS output end Refutation
% 0.75/1.01 ============================== end of proof ==========================
% 0.75/1.01
% 0.75/1.01 ============================== STATISTICS ============================
% 0.75/1.01
% 0.75/1.01 Given=0. Generated=19. Kept=18. proofs=1.
% 0.75/1.01 Usable=0. Sos=13. Demods=15. Limbo=2, Disabled=19. Hints=0.
% 0.75/1.01 Megabytes=0.05.
% 0.75/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.75/1.01
% 0.75/1.01 ============================== end of statistics =====================
% 0.75/1.01
% 0.75/1.01 ============================== end of search =========================
% 0.75/1.01
% 0.75/1.01 THEOREM PROVED
% 0.75/1.01 % SZS status Theorem
% 0.75/1.01
% 0.75/1.01 Exiting with 1 proof.
% 0.75/1.01
% 0.75/1.01 Process 10292 exit (max_proofs) Fri Jul 8 15:42:11 2022
% 0.75/1.01 Prover9 interrupted
%------------------------------------------------------------------------------