TSTP Solution File: GRP700+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP700+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 : Sat Jul 16 11:20:40 EDT 2022
% Result : Theorem 0.86s 1.13s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n018.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 : Tue Jun 14 03:48:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.86/1.13 ============================== Prover9 ===============================
% 0.86/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.13 Process 19079 was started by sandbox on n018.cluster.edu,
% 0.86/1.13 Tue Jun 14 03:48:29 2022
% 0.86/1.13 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18925_n018.cluster.edu".
% 0.86/1.13 ============================== end of head ===========================
% 0.86/1.13
% 0.86/1.13 ============================== INPUT =================================
% 0.86/1.13
% 0.86/1.13 % Reading from file /tmp/Prover9_18925_n018.cluster.edu
% 0.86/1.13
% 0.86/1.13 set(prolog_style_variables).
% 0.86/1.13 set(auto2).
% 0.86/1.13 % set(auto2) -> set(auto).
% 0.86/1.13 % set(auto) -> set(auto_inference).
% 0.86/1.13 % set(auto) -> set(auto_setup).
% 0.86/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.86/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.13 % set(auto) -> set(auto_limits).
% 0.86/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.13 % set(auto) -> set(auto_denials).
% 0.86/1.13 % set(auto) -> set(auto_process).
% 0.86/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.86/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.86/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.86/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.86/1.13 % set(auto2) -> assign(stats, some).
% 0.86/1.13 % set(auto2) -> clear(echo_input).
% 0.86/1.13 % set(auto2) -> set(quiet).
% 0.86/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.13 % set(auto2) -> clear(print_given).
% 0.86/1.13 assign(lrs_ticks,-1).
% 0.86/1.13 assign(sos_limit,10000).
% 0.86/1.13 assign(order,kbo).
% 0.86/1.13 set(lex_order_vars).
% 0.86/1.13 clear(print_given).
% 0.86/1.13
% 0.86/1.13 % formulas(sos). % not echoed (9 formulas)
% 0.86/1.13
% 0.86/1.13 ============================== end of input ==========================
% 0.86/1.13
% 0.86/1.13 % From the command line: assign(max_seconds, 300).
% 0.86/1.13
% 0.86/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.13
% 0.86/1.13 % Formulas that are not ordinary clauses:
% 0.86/1.13 1 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 2 (all B all A ld(A,mult(A,B)) = B) # label(f02) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 3 (all B all A mult(rd(A,B),B) = A) # label(f03) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 4 (all B all A rd(mult(A,B),B) = A) # label(f04) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 5 (all A mult(A,unit) = A) # label(f05) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 6 (all A mult(unit,A) = A) # label(f06) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 7 (all C all B all A mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C))) # label(f07) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 8 (all C all B all A mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B)) # label(f08) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 9 -(all X0 exists X1 (mult(X1,X0) = unit & mult(X0,X1) = unit)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.86/1.13
% 0.86/1.13 ============================== end of process non-clausal formulas ===
% 0.86/1.13
% 0.86/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.13
% 0.86/1.13 ============================== PREDICATE ELIMINATION =================
% 0.86/1.13
% 0.86/1.13 ============================== end predicate elimination =============
% 0.86/1.13
% 0.86/1.13 Auto_denials:
% 0.86/1.13 % copying label goals to answer in negative clause
% 0.86/1.13
% 0.86/1.13 Term ordering decisions:
% 0.86/1.13 Function symbol KB weights: unit=1. c1=1. mult=1. ld=1. rd=1.
% 0.86/1.13
% 0.86/1.13 ============================== end of process initial clauses ========
% 0.86/1.13
% 0.86/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.13
% 0.86/1.13 ============================== end of clauses for search =============
% 0.86/1.13
% 0.86/1.13 ============================== SEARCH ================================
% 0.86/1.13
% 0.86/1.13 % Starting search at 0.01 seconds.
% 0.86/1.13
% 0.86/1.13 ============================== PROOF =================================
% 0.86/1.13 % SZS status Theorem
% 0.86/1.13 % SZS output start Refutation
% 0.86/1.13
% 0.86/1.13 % Proof 1 at 0.16 (+ 0.01) seconds: goals.
% 0.86/1.13 % Length of proof is 30.
% 0.86/1.13 % Level of proof is 10.
% 0.86/1.13 % Maximum clause weight is 19.000.
% 0.86/1.13 % Given clauses 107.
% 0.86/1.13
% 0.86/1.13 1 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 2 (all B all A ld(A,mult(A,B)) = B) # label(f02) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 4 (all B all A rd(mult(A,B),B) = A) # label(f04) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 5 (all A mult(A,unit) = A) # label(f05) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 6 (all A mult(unit,A) = A) # label(f06) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 7 (all C all B all A mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C))) # label(f07) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 8 (all C all B all A mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B)) # label(f08) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 9 -(all X0 exists X1 (mult(X1,X0) = unit & mult(X0,X1) = unit)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.86/1.13 10 mult(A,unit) = A # label(f05) # label(axiom). [clausify(5)].
% 0.86/1.13 11 mult(unit,A) = A # label(f06) # label(axiom). [clausify(6)].
% 0.86/1.13 12 mult(A,ld(A,B)) = B # label(f01) # label(axiom). [clausify(1)].
% 0.86/1.13 13 ld(A,mult(A,B)) = B # label(f02) # label(axiom). [clausify(2)].
% 0.86/1.13 15 rd(mult(A,B),B) = A # label(f04) # label(axiom). [clausify(4)].
% 0.86/1.13 16 mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)) # label(f07) # label(axiom). [clausify(7)].
% 0.86/1.13 17 mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))) # label(f08) # label(axiom). [clausify(8)].
% 0.86/1.13 18 mult(A,c1) != unit | mult(c1,A) != unit # label(goals) # label(negated_conjecture) # answer(goals). [clausify(9)].
% 0.86/1.13 23 rd(A,A) = unit. [para(11(a,1),15(a,1,1))].
% 0.86/1.13 24 rd(A,ld(B,A)) = B. [para(12(a,1),15(a,1,1))].
% 0.86/1.13 25 mult(mult(A,A),mult(A,B)) = mult(A,mult(mult(A,A),B)). [para(10(a,1),16(a,1,1,1)),rewrite([11(5)])].
% 0.86/1.13 32 rd(mult(A,mult(mult(mult(B,A),A),C)),mult(A,C)) = mult(mult(A,B),A). [para(16(a,1),15(a,1,1))].
% 0.86/1.13 36 mult(mult(A,mult(B,B)),B) = mult(mult(A,B),mult(B,B)). [para(10(a,1),17(a,1,1,2,2)),rewrite([11(6)])].
% 0.86/1.13 52 mult(ld(c1,unit),c1) != unit # answer(goals). [ur(18,b,12,a)].
% 0.86/1.13 70 mult(A,mult(mult(A,A),ld(A,B))) = mult(mult(A,A),B). [para(12(a,1),25(a,1,2)),flip(a)].
% 0.86/1.13 161 ld(A,mult(mult(A,A),B)) = mult(mult(A,A),ld(A,B)). [para(70(a,1),13(a,1,2))].
% 0.86/1.13 432 mult(mult(A,A),ld(A,unit)) = A. [para(10(a,1),161(a,1,2)),rewrite([13(2)]),flip(a)].
% 0.86/1.13 618 mult(mult(ld(A,unit),mult(A,A)),ld(A,unit)) = unit. [para(432(a,1),32(a,1,1,2,1,1)),rewrite([12(5),11(4),23(7)]),flip(a)].
% 0.86/1.13 631 mult(ld(A,unit),mult(A,A)) = A. [para(618(a,1),15(a,1,1)),rewrite([24(4)]),flip(a)].
% 0.86/1.13 724 mult(mult(ld(A,unit),A),mult(A,A)) = mult(A,A). [para(631(a,1),36(a,1,1)),flip(a)].
% 0.86/1.13 863 mult(ld(A,unit),A) = unit. [para(724(a,1),15(a,1,1)),rewrite([23(3)]),flip(a)].
% 0.86/1.13 864 $F # answer(goals). [resolve(863,a,52,a)].
% 0.86/1.13
% 0.86/1.13 % SZS output end Refutation
% 0.86/1.13 ============================== end of proof ==========================
% 0.86/1.13
% 0.86/1.13 ============================== STATISTICS ============================
% 0.86/1.13
% 0.86/1.13 Given=107. Generated=3026. Kept=854. proofs=1.
% 0.86/1.13 Usable=87. Sos=608. Demods=575. Limbo=1, Disabled=166. Hints=0.
% 0.86/1.13 Megabytes=2.00.
% 0.86/1.13 User_CPU=0.16, System_CPU=0.01, Wall_clock=0.
% 0.86/1.13
% 0.86/1.13 ============================== end of statistics =====================
% 0.86/1.13
% 0.86/1.13 ============================== end of search =========================
% 0.86/1.13
% 0.86/1.13 THEOREM PROVED
% 0.86/1.13 % SZS status Theorem
% 0.86/1.13
% 0.86/1.13 Exiting with 1 proof.
% 0.86/1.13
% 0.86/1.13 Process 19079 exit (max_proofs) Tue Jun 14 03:48:29 2022
% 0.86/1.13 Prover9 interrupted
%------------------------------------------------------------------------------