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