TSTP Solution File: RNG128-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 : Mon Jul 18 20:39:24 EDT 2022
% Result : Unsatisfiable 0.56s 0.85s
% Output : Refutation 0.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% 0.00/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Mon May 30 10:02:57 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.56/0.85 ============================== Prover9 ===============================
% 0.56/0.85 Prover9 (32) version 2009-11A, November 2009.
% 0.56/0.85 Process 29751 was started by sandbox on n032.cluster.edu,
% 0.56/0.85 Mon May 30 10:02:58 2022
% 0.56/0.85 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29598_n032.cluster.edu".
% 0.56/0.85 ============================== end of head ===========================
% 0.56/0.85
% 0.56/0.85 ============================== INPUT =================================
% 0.56/0.85
% 0.56/0.85 % Reading from file /tmp/Prover9_29598_n032.cluster.edu
% 0.56/0.85
% 0.56/0.85 set(prolog_style_variables).
% 0.56/0.85 set(auto2).
% 0.56/0.85 % set(auto2) -> set(auto).
% 0.56/0.85 % set(auto) -> set(auto_inference).
% 0.56/0.85 % set(auto) -> set(auto_setup).
% 0.56/0.85 % set(auto_setup) -> set(predicate_elim).
% 0.56/0.85 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.56/0.85 % set(auto) -> set(auto_limits).
% 0.56/0.85 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.56/0.85 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.56/0.85 % set(auto) -> set(auto_denials).
% 0.56/0.85 % set(auto) -> set(auto_process).
% 0.56/0.85 % set(auto2) -> assign(new_constants, 1).
% 0.56/0.85 % set(auto2) -> assign(fold_denial_max, 3).
% 0.56/0.85 % set(auto2) -> assign(max_weight, "200.000").
% 0.56/0.85 % set(auto2) -> assign(max_hours, 1).
% 0.56/0.85 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.56/0.85 % set(auto2) -> assign(max_seconds, 0).
% 0.56/0.85 % set(auto2) -> assign(max_minutes, 5).
% 0.56/0.85 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.56/0.85 % set(auto2) -> set(sort_initial_sos).
% 0.56/0.85 % set(auto2) -> assign(sos_limit, -1).
% 0.56/0.85 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.56/0.85 % set(auto2) -> assign(max_megs, 400).
% 0.56/0.85 % set(auto2) -> assign(stats, some).
% 0.56/0.85 % set(auto2) -> clear(echo_input).
% 0.56/0.85 % set(auto2) -> set(quiet).
% 0.56/0.85 % set(auto2) -> clear(print_initial_clauses).
% 0.56/0.85 % set(auto2) -> clear(print_given).
% 0.56/0.85 assign(lrs_ticks,-1).
% 0.56/0.85 assign(sos_limit,10000).
% 0.56/0.85 assign(order,kbo).
% 0.56/0.85 set(lex_order_vars).
% 0.56/0.85 clear(print_given).
% 0.56/0.85
% 0.56/0.85 % formulas(sos). % not echoed (8 formulas)
% 0.56/0.85
% 0.56/0.85 ============================== end of input ==========================
% 0.56/0.85
% 0.56/0.85 % From the command line: assign(max_seconds, 300).
% 0.56/0.85
% 0.56/0.85 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.56/0.85
% 0.56/0.85 % Formulas that are not ordinary clauses:
% 0.56/0.85
% 0.56/0.85 ============================== end of process non-clausal formulas ===
% 0.56/0.85
% 0.56/0.85 ============================== PROCESS INITIAL CLAUSES ===============
% 0.56/0.85
% 0.56/0.85 ============================== PREDICATE ELIMINATION =================
% 0.56/0.85
% 0.56/0.85 ============================== end predicate elimination =============
% 0.56/0.85
% 0.56/0.85 Auto_denials:
% 0.56/0.85 % copying label goals to answer in negative clause
% 0.56/0.85
% 0.56/0.85 Term ordering decisions:
% 0.56/0.85 Function symbol KB weights: unit=1. zero=1. x0=1. x1=1. add=1. mult=1.
% 0.56/0.85
% 0.56/0.85 ============================== end of process initial clauses ========
% 0.56/0.85
% 0.56/0.85 ============================== CLAUSES FOR SEARCH ====================
% 0.56/0.85
% 0.56/0.85 ============================== end of clauses for search =============
% 0.56/0.85
% 0.56/0.85 ============================== SEARCH ================================
% 0.56/0.85
% 0.56/0.85 % Starting search at 0.01 seconds.
% 0.56/0.85
% 0.56/0.85 ============================== PROOF =================================
% 0.56/0.85 % SZS status Unsatisfiable
% 0.56/0.85 % SZS output start Refutation
% 0.56/0.85
% 0.56/0.85 % Proof 1 at 0.02 (+ 0.00) seconds: goals.
% 0.56/0.85 % Length of proof is 36.
% 0.56/0.85 % Level of proof is 14.
% 0.56/0.85 % Maximum clause weight is 13.000.
% 0.56/0.85 % Given clauses 29.
% 0.56/0.85
% 0.56/0.85 2 mult(A,unit) = A # label(sos_005) # label(axiom). [assumption].
% 0.56/0.85 3 add(A,B) = add(B,A) # label(sos_001) # label(axiom). [assumption].
% 0.56/0.85 4 mult(A,B) = mult(B,A) # label(sos_002) # label(axiom). [assumption].
% 0.56/0.85 5 add(unit,add(A,mult(A,A))) = A # label(sos_006) # label(axiom). [assumption].
% 0.56/0.85 6 add(A,add(B,C)) = add(add(A,B),C) # label(sos) # label(axiom). [assumption].
% 0.56/0.85 7 add(A,add(B,C)) = add(C,add(A,B)). [copy(6),rewrite([3(4)])].
% 0.56/0.85 8 mult(A,add(B,C)) = add(mult(A,B),mult(A,C)) # label(sos_003) # label(axiom). [assumption].
% 0.56/0.85 9 add(mult(A,B),mult(A,C)) = mult(A,add(B,C)). [copy(8),flip(a)].
% 0.56/0.85 10 add(x0,x1) != mult(x0,x1) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.56/0.85 11 mult(x0,x1) != add(x0,x1) # answer(goals). [copy(10),flip(a)].
% 0.56/0.85 13 add(A,add(unit,mult(A,A))) = A. [back_rewrite(5),rewrite([7(4,R),3(3)])].
% 0.56/0.85 14 mult(x0,x1) = c_0. [new_symbol(11)].
% 0.56/0.85 15 add(x0,x1) != c_0 # answer(goals). [back_rewrite(11),rewrite([14(3)]),flip(a)].
% 0.56/0.85 16 mult(A,add(B,unit)) = add(A,mult(A,B)). [para(2(a,1),9(a,1,1)),rewrite([3(4)]),flip(a)].
% 0.56/0.85 17 add(mult(A,B),mult(B,C)) = mult(B,add(A,C)). [para(4(a,1),9(a,1,1))].
% 0.56/0.85 18 add(unit,add(unit,unit)) = unit. [para(2(a,1),13(a,1,2,2))].
% 0.56/0.85 19 add(A,add(B,add(unit,mult(A,A)))) = add(A,B). [para(13(a,1),7(a,2,2)),rewrite([3(4),3(6)])].
% 0.56/0.85 20 mult(x0,add(A,x1)) = add(c_0,mult(A,x0)). [para(14(a,1),9(a,1,1)),rewrite([4(3),3(7)]),flip(a)].
% 0.56/0.85 21 mult(A,add(unit,unit)) = add(A,A). [para(2(a,1),16(a,2,2))].
% 0.56/0.85 22 mult(A,add(B,unit)) = add(A,mult(B,A)). [para(16(a,1),4(a,2)),rewrite([4(3),4(4)])].
% 0.56/0.85 35 mult(mult(A,B),add(unit,unit)) = mult(A,add(B,B)). [para(21(a,2),9(a,1))].
% 0.56/0.85 38 add(unit,unit) = unit. [para(21(a,1),13(a,1,2,2)),rewrite([7(11),3(10),18(10),18(8),3(5),18(5)]),flip(a)].
% 0.56/0.85 40 add(A,A) = A. [para(21(a,2),16(a,1,2)),rewrite([38(4),2(3),2(2),2(2)]),flip(a)].
% 0.56/0.85 41 mult(unit,mult(A,B)) = mult(A,B). [back_rewrite(35),rewrite([40(4),4(3),40(4)])].
% 0.56/0.85 44 add(A,add(A,B)) = add(A,B). [para(40(a,1),7(a,1)),rewrite([3(3),7(4,R),3(3),7(3,R),40(2)]),flip(a)].
% 0.56/0.85 58 add(A,unit) = A. [para(44(a,1),19(a,1,2)),rewrite([13(4)]),flip(a)].
% 0.56/0.85 65 add(A,mult(A,B)) = mult(A,B). [back_rewrite(22),rewrite([58(2),4(2)]),flip(a)].
% 0.56/0.85 66 add(A,mult(B,A)) = mult(B,A). [para(58(a,1),17(a,2,2)),rewrite([2(3),3(2),4(3)])].
% 0.56/0.85 68 add(x0,c_0) = c_0. [para(14(a,1),65(a,1,2)),rewrite([14(6)])].
% 0.56/0.85 70 add(unit,mult(A,B)) = mult(A,B). [para(41(a,1),65(a,1,2)),rewrite([41(6)])].
% 0.56/0.85 72 mult(A,add(A,B)) = mult(A,B). [para(65(a,1),19(a,2)),rewrite([70(4),9(3),3(1),65(3)])].
% 0.56/0.85 74 mult(A,A) = A. [back_rewrite(13),rewrite([70(3),65(2)])].
% 0.56/0.85 81 mult(A,add(B,A)) = add(B,A). [para(74(a,1),9(a,2)),rewrite([4(2),72(2),4(3),17(4),44(2)])].
% 0.56/0.85 82 mult(A,B) = add(A,B). [para(74(a,1),17(a,1,2)),rewrite([3(2),66(2),81(3)])].
% 0.56/0.85 83 add(x0,x1) = c_0. [para(74(a,1),20(a,2,2)),rewrite([82(5),44(5),3(6),68(6)])].
% 0.56/0.85 84 $F # answer(goals). [resolve(83,a,15,a)].
% 0.56/0.85
% 0.56/0.85 % SZS output end Refutation
% 0.56/0.85 ============================== end of proof ==========================
% 0.56/0.85
% 0.56/0.85 ============================== STATISTICS ============================
% 0.56/0.85
% 0.56/0.85 Given=29. Generated=478. Kept=80. proofs=1.
% 0.56/0.85 Usable=21. Sos=12. Demods=34. Limbo=2, Disabled=52. Hints=0.
% 0.56/0.85 Megabytes=0.08.
% 0.56/0.85 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.56/0.85
% 0.56/0.85 ============================== end of statistics =====================
% 0.56/0.85
% 0.56/0.85 ============================== end of search =========================
% 0.56/0.85
% 0.56/0.85 THEOREM PROVED
% 0.56/0.85 % SZS status Unsatisfiable
% 0.56/0.85
% 0.56/0.85 Exiting with 1 proof.
% 0.56/0.85
% 0.56/0.85 Process 29751 exit (max_proofs) Mon May 30 10:02:58 2022
% 0.56/0.85 Prover9 interrupted
%------------------------------------------------------------------------------