TSTP Solution File: GRP197-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP197-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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 : Sat Jul 16 11:18:07 EDT 2022
% Result : Unsatisfiable 1.51s 1.82s
% Output : Refutation 1.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP197-1 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 13 05:45:57 EDT 2022
% 0.12/0.32 % CPUTime :
% 1.51/1.82 ============================== Prover9 ===============================
% 1.51/1.82 Prover9 (32) version 2009-11A, November 2009.
% 1.51/1.82 Process 28239 was started by sandbox on n006.cluster.edu,
% 1.51/1.82 Mon Jun 13 05:45:57 2022
% 1.51/1.82 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28085_n006.cluster.edu".
% 1.51/1.82 ============================== end of head ===========================
% 1.51/1.82
% 1.51/1.82 ============================== INPUT =================================
% 1.51/1.82
% 1.51/1.82 % Reading from file /tmp/Prover9_28085_n006.cluster.edu
% 1.51/1.82
% 1.51/1.82 set(prolog_style_variables).
% 1.51/1.82 set(auto2).
% 1.51/1.82 % set(auto2) -> set(auto).
% 1.51/1.82 % set(auto) -> set(auto_inference).
% 1.51/1.82 % set(auto) -> set(auto_setup).
% 1.51/1.82 % set(auto_setup) -> set(predicate_elim).
% 1.51/1.82 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.51/1.82 % set(auto) -> set(auto_limits).
% 1.51/1.82 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.51/1.82 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.51/1.82 % set(auto) -> set(auto_denials).
% 1.51/1.82 % set(auto) -> set(auto_process).
% 1.51/1.82 % set(auto2) -> assign(new_constants, 1).
% 1.51/1.82 % set(auto2) -> assign(fold_denial_max, 3).
% 1.51/1.82 % set(auto2) -> assign(max_weight, "200.000").
% 1.51/1.82 % set(auto2) -> assign(max_hours, 1).
% 1.51/1.82 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.51/1.82 % set(auto2) -> assign(max_seconds, 0).
% 1.51/1.82 % set(auto2) -> assign(max_minutes, 5).
% 1.51/1.82 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.51/1.82 % set(auto2) -> set(sort_initial_sos).
% 1.51/1.82 % set(auto2) -> assign(sos_limit, -1).
% 1.51/1.82 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.51/1.82 % set(auto2) -> assign(max_megs, 400).
% 1.51/1.82 % set(auto2) -> assign(stats, some).
% 1.51/1.82 % set(auto2) -> clear(echo_input).
% 1.51/1.82 % set(auto2) -> set(quiet).
% 1.51/1.82 % set(auto2) -> clear(print_initial_clauses).
% 1.51/1.82 % set(auto2) -> clear(print_given).
% 1.51/1.82 assign(lrs_ticks,-1).
% 1.51/1.82 assign(sos_limit,10000).
% 1.51/1.82 assign(order,kbo).
% 1.51/1.82 set(lex_order_vars).
% 1.51/1.82 clear(print_given).
% 1.51/1.82
% 1.51/1.82 % formulas(sos). % not echoed (5 formulas)
% 1.51/1.82
% 1.51/1.82 ============================== end of input ==========================
% 1.51/1.82
% 1.51/1.82 % From the command line: assign(max_seconds, 300).
% 1.51/1.82
% 1.51/1.82 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.51/1.82
% 1.51/1.82 % Formulas that are not ordinary clauses:
% 1.51/1.82
% 1.51/1.82 ============================== end of process non-clausal formulas ===
% 1.51/1.82
% 1.51/1.82 ============================== PROCESS INITIAL CLAUSES ===============
% 1.51/1.82
% 1.51/1.82 ============================== PREDICATE ELIMINATION =================
% 1.51/1.82
% 1.51/1.82 ============================== end predicate elimination =============
% 1.51/1.82
% 1.51/1.82 Auto_denials:
% 1.51/1.82 % copying label prove_this to answer in negative clause
% 1.51/1.82
% 1.51/1.82 Term ordering decisions:
% 1.51/1.82 Function symbol KB weights: a=1. b=1. multiply=1.
% 1.51/1.82
% 1.51/1.82 ============================== end of process initial clauses ========
% 1.51/1.82
% 1.51/1.82 ============================== CLAUSES FOR SEARCH ====================
% 1.51/1.82
% 1.51/1.82 ============================== end of clauses for search =============
% 1.51/1.82
% 1.51/1.82 ============================== SEARCH ================================
% 1.51/1.82
% 1.51/1.82 % Starting search at 0.01 seconds.
% 1.51/1.82
% 1.51/1.82 ============================== PROOF =================================
% 1.51/1.82 % SZS status Unsatisfiable
% 1.51/1.82 % SZS output start Refutation
% 1.51/1.82
% 1.51/1.82 % Proof 1 at 0.85 (+ 0.01) seconds: prove_this.
% 1.51/1.82 % Length of proof is 17.
% 1.51/1.82 % Level of proof is 6.
% 1.51/1.82 % Maximum clause weight is 43.000.
% 1.51/1.82 % Given clauses 67.
% 1.51/1.82
% 1.51/1.82 1 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity_of_multiply) # label(axiom). [assumption].
% 1.51/1.82 2 multiply(A,multiply(A,multiply(A,multiply(B,B)))) = multiply(B,multiply(A,multiply(A,multiply(B,A)))) # label(condition) # label(hypothesis). [assumption].
% 1.51/1.82 3 multiply(A,multiply(B,multiply(B,multiply(A,B)))) = multiply(B,multiply(B,multiply(B,multiply(A,A)))). [copy(2),flip(a)].
% 1.51/1.82 4 multiply(b,multiply(b,multiply(a,multiply(a,a)))) != multiply(a,multiply(b,multiply(a,multiply(a,b)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.51/1.82 5 multiply(A,B) != multiply(C,B) | A = C # label(right_cancellation) # label(axiom). [assumption].
% 1.51/1.82 6 multiply(A,B) != multiply(A,C) | B = C # label(left_cancellation) # label(axiom). [assumption].
% 1.51/1.82 7 multiply(A,multiply(B,multiply(B,multiply(A,multiply(B,C))))) = multiply(B,multiply(B,multiply(B,multiply(A,multiply(A,C))))). [para(3(a,1),1(a,1,1)),rewrite([1(5),1(4),1(3),1(2),1(9),1(8),1(7)]),flip(a)].
% 1.51/1.82 8 multiply(A,multiply(B,multiply(C,multiply(C,multiply(A,multiply(B,C)))))) = multiply(C,multiply(C,multiply(C,multiply(A,multiply(B,multiply(A,B)))))). [para(3(a,1),1(a,1)),rewrite([1(3),1(8)]),flip(a)].
% 1.51/1.82 14 multiply(A,multiply(B,C)) != multiply(D,C) | multiply(A,B) = D. [para(1(a,1),5(a,1))].
% 1.51/1.82 19 multiply(A,multiply(b,multiply(b,multiply(a,multiply(a,a))))) != multiply(A,multiply(a,multiply(b,multiply(a,multiply(a,b))))) # answer(prove_this). [ur(6,b,4,a)].
% 1.51/1.82 70 multiply(A,multiply(B,multiply(b,multiply(b,multiply(a,multiply(a,a)))))) != multiply(A,multiply(B,multiply(a,multiply(b,multiply(a,multiply(a,b)))))) # answer(prove_this). [ur(6,b,19,a)].
% 1.51/1.82 75 multiply(A,multiply(B,multiply(C,D))) != multiply(E,D) | multiply(A,multiply(B,C)) = E. [para(1(a,1),14(a,1,2))].
% 1.51/1.82 102 multiply(A,multiply(B,multiply(C,multiply(D,E)))) != multiply(F,E) | multiply(A,multiply(B,multiply(C,D))) = F. [para(1(a,1),75(a,1,2,2))].
% 1.51/1.82 163 multiply(A,multiply(B,multiply(B,multiply(A,multiply(B,multiply(A,multiply(A,multiply(C,multiply(D,multiply(C,D)))))))))) = multiply(B,multiply(B,multiply(B,multiply(A,multiply(C,multiply(D,multiply(A,multiply(A,multiply(C,multiply(D,A)))))))))). [para(8(a,2),7(a,2,2,2,2,2))].
% 1.51/1.82 805 multiply(A,multiply(A,multiply(A,multiply(B,B)))) != multiply(C,A) | multiply(B,multiply(A,multiply(A,B))) = C. [para(3(a,1),102(a,1))].
% 1.51/1.82 2202 multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,multiply(a,a)))))))))) != multiply(a,multiply(a,multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,b)))))))))) # answer(prove_this). [ur(805,b,70,a(flip)),rewrite([1(18),1(17),1(16),1(40),1(39),1(38),1(42),1(41),1(40),1(39),1(38),1(37),1(36),1(35),1(34)]),flip(a)].
% 1.51/1.82 2203 $F # answer(prove_this). [resolve(2202,a,163,a)].
% 1.51/1.82
% 1.51/1.82 % SZS output end Refutation
% 1.51/1.82 ============================== end of proof ==========================
% 1.51/1.82
% 1.51/1.82 ============================== STATISTICS ============================
% 1.51/1.82
% 1.51/1.82 Given=67. Generated=4859. Kept=2201. proofs=1.
% 1.51/1.82 Usable=67. Sos=2107. Demods=1. Limbo=16, Disabled=15. Hints=0.
% 1.51/1.82 Megabytes=6.19.
% 1.51/1.82 User_CPU=0.85, System_CPU=0.01, Wall_clock=1.
% 1.51/1.82
% 1.51/1.82 ============================== end of statistics =====================
% 1.51/1.82
% 1.51/1.82 ============================== end of search =========================
% 1.51/1.82
% 1.51/1.82 THEOREM PROVED
% 1.51/1.82 % SZS status Unsatisfiable
% 1.51/1.82
% 1.51/1.82 Exiting with 1 proof.
% 1.51/1.82
% 1.51/1.82 Process 28239 exit (max_proofs) Mon Jun 13 05:45:58 2022
% 1.51/1.82 Prover9 interrupted
%------------------------------------------------------------------------------