TSTP Solution File: COL044-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL044-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 : Fri Jul 15 00:39:48 EDT 2022
% Result : Unsatisfiable 1.29s 1.59s
% Output : Refutation 1.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COL044-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 : Tue May 31 10:18:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.29/1.59 ============================== Prover9 ===============================
% 1.29/1.59 Prover9 (32) version 2009-11A, November 2009.
% 1.29/1.59 Process 26283 was started by sandbox on n028.cluster.edu,
% 1.29/1.59 Tue May 31 10:18:36 2022
% 1.29/1.59 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26130_n028.cluster.edu".
% 1.29/1.59 ============================== end of head ===========================
% 1.29/1.59
% 1.29/1.59 ============================== INPUT =================================
% 1.29/1.59
% 1.29/1.59 % Reading from file /tmp/Prover9_26130_n028.cluster.edu
% 1.29/1.59
% 1.29/1.59 set(prolog_style_variables).
% 1.29/1.59 set(auto2).
% 1.29/1.59 % set(auto2) -> set(auto).
% 1.29/1.59 % set(auto) -> set(auto_inference).
% 1.29/1.59 % set(auto) -> set(auto_setup).
% 1.29/1.59 % set(auto_setup) -> set(predicate_elim).
% 1.29/1.59 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.29/1.59 % set(auto) -> set(auto_limits).
% 1.29/1.59 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.29/1.59 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.29/1.59 % set(auto) -> set(auto_denials).
% 1.29/1.59 % set(auto) -> set(auto_process).
% 1.29/1.59 % set(auto2) -> assign(new_constants, 1).
% 1.29/1.59 % set(auto2) -> assign(fold_denial_max, 3).
% 1.29/1.59 % set(auto2) -> assign(max_weight, "200.000").
% 1.29/1.59 % set(auto2) -> assign(max_hours, 1).
% 1.29/1.59 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.29/1.59 % set(auto2) -> assign(max_seconds, 0).
% 1.29/1.59 % set(auto2) -> assign(max_minutes, 5).
% 1.29/1.59 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.29/1.59 % set(auto2) -> set(sort_initial_sos).
% 1.29/1.59 % set(auto2) -> assign(sos_limit, -1).
% 1.29/1.59 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.29/1.59 % set(auto2) -> assign(max_megs, 400).
% 1.29/1.59 % set(auto2) -> assign(stats, some).
% 1.29/1.59 % set(auto2) -> clear(echo_input).
% 1.29/1.59 % set(auto2) -> set(quiet).
% 1.29/1.59 % set(auto2) -> clear(print_initial_clauses).
% 1.29/1.59 % set(auto2) -> clear(print_given).
% 1.29/1.59 assign(lrs_ticks,-1).
% 1.29/1.59 assign(sos_limit,10000).
% 1.29/1.59 assign(order,kbo).
% 1.29/1.59 set(lex_order_vars).
% 1.29/1.59 clear(print_given).
% 1.29/1.59
% 1.29/1.59 % formulas(sos). % not echoed (3 formulas)
% 1.29/1.59
% 1.29/1.59 ============================== end of input ==========================
% 1.29/1.59
% 1.29/1.59 % From the command line: assign(max_seconds, 300).
% 1.29/1.59
% 1.29/1.59 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.29/1.59
% 1.29/1.59 % Formulas that are not ordinary clauses:
% 1.29/1.59
% 1.29/1.59 ============================== end of process non-clausal formulas ===
% 1.29/1.59
% 1.29/1.59 ============================== PROCESS INITIAL CLAUSES ===============
% 1.29/1.59
% 1.29/1.59 ============================== PREDICATE ELIMINATION =================
% 1.29/1.59
% 1.29/1.59 ============================== end predicate elimination =============
% 1.29/1.59
% 1.29/1.59 Auto_denials:
% 1.29/1.59 % copying label prove_fixed_point to answer in negative clause
% 1.29/1.59
% 1.29/1.59 Term ordering decisions:
% 1.29/1.59
% 1.29/1.59 % Assigning unary symbol f kb_weight 0 and highest precedence (5).
% 1.29/1.59 Function symbol KB weights: b=1. n=1. apply=1. f=0.
% 1.29/1.59
% 1.29/1.59 ============================== end of process initial clauses ========
% 1.29/1.59
% 1.29/1.59 ============================== CLAUSES FOR SEARCH ====================
% 1.29/1.59
% 1.29/1.59 ============================== end of clauses for search =============
% 1.29/1.59
% 1.29/1.59 ============================== SEARCH ================================
% 1.29/1.59
% 1.29/1.59 % Starting search at 0.01 seconds.
% 1.29/1.59
% 1.29/1.59 ============================== PROOF =================================
% 1.29/1.59 % SZS status Unsatisfiable
% 1.29/1.59 % SZS output start Refutation
% 1.29/1.59
% 1.29/1.59 % Proof 1 at 0.59 (+ 0.01) seconds: prove_fixed_point.
% 1.29/1.59 % Length of proof is 11.
% 1.29/1.59 % Level of proof is 4.
% 1.29/1.59 % Maximum clause weight is 69.000.
% 1.29/1.59 % Given clauses 54.
% 1.29/1.59
% 1.29/1.59 1 apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)) # label(b_definition) # label(axiom). [assumption].
% 1.29/1.59 2 apply(apply(apply(n,A),B),C) = apply(apply(apply(A,C),B),C) # label(n_definition) # label(axiom). [assumption].
% 1.29/1.59 3 apply(A,f(A)) != apply(f(A),apply(A,f(A))) # label(prove_fixed_point) # label(negated_conjecture) # answer(prove_fixed_point). [assumption].
% 1.29/1.59 4 apply(f(A),apply(A,f(A))) != apply(A,f(A)) # answer(prove_fixed_point). [copy(3),flip(a)].
% 1.29/1.59 7 apply(apply(apply(n,b),A),B) = apply(B,apply(A,B)). [para(2(a,2),1(a,1))].
% 1.29/1.59 9 apply(apply(apply(n,apply(b,A)),B),C) = apply(apply(A,apply(C,B)),C). [para(1(a,1),2(a,2,1))].
% 1.29/1.59 17 apply(f(apply(apply(n,A),B)),apply(apply(apply(n,A),B),f(apply(apply(n,A),B)))) != apply(apply(apply(A,f(apply(apply(n,A),B))),B),f(apply(apply(n,A),B))) # answer(prove_fixed_point). [para(2(a,1),4(a,2))].
% 1.29/1.59 139 apply(apply(apply(n,b),apply(apply(A,B),C)),B) = apply(B,apply(apply(apply(n,A),C),B)). [para(2(a,2),7(a,2,2))].
% 1.29/1.59 237 apply(apply(apply(n,apply(b,apply(b,A))),B),C) = apply(A,apply(apply(C,B),C)). [para(9(a,2),1(a,1))].
% 1.29/1.59 2702 apply(f(apply(apply(n,apply(n,apply(b,apply(b,A)))),B)),apply(apply(apply(n,apply(n,apply(b,apply(b,A)))),B),f(apply(apply(n,apply(n,apply(b,apply(b,A)))),B)))) != apply(apply(A,apply(apply(B,f(apply(apply(n,apply(n,apply(b,apply(b,A)))),B))),B)),f(apply(apply(n,apply(n,apply(b,apply(b,A)))),B))) # answer(prove_fixed_point). [para(237(a,1),17(a,2,1))].
% 1.29/1.59 2703 $F # answer(prove_fixed_point). [resolve(2702,a,139,a(flip))].
% 1.29/1.59
% 1.29/1.59 % SZS output end Refutation
% 1.29/1.59 ============================== end of proof ==========================
% 1.29/1.59
% 1.29/1.59 ============================== STATISTICS ============================
% 1.29/1.59
% 1.29/1.59 Given=54. Generated=5856. Kept=2701. proofs=1.
% 1.29/1.59 Usable=53. Sos=2492. Demods=386. Limbo=62, Disabled=96. Hints=0.
% 1.29/1.59 Megabytes=5.71.
% 1.29/1.59 User_CPU=0.59, System_CPU=0.01, Wall_clock=1.
% 1.29/1.59
% 1.29/1.59 ============================== end of statistics =====================
% 1.29/1.59
% 1.29/1.59 ============================== end of search =========================
% 1.29/1.59
% 1.29/1.59 THEOREM PROVED
% 1.29/1.59 % SZS status Unsatisfiable
% 1.29/1.59
% 1.29/1.59 Exiting with 1 proof.
% 1.29/1.59
% 1.29/1.59 Process 26283 exit (max_proofs) Tue May 31 10:18:37 2022
% 1.29/1.59 Prover9 interrupted
%------------------------------------------------------------------------------