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