TSTP Solution File: GRP665-12 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:26 EDT 2022
% Result : Unsatisfiable 0.52s 0.79s
% Output : Refutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% 0.00/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Mon Jun 13 19:47:27 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.52/0.79 ============================== Prover9 ===============================
% 0.52/0.79 Prover9 (32) version 2009-11A, November 2009.
% 0.52/0.79 Process 6074 was started by sandbox on n032.cluster.edu,
% 0.52/0.79 Mon Jun 13 19:47:27 2022
% 0.52/0.79 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5722_n032.cluster.edu".
% 0.52/0.79 ============================== end of head ===========================
% 0.52/0.79
% 0.52/0.79 ============================== INPUT =================================
% 0.52/0.79
% 0.52/0.79 % Reading from file /tmp/Prover9_5722_n032.cluster.edu
% 0.52/0.79
% 0.52/0.79 set(prolog_style_variables).
% 0.52/0.79 set(auto2).
% 0.52/0.79 % set(auto2) -> set(auto).
% 0.52/0.79 % set(auto) -> set(auto_inference).
% 0.52/0.79 % set(auto) -> set(auto_setup).
% 0.52/0.79 % set(auto_setup) -> set(predicate_elim).
% 0.52/0.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.52/0.79 % set(auto) -> set(auto_limits).
% 0.52/0.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.52/0.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.52/0.79 % set(auto) -> set(auto_denials).
% 0.52/0.79 % set(auto) -> set(auto_process).
% 0.52/0.79 % set(auto2) -> assign(new_constants, 1).
% 0.52/0.79 % set(auto2) -> assign(fold_denial_max, 3).
% 0.52/0.79 % set(auto2) -> assign(max_weight, "200.000").
% 0.52/0.79 % set(auto2) -> assign(max_hours, 1).
% 0.52/0.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.52/0.79 % set(auto2) -> assign(max_seconds, 0).
% 0.52/0.79 % set(auto2) -> assign(max_minutes, 5).
% 0.52/0.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.52/0.79 % set(auto2) -> set(sort_initial_sos).
% 0.52/0.79 % set(auto2) -> assign(sos_limit, -1).
% 0.52/0.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.52/0.79 % set(auto2) -> assign(max_megs, 400).
% 0.52/0.79 % set(auto2) -> assign(stats, some).
% 0.52/0.79 % set(auto2) -> clear(echo_input).
% 0.52/0.79 % set(auto2) -> set(quiet).
% 0.52/0.79 % set(auto2) -> clear(print_initial_clauses).
% 0.52/0.79 % set(auto2) -> clear(print_given).
% 0.52/0.79 assign(lrs_ticks,-1).
% 0.52/0.79 assign(sos_limit,10000).
% 0.52/0.79 assign(order,kbo).
% 0.52/0.79 set(lex_order_vars).
% 0.52/0.79 clear(print_given).
% 0.52/0.79
% 0.52/0.79 % formulas(sos). % not echoed (10 formulas)
% 0.52/0.79
% 0.52/0.79 ============================== end of input ==========================
% 0.52/0.79
% 0.52/0.79 % From the command line: assign(max_seconds, 300).
% 0.52/0.79
% 0.52/0.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.52/0.79
% 0.52/0.79 % Formulas that are not ordinary clauses:
% 0.52/0.79
% 0.52/0.79 ============================== end of process non-clausal formulas ===
% 0.52/0.79
% 0.52/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.52/0.79
% 0.52/0.79 ============================== PREDICATE ELIMINATION =================
% 0.52/0.79
% 0.52/0.79 ============================== end predicate elimination =============
% 0.52/0.79
% 0.52/0.79 Auto_denials:
% 0.52/0.79 % copying label goal to answer in negative clause
% 0.52/0.79
% 0.52/0.79 Term ordering decisions:
% 0.52/0.79 Function symbol KB weights: op_c=1. unit=1. x0=1. x1=1. mult=1. ld=1. rd=1.
% 0.52/0.79
% 0.52/0.79 ============================== end of process initial clauses ========
% 0.52/0.79
% 0.52/0.79 ============================== CLAUSES FOR SEARCH ====================
% 0.52/0.79
% 0.52/0.79 ============================== end of clauses for search =============
% 0.52/0.79
% 0.52/0.79 ============================== SEARCH ================================
% 0.52/0.79
% 0.52/0.79 % Starting search at 0.01 seconds.
% 0.52/0.79
% 0.52/0.79 ============================== PROOF =================================
% 0.52/0.79 % SZS status Unsatisfiable
% 0.52/0.79 % SZS output start Refutation
% 0.52/0.79
% 0.52/0.79 % Proof 1 at 0.01 (+ 0.00) seconds: goal.
% 0.52/0.79 % Length of proof is 8.
% 0.52/0.79 % Level of proof is 3.
% 0.52/0.79 % Maximum clause weight is 15.000.
% 0.52/0.79 % Given clauses 22.
% 0.52/0.79
% 0.52/0.79 6 rd(mult(A,B),B) = A # label(f04) # label(axiom). [assumption].
% 0.52/0.79 7 mult(op_c,A) = mult(A,op_c) # label(f09) # label(axiom). [assumption].
% 0.52/0.79 8 mult(A,mult(B,C)) = mult(rd(mult(A,B),A),mult(A,C)) # label(f07) # label(axiom). [assumption].
% 0.52/0.79 9 mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)). [copy(8),flip(a)].
% 0.52/0.79 12 mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.52/0.79 13 mult(x0,mult(op_c,x1)) != mult(op_c,mult(x0,x1)) # answer(goal). [copy(12),rewrite([7(5,R),7(9,R)]),flip(a)].
% 0.52/0.79 27 mult(op_c,mult(A,B)) = mult(A,mult(B,op_c)). [para(7(a,1),9(a,1,1,1)),rewrite([6(4),7(2)]),flip(a)].
% 0.52/0.79 62 $F # answer(goal). [para(27(a,1),13(a,2)),rewrite([7(9,R)]),xx(a)].
% 0.52/0.79
% 0.52/0.79 % SZS output end Refutation
% 0.52/0.79 ============================== end of proof ==========================
% 0.52/0.79
% 0.52/0.79 ============================== STATISTICS ============================
% 0.52/0.79
% 0.52/0.79 Given=22. Generated=230. Kept=58. proofs=1.
% 0.52/0.79 Usable=21. Sos=25. Demods=53. Limbo=8, Disabled=14. Hints=0.
% 0.52/0.79 Megabytes=0.10.
% 0.52/0.79 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.52/0.79
% 0.52/0.79 ============================== end of statistics =====================
% 0.52/0.79
% 0.52/0.79 ============================== end of search =========================
% 0.52/0.79
% 0.52/0.79 THEOREM PROVED
% 0.52/0.79 % SZS status Unsatisfiable
% 0.52/0.79
% 0.52/0.79 Exiting with 1 proof.
% 0.52/0.79
% 0.52/0.79 Process 6074 exit (max_proofs) Mon Jun 13 19:47:27 2022
% 0.52/0.79 Prover9 interrupted
%------------------------------------------------------------------------------