TSTP Solution File: GRP715-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP715-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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.67s 1.92s
% Output : Refutation 1.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP715-10 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 08:20:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.67/1.92 ============================== Prover9 ===============================
% 1.67/1.92 Prover9 (32) version 2009-11A, November 2009.
% 1.67/1.92 Process 1555 was started by sandbox2 on n019.cluster.edu,
% 1.67/1.92 Tue Jun 14 08:20:40 2022
% 1.67/1.92 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1401_n019.cluster.edu".
% 1.67/1.92 ============================== end of head ===========================
% 1.67/1.92
% 1.67/1.92 ============================== INPUT =================================
% 1.67/1.92
% 1.67/1.92 % Reading from file /tmp/Prover9_1401_n019.cluster.edu
% 1.67/1.92
% 1.67/1.92 set(prolog_style_variables).
% 1.67/1.92 set(auto2).
% 1.67/1.92 % set(auto2) -> set(auto).
% 1.67/1.92 % set(auto) -> set(auto_inference).
% 1.67/1.92 % set(auto) -> set(auto_setup).
% 1.67/1.92 % set(auto_setup) -> set(predicate_elim).
% 1.67/1.92 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.67/1.92 % set(auto) -> set(auto_limits).
% 1.67/1.92 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.67/1.92 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.67/1.92 % set(auto) -> set(auto_denials).
% 1.67/1.92 % set(auto) -> set(auto_process).
% 1.67/1.92 % set(auto2) -> assign(new_constants, 1).
% 1.67/1.92 % set(auto2) -> assign(fold_denial_max, 3).
% 1.67/1.92 % set(auto2) -> assign(max_weight, "200.000").
% 1.67/1.92 % set(auto2) -> assign(max_hours, 1).
% 1.67/1.92 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.67/1.92 % set(auto2) -> assign(max_seconds, 0).
% 1.67/1.92 % set(auto2) -> assign(max_minutes, 5).
% 1.67/1.92 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.67/1.92 % set(auto2) -> set(sort_initial_sos).
% 1.67/1.92 % set(auto2) -> assign(sos_limit, -1).
% 1.67/1.92 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.67/1.92 % set(auto2) -> assign(max_megs, 400).
% 1.67/1.92 % set(auto2) -> assign(stats, some).
% 1.67/1.92 % set(auto2) -> clear(echo_input).
% 1.67/1.92 % set(auto2) -> set(quiet).
% 1.67/1.92 % set(auto2) -> clear(print_initial_clauses).
% 1.67/1.92 % set(auto2) -> clear(print_given).
% 1.67/1.92 assign(lrs_ticks,-1).
% 1.67/1.92 assign(sos_limit,10000).
% 1.67/1.92 assign(order,kbo).
% 1.67/1.92 set(lex_order_vars).
% 1.67/1.92 clear(print_given).
% 1.67/1.92
% 1.67/1.92 % formulas(sos). % not echoed (12 formulas)
% 1.67/1.92
% 1.67/1.92 ============================== end of input ==========================
% 1.67/1.92
% 1.67/1.92 % From the command line: assign(max_seconds, 300).
% 1.67/1.92
% 1.67/1.92 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.67/1.92
% 1.67/1.92 % Formulas that are not ordinary clauses:
% 1.67/1.92
% 1.67/1.92 ============================== end of process non-clausal formulas ===
% 1.67/1.92
% 1.67/1.92 ============================== PROCESS INITIAL CLAUSES ===============
% 1.67/1.92
% 1.67/1.92 ============================== PREDICATE ELIMINATION =================
% 1.67/1.92
% 1.67/1.92 ============================== end predicate elimination =============
% 1.67/1.92
% 1.67/1.92 Auto_denials:
% 1.67/1.92 % copying label goal to answer in negative clause
% 1.67/1.92
% 1.67/1.92 Term ordering decisions:
% 1.67/1.92
% 1.67/1.92 % Assigning unary symbol minus kb_weight 0 and highest precedence (9).
% 1.67/1.92 Function symbol KB weights: unit=1. op_0=1. op_a=1. op_b=1. x0=1. mult=1. plus=1. minus=0.
% 1.67/1.92
% 1.67/1.92 ============================== end of process initial clauses ========
% 1.67/1.92
% 1.67/1.92 ============================== CLAUSES FOR SEARCH ====================
% 1.67/1.92
% 1.67/1.92 ============================== end of clauses for search =============
% 1.67/1.92
% 1.67/1.92 ============================== SEARCH ================================
% 1.67/1.92
% 1.67/1.92 % Starting search at 0.01 seconds.
% 1.67/1.92
% 1.67/1.92 ============================== PROOF =================================
% 1.67/1.92 % SZS status Unsatisfiable
% 1.67/1.92 % SZS output start Refutation
% 1.67/1.92
% 1.67/1.92 % Proof 1 at 0.92 (+ 0.02) seconds: goal.
% 1.67/1.92 % Length of proof is 37.
% 1.67/1.92 % Level of proof is 11.
% 1.67/1.92 % Maximum clause weight is 19.000.
% 1.67/1.92 % Given clauses 271.
% 1.67/1.92
% 1.67/1.92 2 mult(A,unit) = A # label(f08) # label(axiom). [assumption].
% 1.67/1.92 3 mult(unit,A) = A # label(f09) # label(axiom). [assumption].
% 1.67/1.92 4 mult(op_a,op_b) = unit # label(f10) # label(axiom). [assumption].
% 1.67/1.92 5 mult(op_b,op_a) = unit # label(f11) # label(axiom). [assumption].
% 1.67/1.92 10 mult(A,mult(B,B)) = mult(mult(A,B),B) # label(f07) # label(axiom). [assumption].
% 1.67/1.92 11 mult(mult(A,B),B) = mult(A,mult(B,B)). [copy(10),flip(a)].
% 1.67/1.92 14 mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)) # label(f06) # label(axiom). [assumption].
% 1.67/1.92 15 mult(mult(x0,op_a),op_b) != x0 # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 1.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 43 mult(op_b,mult(mult(mult(op_a,op_a),A),mult(op_a,op_a))) = mult(mult(op_a,A),mult(op_a,op_a)). [para(18(a,1),14(a,1,1,1)),flip(a)].
% 1.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 115 mult(mult(op_a,op_a),mult(mult(op_b,A),op_b)) = mult(mult(op_a,A),op_b). [para(109(a,1),14(a,1,1,1)),flip(a)].
% 1.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 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.67/1.92 1340 mult(op_b,mult(mult(mult(op_a,A),op_b),mult(op_a,op_a))) = mult(mult(A,op_b),mult(op_a,op_a)). [para(25(a,1),43(a,2,1)),rewrite([115(9)])].
% 1.67/1.92 6751 mult(mult(op_a,mult(mult(A,op_b),op_a)),op_a) = mult(mult(mult(op_a,A),op_b),mult(op_a,op_a)). [para(115(a,1),27(a,2,1)),rewrite([25(7)])].
% 1.67/1.92 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.67/1.92 6841 mult(mult(mult(op_a,A),op_b),mult(op_a,op_a)) = mult(mult(op_a,A),op_a). [back_rewrite(6751),rewrite([6816(5)]),flip(a)].
% 1.67/1.92 6887 mult(mult(A,op_b),mult(op_a,op_a)) = mult(A,op_a). [back_rewrite(1340),rewrite([6841(9),26(6)]),flip(a)].
% 1.67/1.92 7010 mult(mult(A,op_a),op_b) = A. [para(6887(a,1),14(a,1,1)),rewrite([18(9),4(7),2(6)])].
% 1.67/1.92 7011 $F # answer(goal). [resolve(7010,a,15,a)].
% 1.67/1.92
% 1.67/1.92 % SZS output end Refutation
% 1.67/1.92 ============================== end of proof ==========================
% 1.67/1.92
% 1.67/1.92 ============================== STATISTICS ============================
% 1.67/1.92
% 1.67/1.92 Given=271. Generated=25438. Kept=7007. proofs=1.
% 1.67/1.92 Usable=224. Sos=5145. Demods=3845. Limbo=3, Disabled=1646. Hints=0.
% 1.67/1.92 Megabytes=10.58.
% 1.67/1.92 User_CPU=0.92, System_CPU=0.02, Wall_clock=1.
% 1.67/1.92
% 1.67/1.92 ============================== end of statistics =====================
% 1.67/1.92
% 1.67/1.92 ============================== end of search =========================
% 1.67/1.92
% 1.67/1.92 THEOREM PROVED
% 1.67/1.92 % SZS status Unsatisfiable
% 1.67/1.92
% 1.67/1.92 Exiting with 1 proof.
% 1.67/1.92
% 1.67/1.92 Process 1555 exit (max_proofs) Tue Jun 14 08:20:41 2022
% 1.67/1.92 Prover9 interrupted
%------------------------------------------------------------------------------