TSTP Solution File: GRP699-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:39 EDT 2022
% Result : Unsatisfiable 1.43s 1.72s
% Output : Refutation 1.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 14 09:38:44 EDT 2022
% 0.11/0.34 % CPUTime :
% 1.43/1.72 ============================== Prover9 ===============================
% 1.43/1.72 Prover9 (32) version 2009-11A, November 2009.
% 1.43/1.72 Process 7117 was started by sandbox2 on n013.cluster.edu,
% 1.43/1.72 Tue Jun 14 09:38:44 2022
% 1.43/1.72 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6963_n013.cluster.edu".
% 1.43/1.72 ============================== end of head ===========================
% 1.43/1.72
% 1.43/1.72 ============================== INPUT =================================
% 1.43/1.72
% 1.43/1.72 % Reading from file /tmp/Prover9_6963_n013.cluster.edu
% 1.43/1.72
% 1.43/1.72 set(prolog_style_variables).
% 1.43/1.72 set(auto2).
% 1.43/1.72 % set(auto2) -> set(auto).
% 1.43/1.72 % set(auto) -> set(auto_inference).
% 1.43/1.72 % set(auto) -> set(auto_setup).
% 1.43/1.72 % set(auto_setup) -> set(predicate_elim).
% 1.43/1.72 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.43/1.72 % set(auto) -> set(auto_limits).
% 1.43/1.72 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.43/1.72 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.43/1.72 % set(auto) -> set(auto_denials).
% 1.43/1.72 % set(auto) -> set(auto_process).
% 1.43/1.72 % set(auto2) -> assign(new_constants, 1).
% 1.43/1.72 % set(auto2) -> assign(fold_denial_max, 3).
% 1.43/1.72 % set(auto2) -> assign(max_weight, "200.000").
% 1.43/1.72 % set(auto2) -> assign(max_hours, 1).
% 1.43/1.72 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.43/1.72 % set(auto2) -> assign(max_seconds, 0).
% 1.43/1.72 % set(auto2) -> assign(max_minutes, 5).
% 1.43/1.72 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.43/1.72 % set(auto2) -> set(sort_initial_sos).
% 1.43/1.72 % set(auto2) -> assign(sos_limit, -1).
% 1.43/1.72 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.43/1.72 % set(auto2) -> assign(max_megs, 400).
% 1.43/1.72 % set(auto2) -> assign(stats, some).
% 1.43/1.72 % set(auto2) -> clear(echo_input).
% 1.43/1.72 % set(auto2) -> set(quiet).
% 1.43/1.72 % set(auto2) -> clear(print_initial_clauses).
% 1.43/1.72 % set(auto2) -> clear(print_given).
% 1.43/1.72 assign(lrs_ticks,-1).
% 1.43/1.72 assign(sos_limit,10000).
% 1.43/1.72 assign(order,kbo).
% 1.43/1.72 set(lex_order_vars).
% 1.43/1.72 clear(print_given).
% 1.43/1.72
% 1.43/1.72 % formulas(sos). % not echoed (9 formulas)
% 1.43/1.72
% 1.43/1.72 ============================== end of input ==========================
% 1.43/1.72
% 1.43/1.72 % From the command line: assign(max_seconds, 300).
% 1.43/1.72
% 1.43/1.72 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.43/1.72
% 1.43/1.72 % Formulas that are not ordinary clauses:
% 1.43/1.72
% 1.43/1.72 ============================== end of process non-clausal formulas ===
% 1.43/1.72
% 1.43/1.72 ============================== PROCESS INITIAL CLAUSES ===============
% 1.43/1.72
% 1.43/1.72 ============================== PREDICATE ELIMINATION =================
% 1.43/1.72
% 1.43/1.72 ============================== end predicate elimination =============
% 1.43/1.72
% 1.43/1.72 Auto_denials:
% 1.43/1.72 % copying label goals to answer in negative clause
% 1.43/1.72
% 1.43/1.72 Term ordering decisions:
% 1.43/1.72 Function symbol KB weights: unit=1. a=1. b=1. c=1. mult=1. ld=1. rd=1.
% 1.43/1.72
% 1.43/1.72 ============================== end of process initial clauses ========
% 1.43/1.72
% 1.43/1.72 ============================== CLAUSES FOR SEARCH ====================
% 1.43/1.72
% 1.43/1.72 ============================== end of clauses for search =============
% 1.43/1.72
% 1.43/1.72 ============================== SEARCH ================================
% 1.43/1.72
% 1.43/1.72 % Starting search at 0.01 seconds.
% 1.43/1.72
% 1.43/1.72 ============================== PROOF =================================
% 1.43/1.72 % SZS status Unsatisfiable
% 1.43/1.72 % SZS output start Refutation
% 1.43/1.72
% 1.43/1.72 % Proof 1 at 0.65 (+ 0.01) seconds: goals.
% 1.43/1.72 % Length of proof is 13.
% 1.43/1.72 % Level of proof is 7.
% 1.43/1.72 % Maximum clause weight is 19.000.
% 1.43/1.72 % Given clauses 117.
% 1.43/1.72
% 1.43/1.72 2 mult(unit,A) = A # label(c06) # label(axiom). [assumption].
% 1.43/1.72 3 mult(A,ld(A,B)) = B # label(c01) # label(axiom). [assumption].
% 1.43/1.72 4 ld(A,mult(A,B)) = B # label(c02) # label(axiom). [assumption].
% 1.43/1.72 8 mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B) # label(c08) # label(axiom). [assumption].
% 1.43/1.72 9 mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))). [copy(8),flip(a)].
% 1.43/1.72 10 mult(mult(a,b),c) != mult(mult(a,c),ld(c,mult(b,c))) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 1.43/1.72 11 mult(mult(a,c),ld(c,mult(b,c))) != mult(mult(a,b),c) # answer(goals). [copy(10),flip(a)].
% 1.43/1.72 30 mult(mult(A,mult(A,B)),A) = mult(A,mult(A,mult(B,A))). [para(2(a,1),9(a,1,1)),rewrite([2(5)])].
% 1.43/1.72 103 mult(A,mult(A,mult(ld(A,B),A))) = mult(mult(A,B),A). [para(3(a,1),30(a,1,1,2)),flip(a)].
% 1.43/1.72 281 ld(A,mult(mult(A,B),A)) = mult(A,mult(ld(A,B),A)). [para(103(a,1),4(a,1,2))].
% 1.43/1.72 1753 mult(A,mult(ld(A,ld(A,B)),A)) = ld(A,mult(B,A)). [para(3(a,1),281(a,1,2,1)),flip(a)].
% 1.43/1.72 2841 mult(mult(A,B),ld(B,mult(C,B))) = mult(mult(A,C),B). [para(1753(a,1),9(a,2,2)),rewrite([3(3),3(2)]),flip(a)].
% 1.43/1.72 2842 $F # answer(goals). [resolve(2841,a,11,a)].
% 1.43/1.72
% 1.43/1.72 % SZS output end Refutation
% 1.43/1.72 ============================== end of proof ==========================
% 1.43/1.72
% 1.43/1.72 ============================== STATISTICS ============================
% 1.43/1.72
% 1.43/1.72 Given=117. Generated=10589. Kept=2839. proofs=1.
% 1.43/1.72 Usable=89. Sos=2013. Demods=2105. Limbo=6, Disabled=739. Hints=0.
% 1.43/1.72 Megabytes=8.45.
% 1.43/1.72 User_CPU=0.65, System_CPU=0.01, Wall_clock=1.
% 1.43/1.72
% 1.43/1.72 ============================== end of statistics =====================
% 1.43/1.72
% 1.43/1.72 ============================== end of search =========================
% 1.43/1.72
% 1.43/1.72 THEOREM PROVED
% 1.43/1.72 % SZS status Unsatisfiable
% 1.43/1.72
% 1.43/1.72 Exiting with 1 proof.
% 1.43/1.72
% 1.43/1.72 Process 7117 exit (max_proofs) Tue Jun 14 09:38:45 2022
% 1.43/1.72 Prover9 interrupted
%------------------------------------------------------------------------------