TSTP Solution File: GRP117-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP117-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:17:13 EDT 2022
% Result : Unsatisfiable 0.75s 1.06s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP117-1 : TPTP v8.1.0. Released v1.2.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 20:46:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.06 ============================== Prover9 ===============================
% 0.75/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.06 Process 25502 was started by sandbox2 on n016.cluster.edu,
% 0.75/1.06 Mon Jun 13 20:46:15 2022
% 0.75/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25349_n016.cluster.edu".
% 0.75/1.06 ============================== end of head ===========================
% 0.75/1.06
% 0.75/1.06 ============================== INPUT =================================
% 0.75/1.06
% 0.75/1.06 % Reading from file /tmp/Prover9_25349_n016.cluster.edu
% 0.75/1.06
% 0.75/1.06 set(prolog_style_variables).
% 0.75/1.06 set(auto2).
% 0.75/1.06 % set(auto2) -> set(auto).
% 0.75/1.06 % set(auto) -> set(auto_inference).
% 0.75/1.06 % set(auto) -> set(auto_setup).
% 0.75/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.06 % set(auto) -> set(auto_limits).
% 0.75/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.06 % set(auto) -> set(auto_denials).
% 0.75/1.06 % set(auto) -> set(auto_process).
% 0.75/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.06 % set(auto2) -> assign(stats, some).
% 0.75/1.06 % set(auto2) -> clear(echo_input).
% 0.75/1.06 % set(auto2) -> set(quiet).
% 0.75/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.06 % set(auto2) -> clear(print_given).
% 0.75/1.06 assign(lrs_ticks,-1).
% 0.75/1.06 assign(sos_limit,10000).
% 0.75/1.06 assign(order,kbo).
% 0.75/1.06 set(lex_order_vars).
% 0.75/1.06 clear(print_given).
% 0.75/1.06
% 0.75/1.06 % formulas(sos). % not echoed (2 formulas)
% 0.75/1.06
% 0.75/1.06 ============================== end of input ==========================
% 0.75/1.06
% 0.75/1.06 % From the command line: assign(max_seconds, 300).
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.06
% 0.75/1.06 % Formulas that are not ordinary clauses:
% 0.75/1.06
% 0.75/1.06 ============================== end of process non-clausal formulas ===
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.06
% 0.75/1.06 ============================== PREDICATE ELIMINATION =================
% 0.75/1.06
% 0.75/1.06 ============================== end predicate elimination =============
% 0.75/1.06
% 0.75/1.06 Auto_denials:
% 0.75/1.06 % copying label prove_order3 to answer in negative clause
% 0.75/1.06
% 0.75/1.06 Term ordering decisions:
% 0.75/1.06 Function symbol KB weights: identity=1. a=1. multiply=1.
% 0.75/1.06
% 0.75/1.06 ============================== end of process initial clauses ========
% 0.75/1.06
% 0.75/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.06
% 0.75/1.06 ============================== end of clauses for search =============
% 0.75/1.06
% 0.75/1.06 ============================== SEARCH ================================
% 0.75/1.06
% 0.75/1.06 % Starting search at 0.01 seconds.
% 0.75/1.06
% 0.75/1.06 ============================== PROOF =================================
% 0.75/1.06 % SZS status Unsatisfiable
% 0.75/1.06 % SZS output start Refutation
% 0.75/1.06
% 0.75/1.06 % Proof 1 at 0.07 (+ 0.00) seconds: prove_order3.
% 0.75/1.06 % Length of proof is 27.
% 0.75/1.06 % Level of proof is 14.
% 0.75/1.06 % Maximum clause weight is 49.000.
% 0.75/1.06 % Given clauses 15.
% 0.75/1.06
% 0.75/1.06 1 multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.75/1.06 2 multiply(a,identity) != a # label(prove_order3) # label(negated_conjecture) # answer(prove_order3). [assumption].
% 0.75/1.06 3 multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))) = multiply(A,multiply(multiply(A,multiply(B,D)),multiply(identity,multiply(D,D)))). [para(1(a,1),1(a,1,2,1,2,1)),flip(a)].
% 0.75/1.06 5 multiply(A,multiply(B,multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C)))))) = multiply(multiply(A,B),C). [para(1(a,1),1(a,1,2,1))].
% 0.75/1.06 10 multiply(A,multiply(A,multiply(multiply(A,multiply(B,C)),multiply(identity,multiply(C,C))))) = B. [para(3(a,1),1(a,1,2))].
% 0.75/1.06 14 multiply(multiply(A,multiply(multiply(A,multiply(A,B)),C)),multiply(identity,multiply(C,C))) = B. [para(3(a,2),1(a,1))].
% 0.75/1.06 18 multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))) = multiply(A,multiply(multiply(A,D),multiply(identity,multiply(multiply(multiply(B,multiply(multiply(B,D),E)),multiply(identity,multiply(E,E))),multiply(multiply(B,multiply(multiply(B,D),E)),multiply(identity,multiply(E,E))))))). [para(1(a,1),3(a,2,2,1,2))].
% 0.75/1.06 24 multiply(multiply(A,multiply(multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))),D)),multiply(identity,multiply(D,D))) = multiply(A,multiply(multiply(A,multiply(multiply(multiply(A,multiply(B,E)),multiply(identity,multiply(E,E))),F)),multiply(identity,multiply(F,F)))). [para(3(a,2),3(a,1,1,2,1))].
% 0.75/1.06 55 multiply(A,multiply(multiply(A,multiply(A,B)),C)) = multiply(D,multiply(multiply(D,multiply(D,B)),C)). [para(14(a,1),10(a,1,2,2,1,2)),rewrite([5(12)])].
% 0.75/1.06 75 multiply(A,multiply(B,multiply(multiply(B,multiply(B,C)),multiply(identity,multiply(C,C))))) = A. [para(55(a,1),10(a,1,2))].
% 0.75/1.06 83 multiply(A,multiply(multiply(A,multiply(A,B)),identity)) = B. [para(75(a,1),1(a,1,2,1,2)),rewrite([75(18),75(11)])].
% 0.75/1.06 88 multiply(A,multiply(multiply(A,multiply(B,C)),multiply(identity,multiply(C,C)))) = multiply(multiply(A,multiply(A,B)),identity). [para(75(a,1),3(a,1,1,2)),rewrite([75(18),75(11)]),flip(a)].
% 0.75/1.06 91 multiply(A,multiply(multiply(A,B),multiply(identity,multiply(identity,identity)))) = multiply(multiply(A,multiply(A,B)),identity). [para(75(a,1),3(a,1)),rewrite([88(15)])].
% 0.75/1.06 95 multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))) = multiply(A,multiply(A,multiply(B,multiply(identity,multiply(identity,identity))))). [para(75(a,1),3(a,2,2))].
% 0.75/1.06 104 multiply(A,multiply(B,multiply(multiply(B,C),multiply(identity,multiply(multiply(multiply(B,multiply(B,C)),identity),multiply(multiply(B,multiply(B,C)),identity)))))) = A. [para(10(a,1),75(a,1,2,2,1,2)),rewrite([88(9),88(13)])].
% 0.75/1.06 106 multiply(multiply(A,multiply(A,A)),identity) = multiply(B,multiply(B,multiply(B,multiply(identity,multiply(identity,identity))))). [para(75(a,1),14(a,1,1,2,1,2)),rewrite([95(7),88(15)]),flip(a)].
% 0.75/1.06 138 multiply(A,multiply(identity,multiply(identity,identity))) = multiply(A,identity). [back_rewrite(24),rewrite([95(7),95(14),91(14),83(11),88(19),88(13),83(11)])].
% 0.75/1.06 148 multiply(multiply(A,multiply(A,B)),identity) = multiply(A,multiply(A,multiply(B,identity))). [back_rewrite(3),rewrite([95(7),138(6),88(11)]),flip(a)].
% 0.75/1.06 149 multiply(A,multiply(A,multiply(A,multiply(B,identity)))) = B. [back_rewrite(1),rewrite([95(7),138(6)])].
% 0.75/1.06 171 multiply(A,multiply(multiply(A,B),multiply(identity,multiply(multiply(C,multiply(C,multiply(B,identity))),multiply(C,multiply(C,multiply(B,identity))))))) = multiply(A,multiply(A,multiply(C,identity))). [back_rewrite(18),rewrite([95(7),138(6),95(13),138(12),95(17),138(16)]),flip(a)].
% 0.75/1.06 173 multiply(A,multiply(A,multiply(A,identity))) = c_0. [new_symbol(106),rewrite([148(4)])].
% 0.75/1.06 181 multiply(A,c_0) = A. [back_rewrite(104),rewrite([148(6),148(10),171(14),173(4)])].
% 0.75/1.06 232 multiply(identity,identity) = c_0. [para(138(a,1),173(a,1))].
% 0.75/1.06 270 multiply(A,multiply(A,A)) = identity. [para(232(a,1),149(a,1,2,2,2)),rewrite([181(2)])].
% 0.75/1.06 275 c_0 = identity. [para(181(a,1),270(a,1,2)),rewrite([181(3)])].
% 0.75/1.06 329 multiply(A,identity) = A. [back_rewrite(181),rewrite([275(1)])].
% 0.75/1.06 330 $F # answer(prove_order3). [resolve(329,a,2,a)].
% 0.75/1.06
% 0.75/1.06 % SZS output end Refutation
% 0.75/1.06 ============================== end of proof ==========================
% 0.75/1.06
% 0.75/1.06 ============================== STATISTICS ============================
% 0.75/1.06
% 0.75/1.06 Given=15. Generated=585. Kept=329. proofs=1.
% 0.75/1.06 Usable=4. Sos=24. Demods=73. Limbo=54, Disabled=248. Hints=0.
% 0.75/1.06 Megabytes=0.47.
% 0.75/1.06 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.75/1.06
% 0.75/1.06 ============================== end of statistics =====================
% 0.75/1.06
% 0.75/1.06 ============================== end of search =========================
% 0.75/1.06
% 0.75/1.06 THEOREM PROVED
% 0.75/1.06 % SZS status Unsatisfiable
% 0.75/1.06
% 0.75/1.06 Exiting with 1 proof.
% 0.75/1.06
% 0.75/1.06 Process 25502 exit (max_proofs) Mon Jun 13 20:46:15 2022
% 0.75/1.06 Prover9 interrupted
%------------------------------------------------------------------------------