TSTP Solution File: ALG245-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG245-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:14 EDT 2022
% Result : Unsatisfiable 0.70s 0.99s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ALG245-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 : Wed Jun 8 09:03:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/0.99 ============================== Prover9 ===============================
% 0.70/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.99 Process 20756 was started by sandbox2 on n027.cluster.edu,
% 0.70/0.99 Wed Jun 8 09:03:12 2022
% 0.70/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20603_n027.cluster.edu".
% 0.70/0.99 ============================== end of head ===========================
% 0.70/0.99
% 0.70/0.99 ============================== INPUT =================================
% 0.70/0.99
% 0.70/0.99 % Reading from file /tmp/Prover9_20603_n027.cluster.edu
% 0.70/0.99
% 0.70/0.99 set(prolog_style_variables).
% 0.70/0.99 set(auto2).
% 0.70/0.99 % set(auto2) -> set(auto).
% 0.70/0.99 % set(auto) -> set(auto_inference).
% 0.70/0.99 % set(auto) -> set(auto_setup).
% 0.70/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.99 % set(auto) -> set(auto_limits).
% 0.70/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.99 % set(auto) -> set(auto_denials).
% 0.70/0.99 % set(auto) -> set(auto_process).
% 0.70/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.99 % set(auto2) -> assign(stats, some).
% 0.70/0.99 % set(auto2) -> clear(echo_input).
% 0.70/0.99 % set(auto2) -> set(quiet).
% 0.70/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.99 % set(auto2) -> clear(print_given).
% 0.70/0.99 assign(lrs_ticks,-1).
% 0.70/0.99 assign(sos_limit,10000).
% 0.70/0.99 assign(order,kbo).
% 0.70/0.99 set(lex_order_vars).
% 0.70/0.99 clear(print_given).
% 0.70/0.99
% 0.70/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.70/0.99
% 0.70/0.99 ============================== end of input ==========================
% 0.70/0.99
% 0.70/0.99 % From the command line: assign(max_seconds, 300).
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.99
% 0.70/0.99 % Formulas that are not ordinary clauses:
% 0.70/0.99
% 0.70/0.99 ============================== end of process non-clausal formulas ===
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.99
% 0.70/0.99 ============================== PREDICATE ELIMINATION =================
% 0.70/0.99
% 0.70/0.99 ============================== end predicate elimination =============
% 0.70/0.99
% 0.70/0.99 Auto_denials:
% 0.70/0.99 % copying label goals to answer in negative clause
% 0.70/0.99
% 0.70/0.99 Term ordering decisions:
% 0.70/0.99 Function symbol KB weights: a=1. b=1. c=1. d=1. mult=1.
% 0.70/0.99
% 0.70/0.99 ============================== end of process initial clauses ========
% 0.70/0.99
% 0.70/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.70/0.99
% 0.70/0.99 ============================== end of clauses for search =============
% 0.70/0.99
% 0.70/0.99 ============================== SEARCH ================================
% 0.70/0.99
% 0.70/0.99 % Starting search at 0.01 seconds.
% 0.70/0.99
% 0.70/0.99 ============================== PROOF =================================
% 0.70/0.99 % SZS status Unsatisfiable
% 0.70/0.99 % SZS output start Refutation
% 0.70/0.99
% 0.70/0.99 % Proof 1 at 0.03 (+ 0.00) seconds: goals.
% 0.70/0.99 % Length of proof is 22.
% 0.70/0.99 % Level of proof is 8.
% 0.70/0.99 % Maximum clause weight is 51.000.
% 0.70/0.99 % Given clauses 9.
% 0.70/0.99
% 0.70/0.99 1 mult(A,A) = A # label(c05) # label(axiom). [assumption].
% 0.70/0.99 2 mult(A,mult(B,C)) = mult(mult(A,B),mult(A,C)) # label(c01) # label(axiom). [assumption].
% 0.70/0.99 3 mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)). [copy(2),flip(a)].
% 0.70/0.99 4 mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)) # label(c02) # label(axiom). [assumption].
% 0.70/0.99 5 mult(mult(A,B),mult(C,B)) = mult(mult(A,C),B). [copy(4),flip(a)].
% 0.70/0.99 6 mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))) = mult(mult(A,C),mult(B,D)) # label(c03) # label(axiom). [assumption].
% 0.70/0.99 7 mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(A,C),mult(B,D))) = mult(mult(A,B),mult(C,D)) # label(c04) # label(axiom). [assumption].
% 0.70/0.99 8 mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.70/0.99 9 mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))) != mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) # answer(goals). [copy(8),flip(a)].
% 0.70/0.99 10 mult(mult(A,B),A) = mult(A,mult(B,A)). [para(1(a,1),3(a,1,2))].
% 0.70/0.99 27 mult(mult(A,mult(mult(mult(B,C),mult(D,E)),mult(mult(B,D),mult(C,E)))),mult(mult(B,D),mult(C,E))) = mult(mult(A,mult(mult(B,C),mult(D,E))),mult(mult(mult(B,C),mult(D,E)),mult(mult(B,D),mult(C,E)))). [para(6(a,1),5(a,1,2))].
% 0.70/0.99 39 mult(mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),E),mult(mult(A,B),mult(C,D))) = mult(mult(mult(mult(A,B),mult(C,D)),E),mult(mult(A,C),mult(B,D))). [para(7(a,1),3(a,1,2)),rewrite([5(24)])].
% 0.70/0.99 44 mult(mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),E),mult(mult(A,C),mult(B,D))) = mult(mult(mult(A,B),mult(C,D)),mult(E,mult(mult(A,C),mult(B,D)))). [para(7(a,1),5(a,1,1)),flip(a)].
% 0.70/0.99 45 mult(mult(A,mult(mult(B,C),mult(D,E))),mult(mult(mult(B,C),mult(D,E)),mult(mult(B,D),mult(C,E)))) = mult(mult(A,mult(mult(B,D),mult(C,E))),mult(mult(B,C),mult(D,E))). [para(7(a,1),5(a,1,2)),rewrite([27(20)]),flip(a)].
% 0.70/0.99 68 mult(mult(A,mult(mult(mult(B,C),mult(D,E)),mult(mult(B,D),mult(C,E)))),mult(mult(B,D),mult(C,E))) = mult(mult(A,mult(mult(B,D),mult(C,E))),mult(mult(B,C),mult(D,E))). [back_rewrite(27),rewrite([45(24)])].
% 0.70/0.99 69 mult(mult(A,mult(B,A)),mult(C,A)) = mult(mult(mult(A,B),C),A). [para(10(a,1),5(a,1,1))].
% 0.70/0.99 70 mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,C)),B). [para(10(a,1),5(a,1,2))].
% 0.70/0.99 83 mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D)))),mult(mult(A,C),mult(B,D))) = mult(mult(A,C),mult(B,D)). [para(7(a,1),10(a,1,1)),rewrite([6(11),70(22)]),flip(a)].
% 0.70/0.99 97 mult(mult(mult(mult(A,B),mult(C,D)),mult(E,mult(mult(A,B),mult(C,D)))),mult(mult(A,C),mult(B,D))) = mult(mult(mult(A,B),mult(C,D)),mult(mult(E,mult(mult(A,C),mult(B,D))),mult(mult(A,B),mult(C,D)))). [para(6(a,1),69(a,1,2)),rewrite([44(20),68(15),39(24),5(28),10(20)]),flip(a)].
% 0.70/0.99 108 mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D)))) = mult(mult(A,C),mult(B,D)). [back_rewrite(83),rewrite([97(15),1(10)])].
% 0.70/0.99 123 mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))) = mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D))). [para(6(a,1),70(a,2,1)),rewrite([1(7),108(14)])].
% 0.70/0.99 124 $F # answer(goals). [resolve(123,a,9,a)].
% 0.70/0.99
% 0.70/0.99 % SZS output end Refutation
% 0.70/0.99 ============================== end of proof ==========================
% 0.70/0.99
% 0.70/0.99 ============================== STATISTICS ============================
% 0.70/0.99
% 0.70/0.99 Given=9. Generated=380. Kept=120. proofs=1.
% 0.70/0.99 Usable=9. Sos=92. Demods=112. Limbo=12, Disabled=12. Hints=0.
% 0.70/0.99 Megabytes=0.34.
% 0.70/0.99 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.70/0.99
% 0.70/0.99 ============================== end of statistics =====================
% 0.70/0.99
% 0.70/0.99 ============================== end of search =========================
% 0.70/0.99
% 0.70/0.99 THEOREM PROVED
% 0.70/0.99 % SZS status Unsatisfiable
% 0.70/0.99
% 0.70/0.99 Exiting with 1 proof.
% 0.70/0.99
% 0.70/0.99 Process 20756 exit (max_proofs) Wed Jun 8 09:03:12 2022
% 0.70/0.99 Prover9 interrupted
%------------------------------------------------------------------------------