TSTP Solution File: GRP687-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP687-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 0.97s 1.24s
% Output : Refutation 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP687-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 12:46:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.97/1.24 ============================== Prover9 ===============================
% 0.97/1.24 Prover9 (32) version 2009-11A, November 2009.
% 0.97/1.24 Process 11630 was started by sandbox2 on n024.cluster.edu,
% 0.97/1.24 Mon Jun 13 12:46:49 2022
% 0.97/1.24 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11476_n024.cluster.edu".
% 0.97/1.24 ============================== end of head ===========================
% 0.97/1.24
% 0.97/1.24 ============================== INPUT =================================
% 0.97/1.24
% 0.97/1.24 % Reading from file /tmp/Prover9_11476_n024.cluster.edu
% 0.97/1.24
% 0.97/1.24 set(prolog_style_variables).
% 0.97/1.24 set(auto2).
% 0.97/1.24 % set(auto2) -> set(auto).
% 0.97/1.24 % set(auto) -> set(auto_inference).
% 0.97/1.24 % set(auto) -> set(auto_setup).
% 0.97/1.24 % set(auto_setup) -> set(predicate_elim).
% 0.97/1.24 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.97/1.24 % set(auto) -> set(auto_limits).
% 0.97/1.24 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.97/1.24 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.97/1.24 % set(auto) -> set(auto_denials).
% 0.97/1.24 % set(auto) -> set(auto_process).
% 0.97/1.24 % set(auto2) -> assign(new_constants, 1).
% 0.97/1.24 % set(auto2) -> assign(fold_denial_max, 3).
% 0.97/1.24 % set(auto2) -> assign(max_weight, "200.000").
% 0.97/1.24 % set(auto2) -> assign(max_hours, 1).
% 0.97/1.24 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.97/1.24 % set(auto2) -> assign(max_seconds, 0).
% 0.97/1.24 % set(auto2) -> assign(max_minutes, 5).
% 0.97/1.24 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.97/1.24 % set(auto2) -> set(sort_initial_sos).
% 0.97/1.24 % set(auto2) -> assign(sos_limit, -1).
% 0.97/1.24 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.97/1.24 % set(auto2) -> assign(max_megs, 400).
% 0.97/1.24 % set(auto2) -> assign(stats, some).
% 0.97/1.24 % set(auto2) -> clear(echo_input).
% 0.97/1.24 % set(auto2) -> set(quiet).
% 0.97/1.24 % set(auto2) -> clear(print_initial_clauses).
% 0.97/1.24 % set(auto2) -> clear(print_given).
% 0.97/1.24 assign(lrs_ticks,-1).
% 0.97/1.24 assign(sos_limit,10000).
% 0.97/1.24 assign(order,kbo).
% 0.97/1.24 set(lex_order_vars).
% 0.97/1.24 clear(print_given).
% 0.97/1.24
% 0.97/1.24 % formulas(sos). % not echoed (8 formulas)
% 0.97/1.24
% 0.97/1.24 ============================== end of input ==========================
% 0.97/1.24
% 0.97/1.24 % From the command line: assign(max_seconds, 300).
% 0.97/1.24
% 0.97/1.24 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.97/1.24
% 0.97/1.24 % Formulas that are not ordinary clauses:
% 0.97/1.24
% 0.97/1.24 ============================== end of process non-clausal formulas ===
% 0.97/1.24
% 0.97/1.24 ============================== PROCESS INITIAL CLAUSES ===============
% 0.97/1.24
% 0.97/1.24 ============================== PREDICATE ELIMINATION =================
% 0.97/1.24
% 0.97/1.24 ============================== end predicate elimination =============
% 0.97/1.24
% 0.97/1.24 Auto_denials:
% 0.97/1.24 % copying label goals to answer in negative clause
% 0.97/1.24
% 0.97/1.24 Term ordering decisions:
% 0.97/1.24 Function symbol KB weights: unit=1. a=1. b=1. c=1. mult=1. ld=1. rd=1.
% 0.97/1.24
% 0.97/1.24 ============================== end of process initial clauses ========
% 0.97/1.24
% 0.97/1.24 ============================== CLAUSES FOR SEARCH ====================
% 0.97/1.24
% 0.97/1.24 ============================== end of clauses for search =============
% 0.97/1.24
% 0.97/1.24 ============================== SEARCH ================================
% 0.97/1.24
% 0.97/1.24 % Starting search at 0.01 seconds.
% 0.97/1.24
% 0.97/1.24 ============================== PROOF =================================
% 0.97/1.24 % SZS status Unsatisfiable
% 0.97/1.24 % SZS output start Refutation
% 0.97/1.24
% 0.97/1.24 % Proof 1 at 0.25 (+ 0.01) seconds: goals.
% 0.97/1.24 % Length of proof is 29.
% 0.97/1.24 % Level of proof is 16.
% 0.97/1.24 % Maximum clause weight is 15.000.
% 0.97/1.24 % Given clauses 121.
% 0.97/1.24
% 0.97/1.24 1 mult(A,unit) = A # label(c05) # label(axiom). [assumption].
% 0.97/1.24 3 mult(A,ld(A,B)) = B # label(c01) # label(axiom). [assumption].
% 0.97/1.24 4 ld(A,mult(A,B)) = B # label(c02) # label(axiom). [assumption].
% 0.97/1.24 5 mult(rd(A,B),B) = A # label(c03) # label(axiom). [assumption].
% 0.97/1.24 6 rd(mult(A,B),B) = A # label(c04) # label(axiom). [assumption].
% 0.97/1.24 7 mult(mult(A,A),mult(B,C)) = mult(mult(A,mult(A,B)),C) # label(c07) # label(axiom). [assumption].
% 0.97/1.24 8 mult(mult(A,mult(A,B)),C) = mult(mult(A,A),mult(B,C)). [copy(7),flip(a)].
% 0.97/1.24 9 mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.97/1.24 10 mult(mult(a,mult(b,b)),c) != mult(a,mult(b,mult(b,c))) # answer(goals). [copy(9),flip(a)].
% 0.97/1.24 14 ld(rd(A,B),A) = B. [para(5(a,1),4(a,1,2))].
% 0.97/1.24 16 rd(A,ld(B,A)) = B. [para(3(a,1),6(a,1,1))].
% 0.97/1.24 17 mult(mult(A,A),B) = mult(A,mult(A,B)). [para(8(a,1),1(a,1)),rewrite([1(3)])].
% 0.97/1.24 19 mult(A,mult(A,mult(ld(A,B),C))) = mult(mult(A,B),C). [para(3(a,1),8(a,1,1,2)),rewrite([17(6)]),flip(a)].
% 0.97/1.24 22 rd(mult(A,mult(A,mult(B,C))),C) = mult(A,mult(A,B)). [para(8(a,1),6(a,1,1)),rewrite([17(3)])].
% 0.97/1.24 49 mult(mult(A,B),ld(ld(A,B),C)) = mult(A,mult(A,C)). [para(3(a,1),19(a,1,2,2)),flip(a)].
% 0.97/1.24 76 rd(mult(A,mult(A,B)),C) = mult(A,mult(A,rd(B,C))). [para(5(a,1),22(a,1,1,2,2))].
% 0.97/1.24 116 mult(A,ld(ld(A,unit),B)) = mult(A,mult(A,B)). [para(1(a,1),49(a,1,1))].
% 0.97/1.24 117 mult(A,ld(ld(B,ld(B,A)),C)) = mult(B,mult(B,C)). [para(3(a,1),49(a,1,1))].
% 0.97/1.24 139 ld(ld(A,unit),B) = mult(A,B). [para(116(a,1),4(a,1,2)),rewrite([4(3)]),flip(a)].
% 0.97/1.24 154 mult(rd(unit,A),B) = ld(A,B). [para(14(a,1),139(a,1,1)),flip(a)].
% 0.97/1.24 186 rd(unit,A) = ld(A,unit). [para(154(a,1),1(a,1)),flip(a)].
% 0.97/1.24 296 mult(A,mult(A,ld(B,unit))) = rd(mult(A,A),B). [para(1(a,1),76(a,1,1,2)),rewrite([186(4)]),flip(a)].
% 0.97/1.24 320 ld(A,rd(mult(A,A),B)) = mult(A,ld(B,unit)). [para(296(a,1),4(a,1,2))].
% 0.97/1.24 347 mult(A,ld(ld(B,mult(A,A)),unit)) = ld(A,B). [para(16(a,1),320(a,1,2)),flip(a)].
% 0.97/1.24 405 ld(ld(A,mult(B,B)),unit) = ld(B,ld(B,A)). [para(347(a,1),4(a,1,2)),flip(a)].
% 0.97/1.24 422 ld(ld(A,ld(A,B)),C) = mult(ld(B,mult(A,A)),C). [para(405(a,1),139(a,1,1))].
% 0.97/1.24 439 mult(A,mult(ld(A,mult(B,B)),C)) = mult(B,mult(B,C)). [back_rewrite(117),rewrite([422(3)])].
% 0.97/1.24 1891 mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))). [para(439(a,1),19(a,1,2)),flip(a)].
% 0.97/1.24 1892 $F # answer(goals). [resolve(1891,a,10,a)].
% 0.97/1.24
% 0.97/1.24 % SZS output end Refutation
% 0.97/1.24 ============================== end of proof ==========================
% 0.97/1.24
% 0.97/1.24 ============================== STATISTICS ============================
% 0.97/1.24
% 0.97/1.24 Given=121. Generated=8593. Kept=1889. proofs=1.
% 0.97/1.24 Usable=86. Sos=1220. Demods=1292. Limbo=1, Disabled=589. Hints=0.
% 0.97/1.24 Megabytes=3.06.
% 0.97/1.24 User_CPU=0.25, System_CPU=0.01, Wall_clock=0.
% 0.97/1.24
% 0.97/1.24 ============================== end of statistics =====================
% 0.97/1.24
% 0.97/1.24 ============================== end of search =========================
% 0.97/1.24
% 0.97/1.24 THEOREM PROVED
% 0.97/1.24 % SZS status Unsatisfiable
% 0.97/1.24
% 0.97/1.24 Exiting with 1 proof.
% 0.97/1.24
% 0.97/1.24 Process 11630 exit (max_proofs) Mon Jun 13 12:46:49 2022
% 0.97/1.24 Prover9 interrupted
%------------------------------------------------------------------------------