TSTP Solution File: LDA007-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LDA007-2 : TPTP v8.1.0. Bugfixed v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 : Sun Jul 17 16:45:35 EDT 2022
% Result : Unsatisfiable 0.79s 1.07s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LDA007-2 : TPTP v8.1.0. Bugfixed v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.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 May 30 04:47:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.79/1.07 ============================== Prover9 ===============================
% 0.79/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.07 Process 25866 was started by sandbox on n023.cluster.edu,
% 0.79/1.07 Mon May 30 04:47:28 2022
% 0.79/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25626_n023.cluster.edu".
% 0.79/1.07 ============================== end of head ===========================
% 0.79/1.07
% 0.79/1.07 ============================== INPUT =================================
% 0.79/1.07
% 0.79/1.07 % Reading from file /tmp/Prover9_25626_n023.cluster.edu
% 0.79/1.07
% 0.79/1.07 set(prolog_style_variables).
% 0.79/1.07 set(auto2).
% 0.79/1.07 % set(auto2) -> set(auto).
% 0.79/1.07 % set(auto) -> set(auto_inference).
% 0.79/1.07 % set(auto) -> set(auto_setup).
% 0.79/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.07 % set(auto) -> set(auto_limits).
% 0.79/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.07 % set(auto) -> set(auto_denials).
% 0.79/1.07 % set(auto) -> set(auto_process).
% 0.79/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.07 % set(auto2) -> assign(stats, some).
% 0.79/1.07 % set(auto2) -> clear(echo_input).
% 0.79/1.07 % set(auto2) -> set(quiet).
% 0.79/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.07 % set(auto2) -> clear(print_given).
% 0.79/1.07 assign(lrs_ticks,-1).
% 0.79/1.07 assign(sos_limit,10000).
% 0.79/1.07 assign(order,kbo).
% 0.79/1.07 set(lex_order_vars).
% 0.79/1.07 clear(print_given).
% 0.79/1.07
% 0.79/1.07 % formulas(sos). % not echoed (20 formulas)
% 0.79/1.07
% 0.79/1.07 ============================== end of input ==========================
% 0.79/1.07
% 0.79/1.07 % From the command line: assign(max_seconds, 300).
% 0.79/1.07
% 0.79/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.07
% 0.79/1.07 % Formulas that are not ordinary clauses:
% 0.79/1.07
% 0.79/1.07 ============================== end of process non-clausal formulas ===
% 0.79/1.07
% 0.79/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.07
% 0.79/1.07 ============================== PREDICATE ELIMINATION =================
% 0.79/1.07
% 0.79/1.07 ============================== end predicate elimination =============
% 0.79/1.07
% 0.79/1.07 Auto_denials: (non-Horn, no changes).
% 0.79/1.07
% 0.79/1.07 Term ordering decisions:
% 0.79/1.07
% 0.79/1.07 % Assigning unary symbol critical_point kb_weight 0 and highest precedence (17).
% 0.79/1.07 Function symbol KB weights: k=1. t=1. s=1. ts=1. tt=1. st=1. sk=1. stk=1. tk=1. tsk=1. tt_ts=1. ttk=1. f=1. a=1. critical_point=0.
% 0.79/1.07
% 0.79/1.07 ============================== end of process initial clauses ========
% 0.79/1.07
% 0.79/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.07
% 0.79/1.07 ============================== end of clauses for search =============
% 0.79/1.07
% 0.79/1.07 ============================== SEARCH ================================
% 0.79/1.07
% 0.79/1.07 % Starting search at 0.01 seconds.
% 0.79/1.07
% 0.79/1.07 ============================== PROOF =================================
% 0.79/1.07 % SZS status Unsatisfiable
% 0.79/1.07 % SZS output start Refutation
% 0.79/1.07
% 0.79/1.07 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.79/1.07 % Length of proof is 20.
% 0.79/1.07 % Level of proof is 4.
% 0.79/1.07 % Maximum clause weight is 13.000.
% 0.79/1.07 % Given clauses 92.
% 0.79/1.07
% 0.79/1.07 3 tt = f(t,t) # label(clause_1) # label(axiom). [assumption].
% 0.79/1.07 4 f(t,t) = tt. [copy(3),flip(a)].
% 0.79/1.07 7 ts = f(t,s) # label(clause_3) # label(axiom). [assumption].
% 0.79/1.07 8 f(t,s) = ts. [copy(7),flip(a)].
% 0.79/1.07 9 tt_ts = f(tt,ts) # label(clause_4) # label(axiom). [assumption].
% 0.79/1.07 10 f(tt,ts) = tt_ts. [copy(9),flip(a)].
% 0.79/1.07 13 tk = f(t,k) # label(clause_7) # label(axiom). [assumption].
% 0.79/1.07 14 f(t,k) = tk. [copy(13),flip(a)].
% 0.79/1.07 17 tsk = f(ts,k) # label(clause_9) # label(axiom). [assumption].
% 0.79/1.07 18 f(ts,k) = tsk. [copy(17),flip(a)].
% 0.79/1.07 25 f(A,f(B,C)) = f(f(A,B),f(A,C)) # label(a1) # label(axiom). [assumption].
% 0.79/1.07 26 f(f(A,B),f(A,C)) = f(A,f(B,C)). [copy(25),flip(a)].
% 0.79/1.07 30 f(t,tsk) != f(tt_ts,tk) # label(prove_equation) # label(negated_conjecture). [assumption].
% 0.79/1.07 31 f(tt_ts,tk) != f(t,tsk). [copy(30),flip(a)].
% 0.79/1.07 35 f(tt_ts,tk) = c_0. [new_symbol(31)].
% 0.79/1.07 36 f(t,tsk) != c_0. [back_rewrite(31),rewrite([35(3)]),flip(a)].
% 0.79/1.07 46 f(tt,f(t,A)) = f(t,f(t,A)). [para(4(a,1),26(a,1,1))].
% 0.79/1.07 57 f(f(t,A),tk) = f(t,f(A,k)). [para(14(a,1),26(a,1,2))].
% 0.79/1.07 136 f(t,ts) = tt_ts. [para(8(a,1),46(a,1,2)),rewrite([10(3),8(5)]),flip(a)].
% 0.79/1.07 333 $F. [para(18(a,1),57(a,2,2)),rewrite([136(3),35(3)]),flip(a),unit_del(a,36)].
% 0.79/1.07
% 0.79/1.07 % SZS output end Refutation
% 0.79/1.07 ============================== end of proof ==========================
% 0.79/1.07
% 0.79/1.07 ============================== STATISTICS ============================
% 0.79/1.07
% 0.79/1.07 Given=92. Generated=652. Kept=318. proofs=1.
% 0.79/1.07 Usable=91. Sos=224. Demods=221. Limbo=0, Disabled=23. Hints=0.
% 0.79/1.07 Megabytes=0.35.
% 0.79/1.07 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.79/1.07
% 0.79/1.07 ============================== end of statistics =====================
% 0.79/1.07
% 0.79/1.07 ============================== end of search =========================
% 0.79/1.07
% 0.79/1.07 THEOREM PROVED
% 0.79/1.07 % SZS status Unsatisfiable
% 0.79/1.07
% 0.79/1.07 Exiting with 1 proof.
% 0.79/1.07
% 0.79/1.07 Process 25866 exit (max_proofs) Mon May 30 04:47:28 2022
% 0.79/1.07 Prover9 interrupted
%------------------------------------------------------------------------------