TSTP Solution File: GRP710-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:44 EDT 2022
% Result : Unsatisfiable 0.75s 1.01s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.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 12:58:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.01 ============================== Prover9 ===============================
% 0.75/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.01 Process 26092 was started by sandbox on n014.cluster.edu,
% 0.75/1.01 Tue Jun 14 12:58:37 2022
% 0.75/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25939_n014.cluster.edu".
% 0.75/1.01 ============================== end of head ===========================
% 0.75/1.01
% 0.75/1.01 ============================== INPUT =================================
% 0.75/1.01
% 0.75/1.01 % Reading from file /tmp/Prover9_25939_n014.cluster.edu
% 0.75/1.01
% 0.75/1.01 set(prolog_style_variables).
% 0.75/1.01 set(auto2).
% 0.75/1.01 % set(auto2) -> set(auto).
% 0.75/1.01 % set(auto) -> set(auto_inference).
% 0.75/1.01 % set(auto) -> set(auto_setup).
% 0.75/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.01 % set(auto) -> set(auto_limits).
% 0.75/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.01 % set(auto) -> set(auto_denials).
% 0.75/1.01 % set(auto) -> set(auto_process).
% 0.75/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.01 % set(auto2) -> assign(stats, some).
% 0.75/1.01 % set(auto2) -> clear(echo_input).
% 0.75/1.01 % set(auto2) -> set(quiet).
% 0.75/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.01 % set(auto2) -> clear(print_given).
% 0.75/1.01 assign(lrs_ticks,-1).
% 0.75/1.01 assign(sos_limit,10000).
% 0.75/1.01 assign(order,kbo).
% 0.75/1.01 set(lex_order_vars).
% 0.75/1.01 clear(print_given).
% 0.75/1.01
% 0.75/1.01 % formulas(sos). % not echoed (6 formulas)
% 0.75/1.01
% 0.75/1.01 ============================== end of input ==========================
% 0.75/1.01
% 0.75/1.01 % From the command line: assign(max_seconds, 300).
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.01
% 0.75/1.01 % Formulas that are not ordinary clauses:
% 0.75/1.01
% 0.75/1.01 ============================== end of process non-clausal formulas ===
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01
% 0.75/1.01 ============================== PREDICATE ELIMINATION =================
% 0.75/1.01
% 0.75/1.01 ============================== end predicate elimination =============
% 0.75/1.01
% 0.75/1.01 Auto_denials:
% 0.75/1.01 % copying label goal to answer in negative clause
% 0.75/1.01
% 0.75/1.01 Term ordering decisions:
% 0.75/1.01
% 0.75/1.01 % Assigning unary symbol i kb_weight 0 and highest precedence (6).
% 0.75/1.01 Function symbol KB weights: unit=1. x0=1. x1=1. mult=1. i=0.
% 0.75/1.01
% 0.75/1.01 ============================== end of process initial clauses ========
% 0.75/1.01
% 0.75/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.01
% 0.75/1.01 ============================== end of clauses for search =============
% 0.75/1.01
% 0.75/1.01 ============================== SEARCH ================================
% 0.75/1.01
% 0.75/1.01 % Starting search at 0.01 seconds.
% 0.75/1.01
% 0.75/1.01 ============================== PROOF =================================
% 0.75/1.01 % SZS status Unsatisfiable
% 0.75/1.01 % SZS output start Refutation
% 0.75/1.01
% 0.75/1.01 % Proof 1 at 0.02 (+ 0.00) seconds: goal.
% 0.75/1.01 % Length of proof is 22.
% 0.75/1.01 % Level of proof is 9.
% 0.75/1.01 % Maximum clause weight is 19.000.
% 0.75/1.01 % Given clauses 29.
% 0.75/1.01
% 0.75/1.01 1 mult(A,unit) = A # label(f01) # label(axiom). [assumption].
% 0.75/1.01 2 mult(unit,A) = A # label(f02) # label(axiom). [assumption].
% 0.75/1.01 3 mult(A,i(A)) = unit # label(f04) # label(axiom). [assumption].
% 0.75/1.01 4 mult(i(A),A) = unit # label(f05) # label(axiom). [assumption].
% 0.75/1.01 5 mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C) # label(f03) # label(axiom). [assumption].
% 0.75/1.01 6 mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))). [copy(5),flip(a)].
% 0.75/1.01 7 mult(x0,A) != x1 # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.75/1.01 9 mult(mult(A,B),B) = mult(A,mult(B,B)). [para(6(a,1),1(a,1)),rewrite([1(2)]),flip(a)].
% 0.75/1.01 10 mult(mult(A,A),B) = mult(A,mult(A,B)). [para(2(a,1),6(a,1,1,1)),rewrite([2(6)])].
% 0.75/1.01 12 mult(A,mult(i(A),mult(i(A),B))) = mult(i(A),B). [para(3(a,1),6(a,1,1,1)),rewrite([2(3)]),flip(a)].
% 0.75/1.01 14 mult(i(A),mult(A,mult(A,B))) = mult(A,B). [para(4(a,1),6(a,1,1,1)),rewrite([2(2)]),flip(a)].
% 0.75/1.01 22 mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))). [back_rewrite(6),rewrite([9(2)])].
% 0.75/1.01 28 mult(A,mult(i(A),i(A))) = i(A). [para(3(a,1),9(a,1,1)),rewrite([2(3)]),flip(a)].
% 0.75/1.01 33 mult(A,mult(A,i(mult(A,A)))) = unit. [para(10(a,1),3(a,1))].
% 0.75/1.01 36 mult(A,mult(A,mult(i(mult(A,A)),i(mult(A,A))))) = i(mult(A,A)). [para(10(a,1),28(a,1))].
% 0.75/1.01 46 mult(A,i(mult(A,A))) = i(A). [para(33(a,1),14(a,1,2)),rewrite([1(3)]),flip(a)].
% 0.75/1.01 48 mult(A,mult(i(mult(A,A)),i(mult(A,A)))) = mult(i(A),i(mult(A,A))). [para(46(a,1),9(a,1,1)),flip(a)].
% 0.75/1.01 50 mult(A,mult(i(A),i(mult(A,A)))) = i(mult(A,A)). [back_rewrite(36),rewrite([48(6)])].
% 0.75/1.01 51 mult(i(x0),A) != x1 # answer(goal). [para(12(a,1),7(a,1))].
% 0.75/1.01 64 i(mult(A,A)) = mult(i(A),i(A)). [para(50(a,1),14(a,1,2,2)),rewrite([46(4),50(8)]),flip(a)].
% 0.75/1.01 91 mult(i(A),mult(A,B)) = B. [para(4(a,1),22(a,1,1)),rewrite([2(2),64(2),10(6),14(5)]),flip(a)].
% 0.75/1.01 92 $F # answer(goal). [resolve(91,a,51,a)].
% 0.75/1.01
% 0.75/1.01 % SZS output end Refutation
% 0.75/1.01 ============================== end of proof ==========================
% 0.75/1.01
% 0.75/1.01 ============================== STATISTICS ============================
% 0.75/1.01
% 0.75/1.01 Given=29. Generated=548. Kept=90. proofs=1.
% 0.75/1.01 Usable=24. Sos=37. Demods=56. Limbo=0, Disabled=34. Hints=0.
% 0.75/1.01 Megabytes=0.15.
% 0.75/1.01 User_CPU=0.02, System_CPU=0.01, Wall_clock=0.
% 0.75/1.01
% 0.75/1.01 ============================== end of statistics =====================
% 0.75/1.01
% 0.75/1.01 ============================== end of search =========================
% 0.75/1.01
% 0.75/1.01 THEOREM PROVED
% 0.75/1.01 % SZS status Unsatisfiable
% 0.75/1.01
% 0.75/1.01 Exiting with 1 proof.
% 0.75/1.01
% 0.75/1.01 Process 26092 exit (max_proofs) Tue Jun 14 12:58:37 2022
% 0.75/1.01 Prover9 interrupted
%------------------------------------------------------------------------------