TSTP Solution File: GRP686-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP686-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:36 EDT 2022
% Result : Unsatisfiable 1.38s 1.66s
% Output : Refutation 1.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP686-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 18:03:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.38/1.66 ============================== Prover9 ===============================
% 1.38/1.66 Prover9 (32) version 2009-11A, November 2009.
% 1.38/1.66 Process 5451 was started by sandbox on n017.cluster.edu,
% 1.38/1.66 Mon Jun 13 18:03:38 2022
% 1.38/1.66 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5297_n017.cluster.edu".
% 1.38/1.66 ============================== end of head ===========================
% 1.38/1.66
% 1.38/1.66 ============================== INPUT =================================
% 1.38/1.66
% 1.38/1.66 % Reading from file /tmp/Prover9_5297_n017.cluster.edu
% 1.38/1.66
% 1.38/1.66 set(prolog_style_variables).
% 1.38/1.66 set(auto2).
% 1.38/1.66 % set(auto2) -> set(auto).
% 1.38/1.66 % set(auto) -> set(auto_inference).
% 1.38/1.66 % set(auto) -> set(auto_setup).
% 1.38/1.66 % set(auto_setup) -> set(predicate_elim).
% 1.38/1.66 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.38/1.66 % set(auto) -> set(auto_limits).
% 1.38/1.66 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.38/1.66 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.38/1.66 % set(auto) -> set(auto_denials).
% 1.38/1.66 % set(auto) -> set(auto_process).
% 1.38/1.66 % set(auto2) -> assign(new_constants, 1).
% 1.38/1.66 % set(auto2) -> assign(fold_denial_max, 3).
% 1.38/1.66 % set(auto2) -> assign(max_weight, "200.000").
% 1.38/1.66 % set(auto2) -> assign(max_hours, 1).
% 1.38/1.66 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.38/1.66 % set(auto2) -> assign(max_seconds, 0).
% 1.38/1.66 % set(auto2) -> assign(max_minutes, 5).
% 1.38/1.66 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.38/1.66 % set(auto2) -> set(sort_initial_sos).
% 1.38/1.66 % set(auto2) -> assign(sos_limit, -1).
% 1.38/1.66 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.38/1.66 % set(auto2) -> assign(max_megs, 400).
% 1.38/1.66 % set(auto2) -> assign(stats, some).
% 1.38/1.66 % set(auto2) -> clear(echo_input).
% 1.38/1.66 % set(auto2) -> set(quiet).
% 1.38/1.66 % set(auto2) -> clear(print_initial_clauses).
% 1.38/1.66 % set(auto2) -> clear(print_given).
% 1.38/1.66 assign(lrs_ticks,-1).
% 1.38/1.66 assign(sos_limit,10000).
% 1.38/1.66 assign(order,kbo).
% 1.38/1.66 set(lex_order_vars).
% 1.38/1.66 clear(print_given).
% 1.38/1.66
% 1.38/1.66 % formulas(sos). % not echoed (8 formulas)
% 1.38/1.66
% 1.38/1.66 ============================== end of input ==========================
% 1.38/1.66
% 1.38/1.66 % From the command line: assign(max_seconds, 300).
% 1.38/1.66
% 1.38/1.66 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.38/1.66
% 1.38/1.66 % Formulas that are not ordinary clauses:
% 1.38/1.66
% 1.38/1.66 ============================== end of process non-clausal formulas ===
% 1.38/1.66
% 1.38/1.66 ============================== PROCESS INITIAL CLAUSES ===============
% 1.38/1.66
% 1.38/1.66 ============================== PREDICATE ELIMINATION =================
% 1.38/1.66
% 1.38/1.66 ============================== end predicate elimination =============
% 1.38/1.66
% 1.38/1.66 Auto_denials:
% 1.38/1.66 % copying label goals to answer in negative clause
% 1.38/1.66
% 1.38/1.66 Term ordering decisions:
% 1.38/1.66 Function symbol KB weights: unit=1. a=1. b=1. c=1. mult=1. ld=1. rd=1.
% 1.38/1.66
% 1.38/1.66 ============================== end of process initial clauses ========
% 1.38/1.66
% 1.38/1.66 ============================== CLAUSES FOR SEARCH ====================
% 1.38/1.66
% 1.38/1.66 ============================== end of clauses for search =============
% 1.38/1.66
% 1.38/1.66 ============================== SEARCH ================================
% 1.38/1.66
% 1.38/1.66 % Starting search at 0.01 seconds.
% 1.38/1.66
% 1.38/1.66 ============================== PROOF =================================
% 1.38/1.66 % SZS status Unsatisfiable
% 1.38/1.66 % SZS output start Refutation
% 1.38/1.66
% 1.38/1.66 % Proof 1 at 0.70 (+ 0.01) seconds: goals.
% 1.38/1.66 % Length of proof is 50.
% 1.38/1.66 % Level of proof is 19.
% 1.38/1.66 % Maximum clause weight is 19.000.
% 1.38/1.66 % Given clauses 145.
% 1.38/1.66
% 1.38/1.66 1 mult(A,unit) = A # label(c05) # label(axiom). [assumption].
% 1.38/1.66 2 mult(unit,A) = A # label(c06) # label(axiom). [assumption].
% 1.38/1.66 3 mult(A,ld(A,B)) = B # label(c01) # label(axiom). [assumption].
% 1.38/1.66 4 ld(A,mult(A,B)) = B # label(c02) # label(axiom). [assumption].
% 1.38/1.66 5 mult(rd(A,B),B) = A # label(c03) # label(axiom). [assumption].
% 1.38/1.66 6 rd(mult(A,B),B) = A # label(c04) # label(axiom). [assumption].
% 1.38/1.66 7 mult(A,mult(B,mult(B,C))) = mult(mult(A,mult(B,B)),C) # label(c07) # label(axiom). [assumption].
% 1.38/1.66 8 mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))). [copy(7),flip(a)].
% 1.38/1.66 9 mult(mult(a,a),mult(b,c)) != mult(mult(a,mult(a,b)),c) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 1.38/1.66 10 mult(mult(a,mult(a,b)),c) != mult(mult(a,a),mult(b,c)) # answer(goals). [copy(9),flip(a)].
% 1.38/1.66 14 ld(rd(A,B),A) = B. [para(5(a,1),4(a,1,2))].
% 1.38/1.66 16 rd(A,ld(B,A)) = B. [para(3(a,1),6(a,1,1))].
% 1.38/1.66 17 mult(mult(A,A),B) = mult(A,mult(A,B)). [para(2(a,1),8(a,1,1)),rewrite([2(6)])].
% 1.38/1.66 18 mult(A,mult(B,mult(B,ld(mult(A,mult(B,B)),C)))) = C. [para(8(a,1),3(a,1))].
% 1.38/1.66 21 rd(mult(A,mult(B,mult(B,C))),C) = mult(A,mult(B,B)). [para(8(a,1),6(a,1,1))].
% 1.38/1.66 24 mult(mult(a,mult(a,b)),c) != mult(a,mult(a,mult(b,c))) # answer(goals). [back_rewrite(10),rewrite([17(14)])].
% 1.38/1.66 27 rd(mult(A,mult(A,B)),B) = mult(A,A). [para(17(a,1),6(a,1,1))].
% 1.38/1.66 28 mult(mult(A,mult(A,mult(B,B))),C) = mult(A,mult(A,mult(B,mult(B,C)))). [para(17(a,1),8(a,1,1)),rewrite([17(8)])].
% 1.38/1.66 36 rd(mult(A,B),ld(A,B)) = mult(A,A). [para(3(a,1),27(a,1,1,2))].
% 1.38/1.66 40 mult(A,mult(A,ld(mult(B,mult(A,A)),C))) = ld(B,C). [para(18(a,1),4(a,1,2)),flip(a)].
% 1.38/1.66 49 rd(A,ld(A,unit)) = mult(A,A). [para(1(a,1),36(a,1,1))].
% 1.38/1.66 81 rd(mult(A,mult(B,C)),ld(B,C)) = mult(A,mult(B,B)). [para(3(a,1),21(a,1,1,2,2))].
% 1.38/1.66 93 ld(rd(A,mult(B,B)),C) = mult(B,mult(B,ld(A,C))). [para(5(a,1),40(a,1,2,2,1)),flip(a)].
% 1.38/1.66 501 rd(mult(A,B),ld(B,unit)) = mult(A,mult(B,B)). [para(1(a,1),81(a,1,1,2))].
% 1.38/1.66 521 mult(A,mult(ld(A,B),ld(A,B))) = rd(B,ld(ld(A,B),unit)). [para(3(a,1),501(a,1,1)),flip(a)].
% 1.38/1.66 522 mult(rd(A,B),mult(B,B)) = rd(A,ld(B,unit)). [para(5(a,1),501(a,1,1)),flip(a)].
% 1.38/1.66 582 rd(A,ld(ld(A,unit),unit)) = unit. [para(49(a,1),522(a,1,1)),rewrite([17(7),521(6),16(6),3(3)]),flip(a)].
% 1.38/1.66 634 ld(ld(A,unit),unit) = A. [para(582(a,1),5(a,1,1)),rewrite([2(6)])].
% 1.38/1.66 637 mult(ld(A,unit),A) = unit. [para(634(a,1),3(a,1,2))].
% 1.38/1.66 638 rd(unit,A) = ld(A,unit). [para(14(a,1),634(a,1,1)),flip(a)].
% 1.38/1.66 693 mult(ld(mult(A,B),unit),mult(A,A)) = ld(ld(A,B),unit). [para(637(a,1),81(a,1,1)),rewrite([638(3)]),flip(a)].
% 1.38/1.66 694 mult(ld(A,unit),mult(A,A)) = A. [para(637(a,1),501(a,1,1)),rewrite([16(4)]),flip(a)].
% 1.38/1.66 711 mult(ld(A,unit),mult(A,mult(A,B))) = mult(A,B). [para(694(a,1),8(a,1,1)),flip(a)].
% 1.38/1.66 717 mult(ld(A,unit),mult(A,B)) = B. [para(694(a,1),28(a,1,1,2)),rewrite([637(3),2(2),711(7)]),flip(a)].
% 1.38/1.66 724 mult(ld(A,unit),B) = ld(A,B). [para(3(a,1),717(a,1,2))].
% 1.38/1.66 725 ld(ld(A,unit),B) = mult(A,B). [para(717(a,1),4(a,1,2))].
% 1.38/1.66 726 rd(A,mult(B,A)) = ld(B,unit). [para(717(a,1),6(a,1,1))].
% 1.38/1.66 730 ld(mult(A,B),mult(A,A)) = ld(ld(A,B),unit). [back_rewrite(693),rewrite([724(5)])].
% 1.38/1.66 741 rd(ld(A,B),B) = ld(A,unit). [para(724(a,1),6(a,1,1))].
% 1.38/1.66 755 ld(rd(A,B),unit) = rd(B,A). [para(5(a,1),726(a,1,2)),flip(a)].
% 1.38/1.66 760 rd(mult(A,A),rd(B,ld(A,unit))) = rd(A,B). [para(522(a,1),726(a,1,2)),rewrite([755(8)])].
% 1.38/1.66 795 ld(rd(A,B),C) = mult(rd(B,A),C). [para(755(a,1),724(a,1,1)),flip(a)].
% 1.38/1.66 812 mult(rd(mult(A,A),B),C) = mult(A,mult(A,ld(B,C))). [back_rewrite(93),rewrite([795(3)])].
% 1.38/1.66 928 mult(mult(A,B),ld(ld(A,B),unit)) = mult(A,A). [para(730(a,1),3(a,1,2))].
% 1.38/1.66 1003 rd(mult(A,A),ld(B,unit)) = rd(A,ld(B,ld(A,unit))). [para(741(a,1),760(a,1,2))].
% 1.38/1.66 1085 mult(mult(A,mult(A,B)),ld(B,unit)) = mult(A,A). [para(4(a,1),928(a,1,2,1))].
% 1.38/1.66 1275 rd(A,ld(B,ld(A,unit))) = mult(A,mult(A,B)). [para(1085(a,1),6(a,1,1)),rewrite([1003(4)])].
% 1.38/1.66 1302 rd(mult(A,A),ld(B,unit)) = mult(A,mult(A,B)). [back_rewrite(1003),rewrite([1275(8)])].
% 1.38/1.66 2942 mult(mult(A,mult(A,B)),C) = mult(A,mult(A,mult(B,C))). [para(725(a,1),812(a,2,2,2)),rewrite([1302(4)])].
% 1.38/1.66 2943 $F # answer(goals). [resolve(2942,a,24,a)].
% 1.38/1.66
% 1.38/1.66 % SZS output end Refutation
% 1.38/1.66 ============================== end of proof ==========================
% 1.38/1.66
% 1.38/1.66 ============================== STATISTICS ============================
% 1.38/1.66
% 1.38/1.66 Given=145. Generated=14218. Kept=2940. proofs=1.
% 1.38/1.66 Usable=85. Sos=1661. Demods=1764. Limbo=28, Disabled=1173. Hints=0.
% 1.38/1.66 Megabytes=6.81.
% 1.38/1.66 User_CPU=0.70, System_CPU=0.01, Wall_clock=1.
% 1.38/1.66
% 1.38/1.66 ============================== end of statistics =====================
% 1.38/1.66
% 1.38/1.66 ============================== end of search =========================
% 1.38/1.66
% 1.38/1.66 THEOREM PROVED
% 1.38/1.66 % SZS status Unsatisfiable
% 1.38/1.66
% 1.38/1.66 Exiting with 1 proof.
% 1.38/1.66
% 1.38/1.66 Process 5451 exit (max_proofs) Mon Jun 13 18:03:39 2022
% 1.38/1.66 Prover9 interrupted
%------------------------------------------------------------------------------