TSTP Solution File: COL060-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : COL060-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 : Fri Jul 15 00:39:51 EDT 2022

% Result   : Unsatisfiable 0.69s 1.08s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : COL060-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue May 31 09:38:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.69/1.08  ============================== Prover9 ===============================
% 0.69/1.08  Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.08  Process 13812 was started by sandbox on n027.cluster.edu,
% 0.69/1.08  Tue May 31 09:38:18 2022
% 0.69/1.08  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13658_n027.cluster.edu".
% 0.69/1.08  ============================== end of head ===========================
% 0.69/1.08  
% 0.69/1.08  ============================== INPUT =================================
% 0.69/1.08  
% 0.69/1.08  % Reading from file /tmp/Prover9_13658_n027.cluster.edu
% 0.69/1.08  
% 0.69/1.08  set(prolog_style_variables).
% 0.69/1.08  set(auto2).
% 0.69/1.08      % set(auto2) -> set(auto).
% 0.69/1.08      % set(auto) -> set(auto_inference).
% 0.69/1.08      % set(auto) -> set(auto_setup).
% 0.69/1.08      % set(auto_setup) -> set(predicate_elim).
% 0.69/1.08      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.08      % set(auto) -> set(auto_limits).
% 0.69/1.08      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.08      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.08      % set(auto) -> set(auto_denials).
% 0.69/1.08      % set(auto) -> set(auto_process).
% 0.69/1.08      % set(auto2) -> assign(new_constants, 1).
% 0.69/1.08      % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.08      % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.08      % set(auto2) -> assign(max_hours, 1).
% 0.69/1.08      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.08      % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.08      % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.08      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.08      % set(auto2) -> set(sort_initial_sos).
% 0.69/1.08      % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.08      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.08      % set(auto2) -> assign(max_megs, 400).
% 0.69/1.08      % set(auto2) -> assign(stats, some).
% 0.69/1.08      % set(auto2) -> clear(echo_input).
% 0.69/1.08      % set(auto2) -> set(quiet).
% 0.69/1.08      % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.08      % set(auto2) -> clear(print_given).
% 0.69/1.08  assign(lrs_ticks,-1).
% 0.69/1.08  assign(sos_limit,10000).
% 0.69/1.08  assign(order,kbo).
% 0.69/1.08  set(lex_order_vars).
% 0.69/1.08  clear(print_given).
% 0.69/1.08  
% 0.69/1.08  % formulas(sos).  % not echoed (3 formulas)
% 0.69/1.08  
% 0.69/1.08  ============================== end of input ==========================
% 0.69/1.08  
% 0.69/1.08  % From the command line: assign(max_seconds, 300).
% 0.69/1.08  
% 0.69/1.08  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.08  
% 0.69/1.08  % Formulas that are not ordinary clauses:
% 0.69/1.08  
% 0.69/1.08  ============================== end of process non-clausal formulas ===
% 0.69/1.08  
% 0.69/1.08  ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.08  
% 0.69/1.08  ============================== PREDICATE ELIMINATION =================
% 0.69/1.08  
% 0.69/1.08  ============================== end predicate elimination =============
% 0.69/1.08  
% 0.69/1.08  Auto_denials:
% 0.69/1.08    % copying label prove_q_combinator to answer in negative clause
% 0.69/1.08  
% 0.69/1.08  Term ordering decisions:
% 0.69/1.08  Function symbol KB weights:  b=1. t=1. apply=1. f=1. g=1. h=1.
% 0.69/1.08  
% 0.69/1.08  ============================== end of process initial clauses ========
% 0.69/1.08  
% 0.69/1.08  ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.08  
% 0.69/1.08  ============================== end of clauses for search =============
% 0.69/1.08  
% 0.69/1.08  ============================== SEARCH ================================
% 0.69/1.08  
% 0.69/1.08  % Starting search at 0.01 seconds.
% 0.69/1.08  
% 0.69/1.08  ============================== PROOF =================================
% 0.69/1.08  % SZS status Unsatisfiable
% 0.69/1.08  % SZS output start Refutation
% 0.69/1.08  
% 0.69/1.08  % Proof 1 at 0.12 (+ 0.00) seconds: prove_q_combinator.
% 0.69/1.08  % Length of proof is 9.
% 0.69/1.08  % Level of proof is 6.
% 0.69/1.08  % Maximum clause weight is 83.000.
% 0.69/1.08  % Given clauses 156.
% 0.69/1.08  
% 0.69/1.08  1 apply(apply(t,A),B) = apply(B,A) # label(t_definition) # label(axiom).  [assumption].
% 0.69/1.08  2 apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)) # label(b_definition) # label(axiom).  [assumption].
% 0.69/1.08  3 apply(apply(apply(A,f(A)),g(A)),h(A)) != apply(g(A),apply(f(A),h(A))) # label(prove_q_combinator) # label(negated_conjecture) # answer(prove_q_combinator).  [assumption].
% 0.69/1.08  6 apply(apply(apply(A,apply(B,f(apply(apply(b,A),B)))),g(apply(apply(b,A),B))),h(apply(apply(b,A),B))) != apply(g(apply(apply(b,A),B)),apply(f(apply(apply(b,A),B)),h(apply(apply(b,A),B)))) # answer(prove_q_combinator).  [para(2(a,1),3(a,1,1,1))].
% 0.69/1.08  14 apply(apply(apply(apply(A,f(apply(apply(b,apply(t,B)),A))),B),g(apply(apply(b,apply(t,B)),A))),h(apply(apply(b,apply(t,B)),A))) != apply(g(apply(apply(b,apply(t,B)),A)),apply(f(apply(apply(b,apply(t,B)),A)),h(apply(apply(b,apply(t,B)),A)))) # answer(prove_q_combinator).  [para(1(a,1),6(a,1,1,1))].
% 0.69/1.08  42 apply(apply(apply(apply(A,apply(B,f(apply(apply(b,apply(t,C)),apply(apply(b,A),B))))),C),g(apply(apply(b,apply(t,C)),apply(apply(b,A),B)))),h(apply(apply(b,apply(t,C)),apply(apply(b,A),B)))) != apply(g(apply(apply(b,apply(t,C)),apply(apply(b,A),B))),apply(f(apply(apply(b,apply(t,C)),apply(apply(b,A),B))),h(apply(apply(b,apply(t,C)),apply(apply(b,A),B))))) # answer(prove_q_combinator).  [para(2(a,1),14(a,1,1,1,1))].
% 0.69/1.08  187 apply(apply(apply(A,f(apply(apply(b,apply(t,B)),apply(apply(b,b),A)))),apply(B,g(apply(apply(b,apply(t,B)),apply(apply(b,b),A))))),h(apply(apply(b,apply(t,B)),apply(apply(b,b),A)))) != apply(g(apply(apply(b,apply(t,B)),apply(apply(b,b),A))),apply(f(apply(apply(b,apply(t,B)),apply(apply(b,b),A))),h(apply(apply(b,apply(t,B)),apply(apply(b,b),A))))) # answer(prove_q_combinator).  [para(2(a,1),42(a,1,1))].
% 0.69/1.08  421 apply(apply(apply(A,g(apply(apply(b,apply(t,A)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,A)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,A)),apply(apply(b,b),t)))) != apply(g(apply(apply(b,apply(t,A)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,A)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,A)),apply(apply(b,b),t))))) # answer(prove_q_combinator).  [para(1(a,1),187(a,1,1))].
% 0.69/1.08  422 $F # answer(prove_q_combinator).  [resolve(421,a,2,a)].
% 0.69/1.08  
% 0.69/1.08  % SZS output end Refutation
% 0.69/1.08  ============================== end of proof ==========================
% 0.69/1.08  
% 0.69/1.08  ============================== STATISTICS ============================
% 0.69/1.08  
% 0.69/1.08  Given=156. Generated=536. Kept=421. proofs=1.
% 0.69/1.08  Usable=156. Sos=262. Demods=2. Limbo=2, Disabled=3. Hints=0.
% 0.69/1.08  Megabytes=2.68.
% 0.69/1.08  User_CPU=0.12, System_CPU=0.00, Wall_clock=0.
% 0.69/1.08  
% 0.69/1.08  ============================== end of statistics =====================
% 0.69/1.08  
% 0.69/1.08  ============================== end of search =========================
% 0.69/1.08  
% 0.69/1.08  THEOREM PROVED
% 0.69/1.08  % SZS status Unsatisfiable
% 0.69/1.08  
% 0.69/1.08  Exiting with 1 proof.
% 0.69/1.08  
% 0.69/1.08  Process 13812 exit (max_proofs) Tue May 31 09:38:18 2022
% 0.69/1.08  Prover9 interrupted
%------------------------------------------------------------------------------