TSTP Solution File: GRP682-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP682-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:34 EDT 2022
% Result : Unsatisfiable 0.77s 1.05s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP682-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n006.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 14:28:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.77/1.05 ============================== Prover9 ===============================
% 0.77/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.05 Process 3710 was started by sandbox on n006.cluster.edu,
% 0.77/1.05 Mon Jun 13 14:28:57 2022
% 0.77/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3555_n006.cluster.edu".
% 0.77/1.05 ============================== end of head ===========================
% 0.77/1.05
% 0.77/1.05 ============================== INPUT =================================
% 0.77/1.05
% 0.77/1.05 % Reading from file /tmp/Prover9_3555_n006.cluster.edu
% 0.77/1.05
% 0.77/1.05 set(prolog_style_variables).
% 0.77/1.05 set(auto2).
% 0.77/1.05 % set(auto2) -> set(auto).
% 0.77/1.05 % set(auto) -> set(auto_inference).
% 0.77/1.05 % set(auto) -> set(auto_setup).
% 0.77/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.05 % set(auto) -> set(auto_limits).
% 0.77/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.05 % set(auto) -> set(auto_denials).
% 0.77/1.05 % set(auto) -> set(auto_process).
% 0.77/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.05 % set(auto2) -> assign(stats, some).
% 0.77/1.05 % set(auto2) -> clear(echo_input).
% 0.77/1.05 % set(auto2) -> set(quiet).
% 0.77/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.05 % set(auto2) -> clear(print_given).
% 0.77/1.05 assign(lrs_ticks,-1).
% 0.77/1.05 assign(sos_limit,10000).
% 0.77/1.05 assign(order,kbo).
% 0.77/1.05 set(lex_order_vars).
% 0.77/1.05 clear(print_given).
% 0.77/1.05
% 0.77/1.05 % formulas(sos). % not echoed (8 formulas)
% 0.77/1.05
% 0.77/1.05 ============================== end of input ==========================
% 0.77/1.05
% 0.77/1.05 % From the command line: assign(max_seconds, 300).
% 0.77/1.05
% 0.77/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.05
% 0.77/1.05 % Formulas that are not ordinary clauses:
% 0.77/1.05
% 0.77/1.05 ============================== end of process non-clausal formulas ===
% 0.77/1.05
% 0.77/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.05
% 0.77/1.05 ============================== PREDICATE ELIMINATION =================
% 0.77/1.05
% 0.77/1.05 ============================== end predicate elimination =============
% 0.77/1.05
% 0.77/1.05 Auto_denials:
% 0.77/1.05 % copying label goal to answer in negative clause
% 0.77/1.05
% 0.77/1.05 Term ordering decisions:
% 0.77/1.05 Function symbol KB weights: x0=1. x1=1. x2=1. mult=1. ld=1. rd=1.
% 0.77/1.05
% 0.77/1.05 ============================== end of process initial clauses ========
% 0.77/1.05
% 0.77/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.05
% 0.77/1.05 ============================== end of clauses for search =============
% 0.77/1.05
% 0.77/1.05 ============================== SEARCH ================================
% 0.77/1.05
% 0.77/1.05 % Starting search at 0.01 seconds.
% 0.77/1.05
% 0.77/1.05 ============================== PROOF =================================
% 0.77/1.05 % SZS status Unsatisfiable
% 0.77/1.05 % SZS output start Refutation
% 0.77/1.05
% 0.77/1.05 % Proof 1 at 0.02 (+ 0.00) seconds: goal.
% 0.77/1.05 % Length of proof is 22.
% 0.77/1.05 % Level of proof is 7.
% 0.77/1.05 % Maximum clause weight is 23.000.
% 0.77/1.05 % Given clauses 14.
% 0.77/1.05
% 0.77/1.05 1 ld(A,mult(A,A)) = A # label(f01) # label(axiom). [assumption].
% 0.77/1.05 2 rd(mult(A,A),A) = A # label(f02) # label(axiom). [assumption].
% 0.77/1.05 3 mult(A,ld(A,B)) = ld(A,mult(A,B)) # label(f03) # label(axiom). [assumption].
% 0.77/1.05 4 ld(A,mult(A,B)) = mult(A,ld(A,B)). [copy(3),flip(a)].
% 0.77/1.05 5 mult(rd(A,B),B) = rd(mult(A,B),B) # label(f04) # label(axiom). [assumption].
% 0.77/1.05 6 rd(mult(A,B),B) = mult(rd(A,B),B). [copy(5),flip(a)].
% 0.77/1.05 7 ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B) # label(f07) # label(axiom). [assumption].
% 0.77/1.05 8 mult(rd(rd(A,A),B),B) = mult(A,ld(A,ld(B,B))). [copy(7),rewrite([4(3),6(6)]),flip(a)].
% 0.77/1.05 9 ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D) # label(f05) # label(axiom). [assumption].
% 0.77/1.05 10 mult(ld(A,B),ld(ld(A,B),mult(C,D))) = mult(mult(A,ld(A,C)),D). [copy(9),rewrite([4(5),4(7)])].
% 0.77/1.05 13 ld(ld(x0,x1),mult(ld(x0,x1),x2)) != ld(x0,mult(x0,x2)) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.77/1.05 14 mult(ld(x0,x1),ld(ld(x0,x1),x2)) != mult(x0,ld(x0,x2)) # answer(goal). [copy(13),rewrite([4(9),4(14)])].
% 0.77/1.05 15 mult(A,ld(A,A)) = A. [back_rewrite(1),rewrite([4(2)])].
% 0.77/1.05 16 mult(rd(A,A),A) = A. [back_rewrite(2),rewrite([6(2)])].
% 0.77/1.05 20 mult(mult(A,ld(A,B)),ld(mult(A,ld(A,B)),mult(C,D))) = mult(mult(A,ld(A,C)),D). [para(4(a,1),10(a,1,1)),rewrite([4(4)])].
% 0.77/1.05 33 mult(A,ld(A,ld(A,A))) = ld(A,A). [para(15(a,1),4(a,1,2)),flip(a)].
% 0.77/1.05 38 rd(A,A) = ld(A,A). [para(16(a,1),6(a,1,1)),rewrite([8(4),33(4)])].
% 0.77/1.05 39 mult(ld(A,A),A) = A. [para(16(a,1),6(a,2)),rewrite([6(2),38(1)])].
% 0.77/1.05 41 mult(ld(A,B),ld(ld(A,B),C)) = mult(mult(A,ld(A,ld(C,C))),C). [para(16(a,1),10(a,1,2,2)),rewrite([38(5)])].
% 0.77/1.05 76 mult(mult(A,ld(A,B)),C) = mult(A,ld(A,mult(B,C))). [para(15(a,1),20(a,1,1)),rewrite([15(2)]),flip(a)].
% 0.77/1.05 97 mult(ld(A,B),ld(ld(A,B),C)) = mult(A,ld(A,C)). [back_rewrite(41),rewrite([76(8),39(6)])].
% 0.77/1.05 98 $F # answer(goal). [resolve(97,a,14,a)].
% 0.77/1.05
% 0.77/1.05 % SZS output end Refutation
% 0.77/1.05 ============================== end of proof ==========================
% 0.77/1.05
% 0.77/1.05 ============================== STATISTICS ============================
% 0.77/1.05
% 0.77/1.05 Given=14. Generated=198. Kept=91. proofs=1.
% 0.77/1.05 Usable=12. Sos=26. Demods=52. Limbo=21, Disabled=39. Hints=0.
% 0.77/1.05 Megabytes=0.18.
% 0.77/1.05 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.77/1.05
% 0.77/1.05 ============================== end of statistics =====================
% 0.77/1.05
% 0.77/1.05 ============================== end of search =========================
% 0.77/1.05
% 0.77/1.05 THEOREM PROVED
% 0.77/1.05 % SZS status Unsatisfiable
% 0.77/1.05
% 0.77/1.05 Exiting with 1 proof.
% 0.77/1.05
% 0.77/1.05 Process 3710 exit (max_proofs) Mon Jun 13 14:28:57 2022
% 0.77/1.05 Prover9 interrupted
%------------------------------------------------------------------------------