TSTP Solution File: GRP698-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP698-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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.21s 1.49s
% Output : Refutation 1.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP698-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n009.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 : Tue Jun 14 09:36:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.21/1.49 ============================== Prover9 ===============================
% 1.21/1.49 Prover9 (32) version 2009-11A, November 2009.
% 1.21/1.49 Process 23893 was started by sandbox2 on n009.cluster.edu,
% 1.21/1.49 Tue Jun 14 09:36:23 2022
% 1.21/1.49 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23738_n009.cluster.edu".
% 1.21/1.49 ============================== end of head ===========================
% 1.21/1.49
% 1.21/1.49 ============================== INPUT =================================
% 1.21/1.49
% 1.21/1.49 % Reading from file /tmp/Prover9_23738_n009.cluster.edu
% 1.21/1.49
% 1.21/1.49 set(prolog_style_variables).
% 1.21/1.49 set(auto2).
% 1.21/1.49 % set(auto2) -> set(auto).
% 1.21/1.49 % set(auto) -> set(auto_inference).
% 1.21/1.49 % set(auto) -> set(auto_setup).
% 1.21/1.49 % set(auto_setup) -> set(predicate_elim).
% 1.21/1.49 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.21/1.49 % set(auto) -> set(auto_limits).
% 1.21/1.49 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.21/1.49 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.21/1.49 % set(auto) -> set(auto_denials).
% 1.21/1.49 % set(auto) -> set(auto_process).
% 1.21/1.49 % set(auto2) -> assign(new_constants, 1).
% 1.21/1.49 % set(auto2) -> assign(fold_denial_max, 3).
% 1.21/1.49 % set(auto2) -> assign(max_weight, "200.000").
% 1.21/1.49 % set(auto2) -> assign(max_hours, 1).
% 1.21/1.49 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.21/1.49 % set(auto2) -> assign(max_seconds, 0).
% 1.21/1.49 % set(auto2) -> assign(max_minutes, 5).
% 1.21/1.49 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.21/1.49 % set(auto2) -> set(sort_initial_sos).
% 1.21/1.49 % set(auto2) -> assign(sos_limit, -1).
% 1.21/1.49 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.21/1.49 % set(auto2) -> assign(max_megs, 400).
% 1.21/1.49 % set(auto2) -> assign(stats, some).
% 1.21/1.49 % set(auto2) -> clear(echo_input).
% 1.21/1.49 % set(auto2) -> set(quiet).
% 1.21/1.49 % set(auto2) -> clear(print_initial_clauses).
% 1.21/1.49 % set(auto2) -> clear(print_given).
% 1.21/1.49 assign(lrs_ticks,-1).
% 1.21/1.49 assign(sos_limit,10000).
% 1.21/1.49 assign(order,kbo).
% 1.21/1.49 set(lex_order_vars).
% 1.21/1.49 clear(print_given).
% 1.21/1.49
% 1.21/1.49 % formulas(sos). % not echoed (9 formulas)
% 1.21/1.49
% 1.21/1.49 ============================== end of input ==========================
% 1.21/1.49
% 1.21/1.49 % From the command line: assign(max_seconds, 300).
% 1.21/1.49
% 1.21/1.49 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.21/1.49
% 1.21/1.49 % Formulas that are not ordinary clauses:
% 1.21/1.49
% 1.21/1.49 ============================== end of process non-clausal formulas ===
% 1.21/1.49
% 1.21/1.49 ============================== PROCESS INITIAL CLAUSES ===============
% 1.21/1.49
% 1.21/1.49 ============================== PREDICATE ELIMINATION =================
% 1.21/1.49
% 1.21/1.49 ============================== end predicate elimination =============
% 1.21/1.49
% 1.21/1.49 Auto_denials:
% 1.21/1.49 % copying label goals to answer in negative clause
% 1.21/1.49
% 1.21/1.49 Term ordering decisions:
% 1.21/1.49 Function symbol KB weights: unit=1. a=1. b=1. c=1. mult=1. ld=1. rd=1.
% 1.21/1.49
% 1.21/1.49 ============================== end of process initial clauses ========
% 1.21/1.49
% 1.21/1.49 ============================== CLAUSES FOR SEARCH ====================
% 1.21/1.49
% 1.21/1.49 ============================== end of clauses for search =============
% 1.21/1.49
% 1.21/1.49 ============================== SEARCH ================================
% 1.21/1.49
% 1.21/1.49 % Starting search at 0.01 seconds.
% 1.21/1.49
% 1.21/1.49 ============================== PROOF =================================
% 1.21/1.49 % SZS status Unsatisfiable
% 1.21/1.49 % SZS output start Refutation
% 1.21/1.49
% 1.21/1.49 % Proof 1 at 0.51 (+ 0.01) seconds: goals.
% 1.21/1.49 % Length of proof is 12.
% 1.21/1.49 % Level of proof is 6.
% 1.21/1.49 % Maximum clause weight is 19.000.
% 1.21/1.49 % Given clauses 109.
% 1.21/1.49
% 1.21/1.49 1 mult(A,unit) = A # label(c05) # label(axiom). [assumption].
% 1.21/1.49 5 mult(rd(A,B),B) = A # label(c03) # label(axiom). [assumption].
% 1.21/1.49 6 rd(mult(A,B),B) = A # label(c04) # label(axiom). [assumption].
% 1.21/1.49 7 mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)) # label(c07) # label(axiom). [assumption].
% 1.21/1.49 10 mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 1.21/1.49 11 mult(rd(mult(a,b),a),mult(a,c)) != mult(a,mult(b,c)) # answer(goals). [copy(10),flip(a)].
% 1.21/1.49 19 mult(mult(mult(A,B),A),A) = mult(A,mult(mult(B,A),A)). [para(1(a,1),7(a,1,2)),rewrite([1(7)])].
% 1.21/1.49 76 rd(mult(A,mult(mult(B,A),A)),A) = mult(mult(A,B),A). [para(19(a,1),6(a,1,1))].
% 1.21/1.49 199 rd(mult(A,mult(B,A)),A) = mult(mult(A,rd(B,A)),A). [para(5(a,1),76(a,1,1,2,1))].
% 1.21/1.49 1173 mult(mult(A,rd(rd(B,A),A)),A) = rd(mult(A,B),A). [para(5(a,1),199(a,1,1,2)),flip(a)].
% 1.21/1.49 2301 mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)). [para(1173(a,1),7(a,1,1)),rewrite([5(7),5(6)])].
% 1.21/1.49 2302 $F # answer(goals). [resolve(2301,a,11,a)].
% 1.21/1.49
% 1.21/1.49 % SZS output end Refutation
% 1.21/1.49 ============================== end of proof ==========================
% 1.21/1.49
% 1.21/1.49 ============================== STATISTICS ============================
% 1.21/1.49
% 1.21/1.49 Given=109. Generated=8452. Kept=2299. proofs=1.
% 1.21/1.49 Usable=84. Sos=1574. Demods=1659. Limbo=3, Disabled=646. Hints=0.
% 1.21/1.49 Megabytes=6.42.
% 1.21/1.49 User_CPU=0.51, System_CPU=0.01, Wall_clock=1.
% 1.21/1.49
% 1.21/1.49 ============================== end of statistics =====================
% 1.21/1.49
% 1.21/1.49 ============================== end of search =========================
% 1.21/1.49
% 1.21/1.49 THEOREM PROVED
% 1.21/1.49 % SZS status Unsatisfiable
% 1.21/1.49
% 1.21/1.49 Exiting with 1 proof.
% 1.21/1.49
% 1.21/1.49 Process 23893 exit (max_proofs) Tue Jun 14 09:36:24 2022
% 1.21/1.49 Prover9 interrupted
%------------------------------------------------------------------------------