TSTP Solution File: GRP657-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:21 EDT 2022
% Result : Unsatisfiable 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 12:21:24 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 5310 was started by sandbox2 on n028.cluster.edu,
% 0.43/0.98 Tue Jun 14 12:21:24 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5157_n028.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_5157_n028.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (6 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials:
% 0.43/0.98 % copying label goal to answer in negative clause
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights: mult=1. ld=1. rd=1. tuple=1. x1=1. x1_2=1.
% 0.43/0.98
% 0.43/0.98 ============================== end of process initial clauses ========
% 0.43/0.98
% 0.43/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98
% 0.43/0.98 ============================== end of clauses for search =============
% 0.43/0.98
% 0.43/0.98 ============================== SEARCH ================================
% 0.43/0.98
% 0.43/0.98 % Starting search at 0.01 seconds.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.03 (+ 0.00) seconds: goal.
% 0.43/0.98 % Length of proof is 16.
% 0.43/0.98 % Level of proof is 9.
% 0.43/0.98 % Maximum clause weight is 23.000.
% 0.43/0.98 % Given clauses 20.
% 0.43/0.98
% 0.43/0.98 1 mult(A,ld(A,B)) = B # label(f01) # label(axiom). [assumption].
% 0.43/0.98 2 ld(A,mult(A,B)) = B # label(f02) # label(axiom). [assumption].
% 0.43/0.98 4 rd(mult(A,B),B) = A # label(f04) # label(axiom). [assumption].
% 0.43/0.98 5 mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)) # label(f05) # label(axiom). [assumption].
% 0.43/0.98 6 tuple(mult(A,x1(A)),mult(x1_2(A),A)) != tuple(x1(A),x1_2(A)) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.43/0.98 9 mult(A,mult(mult(ld(A,B),C),A)) = mult(B,mult(C,A)). [para(1(a,1),5(a,1,1)),flip(a)].
% 0.43/0.98 18 ld(A,mult(B,mult(C,A))) = mult(mult(ld(A,B),C),A). [para(9(a,1),2(a,1,2))].
% 0.43/0.98 59 mult(mult(ld(A,A),B),A) = mult(B,A). [para(18(a,1),2(a,1))].
% 0.43/0.98 70 mult(ld(A,A),B) = B. [para(59(a,1),4(a,1,1)),rewrite([4(2)]),flip(a)].
% 0.43/0.98 93 rd(A,A) = ld(B,B). [para(70(a,1),4(a,1,1))].
% 0.43/0.98 96 tuple(x1(ld(A,A)),mult(x1_2(ld(A,A)),ld(A,A))) != tuple(x1(ld(A,A)),x1_2(ld(A,A))) # answer(goal). [para(70(a,1),6(a,1,1))].
% 0.43/0.98 106 rd(A,A) = c_0. [new_symbol(93)].
% 0.43/0.98 108 ld(A,A) = c_0. [back_rewrite(93),rewrite([106(1)]),flip(a)].
% 0.43/0.98 115 tuple(x1(c_0),mult(x1_2(c_0),c_0)) != tuple(x1(c_0),x1_2(c_0)) # answer(goal). [back_rewrite(96),rewrite([108(1),108(3),108(5),108(8),108(10)])].
% 0.43/0.98 119 mult(A,c_0) = A. [para(108(a,1),1(a,1,2))].
% 0.43/0.98 121 $F # answer(goal). [back_rewrite(115),rewrite([119(6)]),xx(a)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=20. Generated=433. Kept=120. proofs=1.
% 0.43/0.98 Usable=16. Sos=75. Demods=91. Limbo=2, Disabled=33. Hints=0.
% 0.43/0.98 Megabytes=0.27.
% 0.43/0.98 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 5310 exit (max_proofs) Tue Jun 14 12:21:24 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------