TSTP Solution File: ALG236-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG236-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Thu Jul 14 17:54:13 EDT 2022
% Result : Unsatisfiable 0.72s 1.10s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG236-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.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 : Wed Jun 8 15:07:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.10 ============================== Prover9 ===============================
% 0.72/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.10 Process 23398 was started by sandbox on n021.cluster.edu,
% 0.72/1.10 Wed Jun 8 15:07:08 2022
% 0.72/1.10 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23243_n021.cluster.edu".
% 0.72/1.10 ============================== end of head ===========================
% 0.72/1.10
% 0.72/1.10 ============================== INPUT =================================
% 0.72/1.10
% 0.72/1.10 % Reading from file /tmp/Prover9_23243_n021.cluster.edu
% 0.72/1.10
% 0.72/1.10 set(prolog_style_variables).
% 0.72/1.10 set(auto2).
% 0.72/1.10 % set(auto2) -> set(auto).
% 0.72/1.10 % set(auto) -> set(auto_inference).
% 0.72/1.10 % set(auto) -> set(auto_setup).
% 0.72/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.10 % set(auto) -> set(auto_limits).
% 0.72/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.10 % set(auto) -> set(auto_denials).
% 0.72/1.10 % set(auto) -> set(auto_process).
% 0.72/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.10 % set(auto2) -> assign(stats, some).
% 0.72/1.10 % set(auto2) -> clear(echo_input).
% 0.72/1.10 % set(auto2) -> set(quiet).
% 0.72/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.10 % set(auto2) -> clear(print_given).
% 0.72/1.10 assign(lrs_ticks,-1).
% 0.72/1.10 assign(sos_limit,10000).
% 0.72/1.10 assign(order,kbo).
% 0.72/1.10 set(lex_order_vars).
% 0.72/1.10 clear(print_given).
% 0.72/1.10
% 0.72/1.10 % formulas(sos). % not echoed (4 formulas)
% 0.72/1.10
% 0.72/1.10 ============================== end of input ==========================
% 0.72/1.10
% 0.72/1.10 % From the command line: assign(max_seconds, 300).
% 0.72/1.10
% 0.72/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.10
% 0.72/1.10 % Formulas that are not ordinary clauses:
% 0.72/1.10
% 0.72/1.10 ============================== end of process non-clausal formulas ===
% 0.72/1.10
% 0.72/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.10
% 0.72/1.10 ============================== PREDICATE ELIMINATION =================
% 0.72/1.10
% 0.72/1.10 ============================== end predicate elimination =============
% 0.72/1.10
% 0.72/1.10 Auto_denials:
% 0.72/1.10 % copying label goals to answer in negative clause
% 0.72/1.10
% 0.72/1.10 Term ordering decisions:
% 0.72/1.10 Function symbol KB weights: a=1. b=1. c=1. d=1. e=1. mult=1.
% 0.72/1.10
% 0.72/1.10 ============================== end of process initial clauses ========
% 0.72/1.10
% 0.72/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.10
% 0.72/1.10 ============================== end of clauses for search =============
% 0.72/1.10
% 0.72/1.10 ============================== SEARCH ================================
% 0.72/1.10
% 0.72/1.10 % Starting search at 0.01 seconds.
% 0.72/1.10
% 0.72/1.10 ============================== PROOF =================================
% 0.72/1.10 % SZS status Unsatisfiable
% 0.72/1.10 % SZS output start Refutation
% 0.72/1.10
% 0.72/1.10 % Proof 1 at 0.12 (+ 0.01) seconds: goals.
% 0.72/1.10 % Length of proof is 28.
% 0.72/1.10 % Level of proof is 9.
% 0.72/1.10 % Maximum clause weight is 27.000.
% 0.72/1.10 % Given clauses 24.
% 0.72/1.10
% 0.72/1.10 1 mult(A,mult(B,mult(A,B))) = mult(A,B) # label(c01) # label(axiom). [assumption].
% 0.72/1.10 2 mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))) # label(c02) # label(axiom). [assumption].
% 0.72/1.10 3 mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))) # label(c03) # label(axiom). [assumption].
% 0.72/1.10 4 mult(mult(a,b),mult(c,mult(d,e))) != mult(a,mult(c,mult(mult(d,b),e))) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.72/1.10 8 mult(A,mult(B,mult(C,mult(D,mult(A,D))))) = mult(C,mult(B,mult(A,D))). [para(1(a,1),2(a,1,2,2)),flip(a)].
% 0.72/1.10 9 mult(A,mult(B,mult(C,mult(B,A)))) = mult(C,mult(B,A)). [para(1(a,1),2(a,1,2)),flip(a)].
% 0.72/1.10 19 mult(A,mult(B,mult(mult(A,C),B))) = mult(mult(A,C),B). [para(1(a,1),3(a,1,1)),flip(a)].
% 0.72/1.10 26 mult(mult(A,mult(B,mult(C,B))),D) = mult(mult(C,B),mult(D,mult(A,D))). [para(3(a,2),2(a,1))].
% 0.72/1.10 46 mult(d,mult(c,mult(mult(a,b),e))) != mult(a,mult(c,mult(mult(d,b),e))) # answer(goals). [para(2(a,1),4(a,1))].
% 0.72/1.10 65 mult(mult(d,b),mult(c,mult(a,e))) != mult(d,mult(c,mult(mult(a,b),e))) # answer(goals). [para(2(a,1),46(a,2)),flip(a)].
% 0.72/1.10 67 mult(mult(A,B),mult(B,mult(A,B))) = mult(A,B). [para(1(a,1),9(a,1,2,2)),rewrite([1(7)])].
% 0.72/1.10 91 mult(mult(A,B),B) = mult(A,B). [para(67(a,1),2(a,1)),rewrite([19(5)]),flip(a)].
% 0.72/1.10 112 mult(mult(A,B),mult(C,mult(D,B))) = mult(D,mult(C,mult(A,B))). [para(91(a,1),2(a,1,2,2)),flip(a)].
% 0.72/1.10 116 mult(mult(A,mult(B,mult(C,B))),B) = mult(A,mult(B,mult(C,B))). [para(91(a,1),3(a,2,2,2))].
% 0.72/1.10 131 mult(A,mult(B,mult(C,mult(D,mult(mult(A,E),D))))) = mult(C,mult(B,mult(mult(A,E),D))). [para(19(a,1),2(a,1,2,2)),flip(a)].
% 0.72/1.10 133 mult(mult(A,B),mult(C,mult(A,C))) = mult(mult(A,B),C). [para(19(a,1),2(a,1)),flip(a)].
% 0.72/1.10 192 mult(A,mult(mult(B,C),mult(D,mult(B,A)))) = mult(D,mult(mult(B,C),A)). [para(133(a,1),2(a,1,2)),flip(a)].
% 0.72/1.10 197 mult(mult(A,B),mult(C,mult(mult(A,D),C))) = mult(mult(mult(A,B),D),C). [para(133(a,1),3(a,1,1)),flip(a)].
% 0.72/1.10 236 mult(mult(A,mult(B,C)),mult(mult(B,D),C)) = mult(A,mult(mult(B,D),C)). [para(133(a,1),112(a,1,2)),rewrite([192(10)])].
% 0.72/1.10 238 mult(mult(A,mult(B,mult(C,B))),mult(D,mult(E,B))) = mult(E,mult(D,mult(A,mult(B,mult(C,B))))). [para(116(a,1),2(a,1,2,2)),flip(a)].
% 0.72/1.10 254 mult(A,mult(B,mult(A,mult(C,mult(D,C))))) = mult(D,mult(B,mult(A,C))). [para(2(a,1),8(a,1,2,2))].
% 0.72/1.10 358 mult(mult(A,mult(B,mult(C,B))),mult(D,mult(E,D))) = mult(A,mult(D,mult(mult(E,mult(B,mult(C,B))),D))). [para(26(a,2),3(a,2,2,2)),rewrite([236(13)])].
% 0.72/1.10 378 mult(mult(mult(A,B),C),D) = mult(mult(mult(A,C),B),D). [para(133(a,1),26(a,1,1)),rewrite([197(8)])].
% 0.72/1.10 426 mult(mult(mult(A,mult(B,mult(C,D))),E),F) = mult(mult(C,mult(B,mult(mult(A,E),D))),F). [para(2(a,1),378(a,1,1)),flip(a)].
% 0.72/1.10 439 mult(mult(mult(A,B),C),B) = mult(mult(A,C),B). [para(378(a,1),91(a,1))].
% 0.72/1.10 634 mult(mult(A,B),mult(C,mult(D,C))) = mult(A,mult(C,mult(mult(D,B),C))). [para(3(a,1),439(a,1,1)),rewrite([358(7),19(4),439(3)]),flip(a)].
% 0.72/1.10 638 mult(mult(A,B),mult(C,mult(D,E))) = mult(A,mult(C,mult(mult(D,B),E))). [para(439(a,1),8(a,1,2,2)),rewrite([634(4),131(6),426(11),238(11),254(10)]),flip(a)].
% 0.72/1.10 639 $F # answer(goals). [resolve(638,a,65,a)].
% 0.72/1.10
% 0.72/1.10 % SZS output end Refutation
% 0.72/1.10 ============================== end of proof ==========================
% 0.72/1.10
% 0.72/1.10 ============================== STATISTICS ============================
% 0.72/1.10
% 0.72/1.10 Given=24. Generated=2380. Kept=638. proofs=1.
% 0.72/1.10 Usable=20. Sos=367. Demods=182. Limbo=8, Disabled=246. Hints=0.
% 0.72/1.10 Megabytes=0.76.
% 0.72/1.10 User_CPU=0.12, System_CPU=0.01, Wall_clock=0.
% 0.72/1.10
% 0.72/1.10 ============================== end of statistics =====================
% 0.72/1.10
% 0.72/1.10 ============================== end of search =========================
% 0.72/1.10
% 0.72/1.10 THEOREM PROVED
% 0.72/1.10 % SZS status Unsatisfiable
% 0.72/1.10
% 0.72/1.10 Exiting with 1 proof.
% 0.72/1.10
% 0.72/1.10 Process 23398 exit (max_proofs) Wed Jun 8 15:07:08 2022
% 0.72/1.10 Prover9 interrupted
%------------------------------------------------------------------------------