TSTP Solution File: GRP657+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP657+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:20:21 EDT 2022
% Result : Theorem 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP657+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 : n028.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 : Mon Jun 13 16:41:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 27415 was started by sandbox on n028.cluster.edu,
% 0.42/0.99 Mon Jun 13 16:41:53 2022
% 0.42/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27262_n028.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_27262_n028.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99 1 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 2 (all B all A ld(A,mult(A,B)) = B) # label(f02) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 3 (all B all A mult(rd(A,B),B) = A) # label(f03) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 4 (all B all A rd(mult(A,B),B) = A) # label(f04) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 5 (all C all B all A mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A))) # label(f05) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 6 -(exists X0 all X1 (mult(X1,X0) = X1 & mult(X0,X1) = X1)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials:
% 0.42/0.99 % copying label goals to answer in negative clause
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99
% 0.42/0.99 % Assigning unary symbol f1 kb_weight 0 and highest precedence (5).
% 0.42/0.99 Function symbol KB weights: mult=1. ld=1. rd=1. f1=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Theorem
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.03 (+ 0.00) seconds: goals.
% 0.42/0.99 % Length of proof is 21.
% 0.42/0.99 % Level of proof is 10.
% 0.42/0.99 % Maximum clause weight is 15.000.
% 0.42/0.99 % Given clauses 20.
% 0.42/0.99
% 0.42/0.99 1 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 2 (all B all A ld(A,mult(A,B)) = B) # label(f02) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 4 (all B all A rd(mult(A,B),B) = A) # label(f04) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 5 (all C all B all A mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A))) # label(f05) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 6 -(exists X0 all X1 (mult(X1,X0) = X1 & mult(X0,X1) = X1)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.99 7 mult(A,ld(A,B)) = B # label(f01) # label(axiom). [clausify(1)].
% 0.42/0.99 8 ld(A,mult(A,B)) = B # label(f02) # label(axiom). [clausify(2)].
% 0.42/0.99 10 rd(mult(A,B),B) = A # label(f04) # label(axiom). [clausify(4)].
% 0.42/0.99 11 mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)) # label(f05) # label(axiom). [clausify(5)].
% 0.42/0.99 12 mult(f1(A),A) != f1(A) | mult(A,f1(A)) != f1(A) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(6)].
% 0.42/0.99 15 mult(A,mult(mult(ld(A,B),C),A)) = mult(B,mult(C,A)). [para(7(a,1),11(a,1,1)),flip(a)].
% 0.42/0.99 24 ld(A,mult(B,mult(C,A))) = mult(mult(ld(A,B),C),A). [para(15(a,1),8(a,1,2))].
% 0.42/0.99 65 mult(mult(ld(A,A),B),A) = mult(B,A). [para(24(a,1),8(a,1))].
% 0.42/0.99 76 mult(ld(A,A),B) = B. [para(65(a,1),10(a,1,1)),rewrite([10(2)]),flip(a)].
% 0.42/0.99 98 mult(f1(ld(A,A)),ld(A,A)) != f1(ld(A,A)) # answer(goals). [ur(12,b,76,a)].
% 0.42/0.99 100 rd(A,A) = ld(B,B). [para(76(a,1),10(a,1,1))].
% 0.42/0.99 112 rd(A,A) = c_0. [new_symbol(100)].
% 0.42/0.99 114 ld(A,A) = c_0. [back_rewrite(100),rewrite([112(1)]),flip(a)].
% 0.42/0.99 123 mult(f1(c_0),c_0) != f1(c_0) # answer(goals). [back_rewrite(98),rewrite([114(1),114(3),114(5)])].
% 0.42/0.99 125 mult(A,c_0) = A. [para(114(a,1),7(a,1,2))].
% 0.42/0.99 126 $F # answer(goals). [resolve(125,a,123,a)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=20. Generated=422. Kept=119. proofs=1.
% 0.42/0.99 Usable=16. Sos=77. Demods=90. Limbo=0, Disabled=31. Hints=0.
% 0.42/0.99 Megabytes=0.28.
% 0.42/0.99 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Theorem
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 27415 exit (max_proofs) Mon Jun 13 16:41:53 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------