TSTP Solution File: GRP008-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP008-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:16:40 EDT 2022
% Result : Unsatisfiable 0.41s 1.00s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n011.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 : Mon Jun 13 17:52:19 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 24697 was started by sandbox2 on n011.cluster.edu,
% 0.41/1.00 Mon Jun 13 17:52:19 2022
% 0.41/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24542_n011.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_24542_n011.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (12 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00
% 0.41/1.00 ============================== end of process non-clausal formulas ===
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.00
% 0.41/1.00 ============================== PREDICATE ELIMINATION =================
% 0.41/1.00
% 0.41/1.00 ============================== end predicate elimination =============
% 0.41/1.00
% 0.41/1.00 Auto_denials: (non-Horn, no changes).
% 0.41/1.00
% 0.41/1.00 Term ordering decisions:
% 0.41/1.00 Function symbol KB weights: identity=1. multiply=1. h=1. j=1. inverse=1.
% 0.41/1.00
% 0.41/1.00 ============================== end of process initial clauses ========
% 0.41/1.00
% 0.41/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.00
% 0.41/1.00 ============================== end of clauses for search =============
% 0.41/1.00
% 0.41/1.00 ============================== SEARCH ================================
% 0.41/1.00
% 0.41/1.00 % Starting search at 0.01 seconds.
% 0.41/1.00
% 0.41/1.00 ============================== PROOF =================================
% 0.41/1.00 % SZS status Unsatisfiable
% 0.41/1.00 % SZS output start Refutation
% 0.41/1.00
% 0.41/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.41/1.00 % Length of proof is 17.
% 0.41/1.00 % Level of proof is 6.
% 0.41/1.00 % Maximum clause weight is 16.000.
% 0.41/1.00 % Given clauses 50.
% 0.41/1.00
% 0.41/1.00 1 product(identity,A,A) # label(left_identity) # label(axiom). [assumption].
% 0.41/1.00 2 product(A,identity,A) # label(right_identity) # label(axiom). [assumption].
% 0.41/1.00 5 product(A,B,multiply(A,B)) # label(total_function1) # label(axiom). [assumption].
% 0.41/1.00 6 product(j(A),A,h(A)) | product(A,j(A),h(A)) | q(A) # label(unknown_meaning3) # label(axiom). [assumption].
% 0.41/1.00 7 -q(identity) # label(prove_identity_is_q) # label(negated_conjecture). [assumption].
% 0.41/1.00 9 -product(A,B,C) | -product(A,B,D) | C = D # label(total_function2) # label(axiom). [assumption].
% 0.41/1.00 10 -product(j(A),A,h(A)) | -product(A,j(A),h(A)) | q(A) # label(unknown_meaning4) # label(axiom). [assumption].
% 0.41/1.00 11 -product(A,B,C) | -product(B,D,E) | -product(C,D,F) | product(A,E,F) # label(associativity1) # label(axiom). [assumption].
% 0.41/1.00 26 -product(identity,A,B) | A = B. [resolve(9,a,1,a)].
% 0.41/1.00 28 -product(identity,A,B) | B = A. [resolve(9,b,1,a)].
% 0.41/1.00 30 -product(A,B,C) | -product(multiply(D,A),B,E) | product(D,C,E). [resolve(11,a,5,a)].
% 0.41/1.00 94 multiply(identity,A) = A. [resolve(26,a,5,a),flip(a)].
% 0.41/1.00 112 -product(multiply(A,B),identity,C) | product(A,B,C). [resolve(30,a,2,a)].
% 0.41/1.00 122 -product(A,identity,B) | product(identity,A,B). [para(94(a,1),112(a,1))].
% 0.41/1.00 125 product(identity,j(identity),h(identity)). [resolve(122,a,6,a),merge(b),unit_del(b,7)].
% 0.41/1.00 132 j(identity) = h(identity). [resolve(125,a,28,a),flip(a)].
% 0.41/1.00 133 $F. [ur(10,b,125,a,c,7,a),rewrite([132(2)]),unit_del(a,2)].
% 0.41/1.00
% 0.41/1.00 % SZS output end Refutation
% 0.41/1.00 ============================== end of proof ==========================
% 0.41/1.00
% 0.41/1.00 ============================== STATISTICS ============================
% 0.41/1.00
% 0.41/1.00 Given=50. Generated=333. Kept=132. proofs=1.
% 0.41/1.00 Usable=49. Sos=66. Demods=7. Limbo=3, Disabled=26. Hints=0.
% 0.41/1.00 Megabytes=0.11.
% 0.41/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/1.00
% 0.41/1.00 ============================== end of statistics =====================
% 0.41/1.00
% 0.41/1.00 ============================== end of search =========================
% 0.41/1.00
% 0.41/1.00 THEOREM PROVED
% 0.41/1.00 % SZS status Unsatisfiable
% 0.41/1.00
% 0.41/1.00 Exiting with 1 proof.
% 0.41/1.00
% 0.41/1.00 Process 24697 exit (max_proofs) Mon Jun 13 17:52:19 2022
% 0.41/1.00 Prover9 interrupted
%------------------------------------------------------------------------------