TSTP Solution File: LDA001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LDA001-1 : TPTP v8.1.0. Released v1.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 : Sun Jul 17 16:45:34 EDT 2022
% Result : Unsatisfiable 0.71s 0.99s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LDA001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon May 30 02:21:31 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 17683 was started by sandbox on n027.cluster.edu,
% 0.71/0.99 Mon May 30 02:21:31 2022
% 0.71/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17370_n027.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_17370_n027.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (5 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials:
% 0.71/0.99 % copying label prove_equation to answer in negative clause
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: n2=1. n1=1. n3=1. u=1. f=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.01 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== PROOF =================================
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99 % SZS output start Refutation
% 0.71/0.99
% 0.71/0.99 % Proof 1 at 0.01 (+ 0.00) seconds: prove_equation.
% 0.71/0.99 % Length of proof is 12.
% 0.71/0.99 % Level of proof is 4.
% 0.71/0.99 % Maximum clause weight is 27.000.
% 0.71/0.99 % Given clauses 7.
% 0.71/0.99
% 0.71/0.99 1 n2 = f(n1,n1) # label(clause_2) # label(axiom). [assumption].
% 0.71/0.99 2 n3 = f(n2,n1) # label(clause_3) # label(axiom). [assumption].
% 0.71/0.99 3 n3 = f(f(n1,n1),n1). [copy(2),rewrite([1(2)])].
% 0.71/0.99 4 u = f(n2,n2) # label(clause_4) # label(axiom). [assumption].
% 0.71/0.99 5 u = f(f(n1,n1),f(n1,n1)). [copy(4),rewrite([1(2),1(5)])].
% 0.71/0.99 6 f(A,f(B,C)) = f(f(A,B),f(A,C)) # label(a1) # label(axiom). [assumption].
% 0.71/0.99 7 f(f(A,B),f(A,C)) = f(A,f(B,C)). [copy(6),flip(a)].
% 0.71/0.99 8 f(f(n3,n2),u) != f(f(u,u),u) # label(prove_equation) # label(negated_conjecture) # answer(prove_equation). [assumption].
% 0.71/0.99 9 f(f(f(f(n1,n1),n1),f(n1,n1)),f(n1,f(n1,n1))) != f(n1,f(n1,f(f(n1,n1),n1))) # answer(prove_equation). [copy(8),rewrite([3(1),1(6),5(10),7(16),5(16),7(22),5(21),7(27),7(26),7(23),5(23),7(29),7(28),7(25)])].
% 0.71/0.99 12 f(f(f(A,B),C),f(A,f(B,D))) = f(f(A,B),f(C,f(A,D))). [para(7(a,1),7(a,1,2))].
% 0.71/0.99 22 f(f(f(f(A,B),A),C),f(A,f(B,D))) = f(f(f(A,B),A),f(C,f(f(A,B),D))). [para(7(a,1),12(a,1,2))].
% 0.71/0.99 31 $F # answer(prove_equation). [back_rewrite(9),rewrite([22(15),7(15),7(11)]),xx(a)].
% 0.71/0.99
% 0.71/0.99 % SZS output end Refutation
% 0.71/0.99 ============================== end of proof ==========================
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=7. Generated=89. Kept=26. proofs=1.
% 0.71/0.99 Usable=6. Sos=9. Demods=21. Limbo=9, Disabled=7. Hints=0.
% 0.71/0.99 Megabytes=0.07.
% 0.71/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 THEOREM PROVED
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99
% 0.71/0.99 Exiting with 1 proof.
% 0.71/0.99
% 0.71/0.99 Process 17683 exit (max_proofs) Mon May 30 02:21:31 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------