TSTP Solution File: GRP044-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP044-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:55 EDT 2022
% Result : Unsatisfiable 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : GRP044-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 02:54:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 14392 was started by sandbox2 on n016.cluster.edu,
% 0.42/0.99 Tue Jun 14 02:54:46 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14073_n016.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_14073_n016.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (10 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99 1 -equalish(A,B) | -product(C,D,A) | product(C,D,B) # label(product_substitution3) # label(axiom). [assumption].
% 0.42/0.99 2 equalish(a,b) # label(a_equals_b) # label(hypothesis). [assumption].
% 0.42/0.99 3 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(total_function2) # label(axiom). [assumption].
% 0.42/0.99 Derived: -product(A,B,a) | product(A,B,b). [resolve(1,a,2,a)].
% 0.42/0.99 Derived: -product(A,B,C) | product(A,B,D) | -product(E,F,C) | -product(E,F,D). [resolve(1,a,3,c)].
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials:
% 0.42/0.99 % copying label prove_product_with_b to answer in negative clause
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99
% 0.42/0.99 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.42/0.99 Function symbol KB weights: a=1. identity=1. b=1. c=1. result=1. multiply=1. inverse=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.01 (+ 0.00) seconds: prove_product_with_b.
% 0.42/0.99 % Length of proof is 10.
% 0.42/0.99 % Level of proof is 3.
% 0.42/0.99 % Maximum clause weight is 16.000.
% 0.42/0.99 % Given clauses 8.
% 0.42/0.99
% 0.42/0.99 1 -equalish(A,B) | -product(C,D,A) | product(C,D,B) # label(product_substitution3) # label(axiom). [assumption].
% 0.42/0.99 2 equalish(a,b) # label(a_equals_b) # label(hypothesis). [assumption].
% 0.42/0.99 4 product(identity,A,A) # label(left_identity) # label(axiom). [assumption].
% 0.42/0.99 5 product(a,c,result) # label(product_with_a) # label(hypothesis). [assumption].
% 0.42/0.99 8 -product(b,c,result) # label(prove_product_with_b) # label(negated_conjecture) # answer(prove_product_with_b). [assumption].
% 0.42/0.99 10 -product(A,B,C) | -product(B,D,E) | -product(A,E,F) | product(C,D,F) # label(associativity2) # label(axiom). [assumption].
% 0.42/0.99 11 -product(A,B,a) | product(A,B,b). [resolve(1,a,2,a)].
% 0.42/0.99 56 -product(identity,a,b) # answer(prove_product_with_b). [ur(10,b,5,a,c,4,a,d,8,a)].
% 0.42/0.99 59 product(identity,a,b). [ur(11,a,4,a)].
% 0.42/0.99 60 $F # answer(prove_product_with_b). [resolve(59,a,56,a)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=8. Generated=68. Kept=56. proofs=1.
% 0.42/0.99 Usable=8. Sos=47. Demods=0. Limbo=0, Disabled=12. Hints=0.
% 0.42/0.99 Megabytes=0.06.
% 0.42/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 14392 exit (max_proofs) Tue Jun 14 02:54:46 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------