TSTP Solution File: COL077-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL077-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:56 EDT 2022
% Result : Unsatisfiable 0.72s 1.03s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COL077-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 15:01:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.03 ============================== Prover9 ===============================
% 0.72/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.03 Process 5489 was started by sandbox on n022.cluster.edu,
% 0.72/1.03 Tue May 31 15:01:08 2022
% 0.72/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5336_n022.cluster.edu".
% 0.72/1.03 ============================== end of head ===========================
% 0.72/1.03
% 0.72/1.03 ============================== INPUT =================================
% 0.72/1.03
% 0.72/1.03 % Reading from file /tmp/Prover9_5336_n022.cluster.edu
% 0.72/1.03
% 0.72/1.03 set(prolog_style_variables).
% 0.72/1.03 set(auto2).
% 0.72/1.03 % set(auto2) -> set(auto).
% 0.72/1.03 % set(auto) -> set(auto_inference).
% 0.72/1.03 % set(auto) -> set(auto_setup).
% 0.72/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.03 % set(auto) -> set(auto_limits).
% 0.72/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.03 % set(auto) -> set(auto_denials).
% 0.72/1.03 % set(auto) -> set(auto_process).
% 0.72/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.03 % set(auto2) -> assign(stats, some).
% 0.72/1.03 % set(auto2) -> clear(echo_input).
% 0.72/1.03 % set(auto2) -> set(quiet).
% 0.72/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.03 % set(auto2) -> clear(print_given).
% 0.72/1.03 assign(lrs_ticks,-1).
% 0.72/1.03 assign(sos_limit,10000).
% 0.72/1.03 assign(order,kbo).
% 0.72/1.03 set(lex_order_vars).
% 0.72/1.03 clear(print_given).
% 0.72/1.03
% 0.72/1.03 % formulas(sos). % not echoed (12 formulas)
% 0.72/1.03
% 0.72/1.03 ============================== end of input ==========================
% 0.72/1.03
% 0.72/1.03 % From the command line: assign(max_seconds, 300).
% 0.72/1.03
% 0.72/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.03
% 0.72/1.03 % Formulas that are not ordinary clauses:
% 0.72/1.03
% 0.72/1.03 ============================== end of process non-clausal formulas ===
% 0.72/1.03
% 0.72/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.03
% 0.72/1.03 ============================== PREDICATE ELIMINATION =================
% 0.72/1.03
% 0.72/1.03 ============================== end predicate elimination =============
% 0.72/1.03
% 0.72/1.03 Auto_denials: (non-Horn, no changes).
% 0.72/1.03
% 0.72/1.03 Term ordering decisions:
% 0.72/1.03
% 0.72/1.03 % Assigning unary symbol k kb_weight 0 and highest precedence (10).
% 0.72/1.03 Function symbol KB weights: projection1=1. projection2=1. eq=1. abstraction=1. identity=1. apply=1. pair=1. n=1. k=0.
% 0.72/1.03
% 0.72/1.03 ============================== end of process initial clauses ========
% 0.72/1.03
% 0.72/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.03
% 0.72/1.03 ============================== end of clauses for search =============
% 0.72/1.03
% 0.72/1.03 ============================== SEARCH ================================
% 0.72/1.03
% 0.72/1.03 % Starting search at 0.01 seconds.
% 0.72/1.03
% 0.72/1.03 ============================== PROOF =================================
% 0.72/1.03 % SZS status Unsatisfiable
% 0.72/1.03 % SZS output start Refutation
% 0.72/1.03
% 0.72/1.03 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.72/1.03 % Length of proof is 11.
% 0.72/1.03 % Level of proof is 5.
% 0.72/1.03 % Maximum clause weight is 44.000.
% 0.72/1.03 % Given clauses 62.
% 0.72/1.03
% 0.72/1.03 1 apply(identity,A) = A # label(identity_definition) # label(axiom). [assumption].
% 0.72/1.03 2 apply(k(A),B) = A # label(k_definition) # label(axiom). [assumption].
% 0.72/1.03 10 apply(apply(apply(abstraction,A),B),C) = apply(apply(A,k(C)),apply(B,C)) # label(abstraction) # label(axiom). [assumption].
% 0.72/1.03 13 apply(apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),abstraction),abstraction) != identity # label(prove_TRC1a) # label(negated_conjecture). [assumption].
% 0.72/1.03 14 A = B | apply(A,n(A,B)) != apply(B,n(A,B)) # label(extensionality2) # label(axiom). [assumption].
% 0.72/1.03 15 A = B | apply(B,n(A,B)) != apply(A,n(A,B)). [copy(14),flip(b)].
% 0.72/1.03 39 apply(apply(apply(abstraction,k(A)),B),C) = apply(A,apply(B,C)). [para(2(a,1),10(a,2,1))].
% 0.72/1.03 50 apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction) != identity. [para(10(a,1),13(a,1,1,1)),rewrite([39(10)])].
% 0.72/1.03 74 apply(apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction),n(apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction),identity)) != n(apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction),identity). [ur(15,a,50,a),rewrite([1(13)]),flip(a)].
% 0.72/1.03 82 apply(apply(apply(apply(abstraction,abstraction),abstraction),k(n(apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction),identity))),apply(abstraction,n(apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction),identity))) != n(apply(apply(abstraction,apply(apply(abstraction,abstraction),abstraction)),abstraction),identity). [para(10(a,1),74(a,1))].
% 0.72/1.03 361 $F. [para(10(a,1),82(a,1,1)),rewrite([39(44),2(41)]),xx(a)].
% 0.72/1.03
% 0.72/1.03 % SZS output end Refutation
% 0.72/1.03 ============================== end of proof ==========================
% 0.72/1.03
% 0.72/1.03 ============================== STATISTICS ============================
% 0.72/1.03
% 0.72/1.03 Given=62. Generated=802. Kept=357. proofs=1.
% 0.72/1.03 Usable=56. Sos=244. Demods=105. Limbo=2, Disabled=67. Hints=0.
% 0.72/1.03 Megabytes=0.78.
% 0.72/1.03 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.72/1.03
% 0.72/1.03 ============================== end of statistics =====================
% 0.72/1.03
% 0.72/1.03 ============================== end of search =========================
% 0.72/1.03
% 0.72/1.03 THEOREM PROVED
% 0.72/1.03 % SZS status Unsatisfiable
% 0.72/1.03
% 0.72/1.03 Exiting with 1 proof.
% 0.72/1.03
% 0.72/1.03 Process 5489 exit (max_proofs) Tue May 31 15:01:08 2022
% 0.72/1.03 Prover9 interrupted
%------------------------------------------------------------------------------