TSTP Solution File: GRP715-11 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP715-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:46 EDT 2022
% Result : Unsatisfiable 1.65s 1.90s
% Output : Refutation 1.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP715-11 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 14:09:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.65/1.90 ============================== Prover9 ===============================
% 1.65/1.90 Prover9 (32) version 2009-11A, November 2009.
% 1.65/1.90 Process 8026 was started by sandbox on n023.cluster.edu,
% 1.65/1.90 Tue Jun 14 14:09:51 2022
% 1.65/1.90 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7872_n023.cluster.edu".
% 1.65/1.90 ============================== end of head ===========================
% 1.65/1.90
% 1.65/1.90 ============================== INPUT =================================
% 1.65/1.90
% 1.65/1.90 % Reading from file /tmp/Prover9_7872_n023.cluster.edu
% 1.65/1.90
% 1.65/1.90 set(prolog_style_variables).
% 1.65/1.90 set(auto2).
% 1.65/1.90 % set(auto2) -> set(auto).
% 1.65/1.90 % set(auto) -> set(auto_inference).
% 1.65/1.90 % set(auto) -> set(auto_setup).
% 1.65/1.90 % set(auto_setup) -> set(predicate_elim).
% 1.65/1.90 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.65/1.90 % set(auto) -> set(auto_limits).
% 1.65/1.90 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.65/1.90 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.65/1.90 % set(auto) -> set(auto_denials).
% 1.65/1.90 % set(auto) -> set(auto_process).
% 1.65/1.90 % set(auto2) -> assign(new_constants, 1).
% 1.65/1.90 % set(auto2) -> assign(fold_denial_max, 3).
% 1.65/1.90 % set(auto2) -> assign(max_weight, "200.000").
% 1.65/1.90 % set(auto2) -> assign(max_hours, 1).
% 1.65/1.90 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.65/1.90 % set(auto2) -> assign(max_seconds, 0).
% 1.65/1.90 % set(auto2) -> assign(max_minutes, 5).
% 1.65/1.90 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.65/1.90 % set(auto2) -> set(sort_initial_sos).
% 1.65/1.90 % set(auto2) -> assign(sos_limit, -1).
% 1.65/1.90 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.65/1.90 % set(auto2) -> assign(max_megs, 400).
% 1.65/1.90 % set(auto2) -> assign(stats, some).
% 1.65/1.90 % set(auto2) -> clear(echo_input).
% 1.65/1.90 % set(auto2) -> set(quiet).
% 1.65/1.90 % set(auto2) -> clear(print_initial_clauses).
% 1.65/1.90 % set(auto2) -> clear(print_given).
% 1.65/1.90 assign(lrs_ticks,-1).
% 1.65/1.90 assign(sos_limit,10000).
% 1.65/1.90 assign(order,kbo).
% 1.65/1.90 set(lex_order_vars).
% 1.65/1.90 clear(print_given).
% 1.65/1.90
% 1.65/1.90 % formulas(sos). % not echoed (12 formulas)
% 1.65/1.90
% 1.65/1.90 ============================== end of input ==========================
% 1.65/1.90
% 1.65/1.90 % From the command line: assign(max_seconds, 300).
% 1.65/1.90
% 1.65/1.90 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.65/1.90
% 1.65/1.90 % Formulas that are not ordinary clauses:
% 1.65/1.90
% 1.65/1.90 ============================== end of process non-clausal formulas ===
% 1.65/1.90
% 1.65/1.90 ============================== PROCESS INITIAL CLAUSES ===============
% 1.65/1.90
% 1.65/1.90 ============================== PREDICATE ELIMINATION =================
% 1.65/1.90
% 1.65/1.90 ============================== end predicate elimination =============
% 1.65/1.90
% 1.65/1.90 Auto_denials:
% 1.65/1.90 % copying label goal to answer in negative clause
% 1.65/1.90
% 1.65/1.90 Term ordering decisions:
% 1.65/1.90
% 1.65/1.90 % Assigning unary symbol minus kb_weight 0 and highest precedence (9).
% 1.65/1.90 Function symbol KB weights: unit=1. op_0=1. op_a=1. op_b=1. x0=1. mult=1. plus=1. minus=0.
% 1.65/1.90
% 1.65/1.90 ============================== end of process initial clauses ========
% 1.65/1.90
% 1.65/1.90 ============================== CLAUSES FOR SEARCH ====================
% 1.65/1.90
% 1.65/1.90 ============================== end of clauses for search =============
% 1.65/1.90
% 1.65/1.90 ============================== SEARCH ================================
% 1.65/1.90
% 1.65/1.90 % Starting search at 0.01 seconds.
% 1.65/1.90
% 1.65/1.90 ============================== PROOF =================================
% 1.65/1.90 % SZS status Unsatisfiable
% 1.65/1.90 % SZS output start Refutation
% 1.65/1.90
% 1.65/1.90 % Proof 1 at 0.85 (+ 0.02) seconds: goal.
% 1.65/1.90 % Length of proof is 30.
% 1.65/1.90 % Level of proof is 8.
% 1.65/1.90 % Maximum clause weight is 19.000.
% 1.65/1.90 % Given clauses 268.
% 1.65/1.90
% 1.65/1.90 2 mult(A,unit) = A # label(f08) # label(axiom). [assumption].
% 1.65/1.90 3 mult(unit,A) = A # label(f09) # label(axiom). [assumption].
% 1.65/1.90 4 mult(op_a,op_b) = unit # label(f10) # label(axiom). [assumption].
% 1.65/1.90 5 mult(op_b,op_a) = unit # label(f11) # label(axiom). [assumption].
% 1.65/1.90 10 mult(A,mult(B,B)) = mult(mult(A,B),B) # label(f07) # label(axiom). [assumption].
% 1.65/1.90 11 mult(mult(A,B),B) = mult(A,mult(B,B)). [copy(10),flip(a)].
% 1.65/1.90 14 mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)) # label(f06) # label(axiom). [assumption].
% 1.65/1.90 15 mult(mult(x0,op_b),op_a) != x0 # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 1.65/1.90 17 mult(op_a,mult(op_b,op_b)) = op_b. [para(4(a,1),11(a,1,1)),rewrite([3(3)]),flip(a)].
% 1.65/1.90 18 mult(op_b,mult(op_a,op_a)) = op_a. [para(5(a,1),11(a,1,1)),rewrite([3(3)]),flip(a)].
% 1.65/1.90 25 mult(op_a,mult(mult(op_b,A),op_b)) = mult(A,op_b). [para(4(a,1),14(a,1,1,1)),rewrite([3(2)]),flip(a)].
% 1.65/1.90 26 mult(op_b,mult(mult(op_a,A),op_a)) = mult(A,op_a). [para(5(a,1),14(a,1,1,1)),rewrite([3(2)]),flip(a)].
% 1.65/1.90 27 mult(mult(A,mult(mult(B,C),B)),B) = mult(mult(mult(A,B),C),mult(B,B)). [para(14(a,1),11(a,1,1))].
% 1.65/1.90 28 mult(mult(A,B),mult(B,B)) = mult(A,mult(B,mult(B,B))). [para(14(a,1),11(a,1)),rewrite([11(2)]),flip(a)].
% 1.65/1.90 34 mult(mult(A,mult(mult(B,C),B)),C) = mult(mult(A,B),mult(mult(C,B),C)). [para(14(a,1),14(a,1,1))].
% 1.65/1.90 106 mult(op_a,mult(op_b,mult(op_b,op_b))) = mult(op_b,op_b). [para(11(a,1),25(a,1,2))].
% 1.65/1.90 109 mult(mult(op_a,op_a),op_b) = op_a. [para(18(a,1),25(a,1,2,1)),rewrite([4(4),2(3)]),flip(a)].
% 1.65/1.90 113 mult(mult(op_a,op_a),mult(op_b,op_b)) = unit. [para(109(a,1),11(a,1,1)),rewrite([4(3)]),flip(a)].
% 1.65/1.90 117 mult(mult(op_a,op_a),mult(op_b,mult(op_b,mult(op_b,op_b)))) = mult(op_b,op_b). [para(113(a,1),11(a,1,1)),rewrite([3(5),28(13)]),flip(a)].
% 1.65/1.90 138 mult(mult(op_b,op_b),op_a) = op_b. [para(17(a,1),26(a,1,2,1)),rewrite([5(4),2(3)]),flip(a)].
% 1.65/1.91 144 mult(mult(op_b,op_b),mult(op_a,op_a)) = unit. [para(138(a,1),11(a,1,1)),rewrite([5(3)]),flip(a)].
% 1.65/1.91 253 mult(mult(op_b,mult(op_b,op_b)),op_a) = mult(op_b,op_b). [para(106(a,1),26(a,1,2,1)),rewrite([138(6)]),flip(a)].
% 1.65/1.91 254 mult(mult(mult(A,op_a),mult(op_b,mult(op_b,op_b))),mult(op_a,op_a)) = mult(mult(A,op_b),op_a). [para(106(a,1),27(a,1,1,2,1)),rewrite([138(5)]),flip(a)].
% 1.65/1.91 274 mult(mult(op_a,op_a),mult(op_b,mult(op_b,op_b))) = op_b. [para(109(a,1),28(a,1,1)),rewrite([17(5)]),flip(a)].
% 1.65/1.91 312 mult(mult(op_b,mult(op_b,op_b)),mult(op_a,op_a)) = op_b. [para(253(a,1),11(a,1,1)),rewrite([138(5)]),flip(a)].
% 1.65/1.91 655 mult(mult(A,op_a),mult(op_b,mult(op_b,op_b))) = mult(A,mult(op_b,op_b)). [para(17(a,1),34(a,1,1,2,1)),rewrite([5(3),2(2),138(11)]),flip(a)].
% 1.65/1.91 705 mult(mult(A,mult(op_a,op_a)),mult(op_b,mult(op_b,mult(op_b,op_b)))) = mult(A,mult(op_b,op_b)). [para(274(a,1),34(a,1,1,2,1)),rewrite([18(5),655(8),312(17)]),flip(a)].
% 1.65/1.91 739 mult(mult(A,mult(op_b,op_b)),mult(op_a,op_a)) = mult(mult(A,op_b),op_a). [back_rewrite(254),rewrite([655(8)])].
% 1.65/1.91 6816 mult(mult(A,op_b),op_a) = A. [para(117(a,1),14(a,2,2,1)),rewrite([705(12),739(8),144(11),2(6)])].
% 1.65/1.91 6817 $F # answer(goal). [resolve(6816,a,15,a)].
% 1.65/1.91
% 1.65/1.91 % SZS output end Refutation
% 1.65/1.91 ============================== end of proof ==========================
% 1.65/1.91
% 1.65/1.91 ============================== STATISTICS ============================
% 1.65/1.91
% 1.65/1.91 Given=268. Generated=24983. Kept=6813. proofs=1.
% 1.65/1.91 Usable=229. Sos=5136. Demods=3866. Limbo=3, Disabled=1456. Hints=0.
% 1.65/1.91 Megabytes=10.39.
% 1.65/1.91 User_CPU=0.85, System_CPU=0.02, Wall_clock=1.
% 1.65/1.91
% 1.65/1.91 ============================== end of statistics =====================
% 1.65/1.91
% 1.65/1.91 ============================== end of search =========================
% 1.65/1.91
% 1.65/1.91 THEOREM PROVED
% 1.65/1.91 % SZS status Unsatisfiable
% 1.65/1.91
% 1.65/1.91 Exiting with 1 proof.
% 1.65/1.91
% 1.65/1.91 Process 8026 exit (max_proofs) Tue Jun 14 14:09:52 2022
% 1.65/1.91 Prover9 interrupted
%------------------------------------------------------------------------------