TSTP Solution File: GRP710-11 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP710-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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.73s 1.05s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP710-11 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 10:31:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.05 ============================== Prover9 ===============================
% 0.73/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.05 Process 11359 was started by sandbox on n028.cluster.edu,
% 0.73/1.05 Mon Jun 13 10:31:53 2022
% 0.73/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11205_n028.cluster.edu".
% 0.73/1.05 ============================== end of head ===========================
% 0.73/1.05
% 0.73/1.05 ============================== INPUT =================================
% 0.73/1.05
% 0.73/1.05 % Reading from file /tmp/Prover9_11205_n028.cluster.edu
% 0.73/1.05
% 0.73/1.05 set(prolog_style_variables).
% 0.73/1.05 set(auto2).
% 0.73/1.05 % set(auto2) -> set(auto).
% 0.73/1.05 % set(auto) -> set(auto_inference).
% 0.73/1.05 % set(auto) -> set(auto_setup).
% 0.73/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.05 % set(auto) -> set(auto_limits).
% 0.73/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.05 % set(auto) -> set(auto_denials).
% 0.73/1.05 % set(auto) -> set(auto_process).
% 0.73/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.05 % set(auto2) -> assign(stats, some).
% 0.73/1.05 % set(auto2) -> clear(echo_input).
% 0.73/1.05 % set(auto2) -> set(quiet).
% 0.73/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.05 % set(auto2) -> clear(print_given).
% 0.73/1.05 assign(lrs_ticks,-1).
% 0.73/1.05 assign(sos_limit,10000).
% 0.73/1.05 assign(order,kbo).
% 0.73/1.05 set(lex_order_vars).
% 0.73/1.05 clear(print_given).
% 0.73/1.05
% 0.73/1.05 % formulas(sos). % not echoed (6 formulas)
% 0.73/1.05
% 0.73/1.05 ============================== end of input ==========================
% 0.73/1.05
% 0.73/1.05 % From the command line: assign(max_seconds, 300).
% 0.73/1.05
% 0.73/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.05
% 0.73/1.05 % Formulas that are not ordinary clauses:
% 0.73/1.05
% 0.73/1.05 ============================== end of process non-clausal formulas ===
% 0.73/1.05
% 0.73/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.05
% 0.73/1.05 ============================== PREDICATE ELIMINATION =================
% 0.73/1.05
% 0.73/1.05 ============================== end predicate elimination =============
% 0.73/1.05
% 0.73/1.05 Auto_denials:
% 0.73/1.05 % copying label goal to answer in negative clause
% 0.73/1.05
% 0.73/1.05 Term ordering decisions:
% 0.73/1.05
% 0.73/1.05 % Assigning unary symbol i kb_weight 0 and highest precedence (6).
% 0.73/1.05 Function symbol KB weights: unit=1. x3=1. x4=1. mult=1. i=0.
% 0.73/1.05
% 0.73/1.05 ============================== end of process initial clauses ========
% 0.73/1.05
% 0.73/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.05
% 0.73/1.05 ============================== end of clauses for search =============
% 0.73/1.05
% 0.73/1.05 ============================== SEARCH ================================
% 0.73/1.05
% 0.73/1.05 % Starting search at 0.01 seconds.
% 0.73/1.05
% 0.73/1.05 ============================== PROOF =================================
% 0.73/1.05 % SZS status Unsatisfiable
% 0.73/1.05 % SZS output start Refutation
% 0.73/1.05
% 0.73/1.05 % Proof 1 at 0.06 (+ 0.01) seconds: goal.
% 0.73/1.05 % Length of proof is 22.
% 0.73/1.05 % Level of proof is 9.
% 0.73/1.05 % Maximum clause weight is 19.000.
% 0.73/1.05 % Given clauses 52.
% 0.73/1.05
% 0.73/1.05 1 mult(A,unit) = A # label(f01) # label(axiom). [assumption].
% 0.73/1.05 2 mult(unit,A) = A # label(f02) # label(axiom). [assumption].
% 0.73/1.05 3 mult(A,i(A)) = unit # label(f04) # label(axiom). [assumption].
% 0.73/1.05 4 mult(i(A),A) = unit # label(f05) # label(axiom). [assumption].
% 0.73/1.05 5 mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C) # label(f03) # label(axiom). [assumption].
% 0.73/1.05 6 mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))). [copy(5),flip(a)].
% 0.73/1.05 7 mult(A,x4) != x3 # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.73/1.05 9 mult(mult(A,B),B) = mult(A,mult(B,B)). [para(6(a,1),1(a,1)),rewrite([1(2)]),flip(a)].
% 0.73/1.05 10 mult(mult(A,A),B) = mult(A,mult(A,B)). [para(2(a,1),6(a,1,1,1)),rewrite([2(6)])].
% 0.73/1.05 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.73/1.05 22 mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))). [back_rewrite(6),rewrite([9(2)])].
% 0.73/1.05 28 mult(A,mult(i(A),i(A))) = i(A). [para(3(a,1),9(a,1,1)),rewrite([2(3)]),flip(a)].
% 0.73/1.05 30 mult(A,mult(x4,x4)) != x3 # answer(goal). [para(9(a,1),7(a,1))].
% 0.73/1.05 33 mult(A,mult(A,i(mult(A,A)))) = unit. [para(10(a,1),3(a,1))].
% 0.73/1.05 37 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.73/1.05 55 mult(A,i(mult(A,A))) = i(A). [para(33(a,1),14(a,1,2)),rewrite([1(3)]),flip(a)].
% 0.73/1.05 57 mult(A,mult(i(mult(A,A)),i(mult(A,A)))) = mult(i(A),i(mult(A,A))). [para(55(a,1),9(a,1,1)),flip(a)].
% 0.73/1.05 59 mult(A,mult(i(A),i(mult(A,A)))) = i(mult(A,A)). [back_rewrite(37),rewrite([57(6)])].
% 0.73/1.05 79 i(mult(A,A)) = mult(i(A),i(A)). [para(59(a,1),14(a,1,2,2)),rewrite([55(4),59(8)]),flip(a)].
% 0.73/1.05 130 mult(i(A),mult(A,B)) = B. [para(4(a,1),22(a,1,1)),rewrite([2(2),79(2),10(6),14(5)]),flip(a)].
% 0.73/1.05 139 mult(A,mult(B,mult(B,mult(x4,x4)))) != x3 # answer(goal). [para(22(a,1),30(a,1))].
% 0.73/1.05 299 $F # answer(goal). [para(130(a,1),139(a,1,2,2)),rewrite([4(4),1(2)]),flip(a),xx(a)].
% 0.73/1.05
% 0.73/1.05 % SZS output end Refutation
% 0.73/1.05 ============================== end of proof ==========================
% 0.73/1.05
% 0.73/1.05 ============================== STATISTICS ============================
% 0.73/1.05
% 0.73/1.05 Given=52. Generated=1334. Kept=297. proofs=1.
% 0.73/1.05 Usable=30. Sos=126. Demods=97. Limbo=2, Disabled=145. Hints=0.
% 0.73/1.05 Megabytes=0.41.
% 0.73/1.05 User_CPU=0.06, System_CPU=0.01, Wall_clock=0.
% 0.73/1.05
% 0.73/1.05 ============================== end of statistics =====================
% 0.73/1.05
% 0.73/1.05 ============================== end of search =========================
% 0.73/1.05
% 0.73/1.05 THEOREM PROVED
% 0.73/1.05 % SZS status Unsatisfiable
% 0.73/1.05
% 0.73/1.05 Exiting with 1 proof.
% 0.73/1.05
% 0.73/1.05 Process 11359 exit (max_proofs) Mon Jun 13 10:31:53 2022
% 0.73/1.05 Prover9 interrupted
%------------------------------------------------------------------------------