TSTP Solution File: COL004-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL004-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:42 EDT 2022
% Result : Unsatisfiable 0.48s 0.80s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : COL004-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue May 31 12:49:58 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.48/0.80 ============================== Prover9 ===============================
% 0.48/0.80 Prover9 (32) version 2009-11A, November 2009.
% 0.48/0.80 Process 16877 was started by sandbox2 on n032.cluster.edu,
% 0.48/0.80 Tue May 31 12:49:59 2022
% 0.48/0.80 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16722_n032.cluster.edu".
% 0.48/0.80 ============================== end of head ===========================
% 0.48/0.80
% 0.48/0.80 ============================== INPUT =================================
% 0.48/0.80
% 0.48/0.80 % Reading from file /tmp/Prover9_16722_n032.cluster.edu
% 0.48/0.80
% 0.48/0.80 set(prolog_style_variables).
% 0.48/0.80 set(auto2).
% 0.48/0.80 % set(auto2) -> set(auto).
% 0.48/0.80 % set(auto) -> set(auto_inference).
% 0.48/0.80 % set(auto) -> set(auto_setup).
% 0.48/0.80 % set(auto_setup) -> set(predicate_elim).
% 0.48/0.80 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/0.80 % set(auto) -> set(auto_limits).
% 0.48/0.80 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/0.80 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/0.80 % set(auto) -> set(auto_denials).
% 0.48/0.80 % set(auto) -> set(auto_process).
% 0.48/0.80 % set(auto2) -> assign(new_constants, 1).
% 0.48/0.80 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/0.80 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/0.80 % set(auto2) -> assign(max_hours, 1).
% 0.48/0.80 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/0.80 % set(auto2) -> assign(max_seconds, 0).
% 0.48/0.80 % set(auto2) -> assign(max_minutes, 5).
% 0.48/0.80 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/0.80 % set(auto2) -> set(sort_initial_sos).
% 0.48/0.80 % set(auto2) -> assign(sos_limit, -1).
% 0.48/0.80 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/0.80 % set(auto2) -> assign(max_megs, 400).
% 0.48/0.80 % set(auto2) -> assign(stats, some).
% 0.48/0.80 % set(auto2) -> clear(echo_input).
% 0.48/0.80 % set(auto2) -> set(quiet).
% 0.48/0.80 % set(auto2) -> clear(print_initial_clauses).
% 0.48/0.80 % set(auto2) -> clear(print_given).
% 0.48/0.80 assign(lrs_ticks,-1).
% 0.48/0.80 assign(sos_limit,10000).
% 0.48/0.80 assign(order,kbo).
% 0.48/0.80 set(lex_order_vars).
% 0.48/0.80 clear(print_given).
% 0.48/0.80
% 0.48/0.80 % formulas(sos). % not echoed (3 formulas)
% 0.48/0.80
% 0.48/0.80 ============================== end of input ==========================
% 0.48/0.80
% 0.48/0.80 % From the command line: assign(max_seconds, 300).
% 0.48/0.80
% 0.48/0.80 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/0.80
% 0.48/0.80 % Formulas that are not ordinary clauses:
% 0.48/0.80
% 0.48/0.80 ============================== end of process non-clausal formulas ===
% 0.48/0.80
% 0.48/0.80 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/0.80
% 0.48/0.80 ============================== PREDICATE ELIMINATION =================
% 0.48/0.80
% 0.48/0.80 ============================== end predicate elimination =============
% 0.48/0.80
% 0.48/0.80 Auto_denials:
% 0.48/0.80 % copying label prove_u_combinator to answer in negative clause
% 0.48/0.80
% 0.48/0.80 Term ordering decisions:
% 0.48/0.80 Function symbol KB weights: k=1. s=1. x=1. y=1. apply=1.
% 0.48/0.80
% 0.48/0.80 ============================== end of process initial clauses ========
% 0.48/0.80
% 0.48/0.80 ============================== CLAUSES FOR SEARCH ====================
% 0.48/0.80
% 0.48/0.80 ============================== end of clauses for search =============
% 0.48/0.80
% 0.48/0.80 ============================== SEARCH ================================
% 0.48/0.80
% 0.48/0.80 % Starting search at 0.01 seconds.
% 0.48/0.80
% 0.48/0.80 ============================== PROOF =================================
% 0.48/0.80 % SZS status Unsatisfiable
% 0.48/0.80 % SZS output start Refutation
% 0.48/0.80
% 0.48/0.80 % Proof 1 at 0.01 (+ 0.00) seconds: prove_u_combinator.
% 0.48/0.80 % Length of proof is 9.
% 0.48/0.80 % Level of proof is 4.
% 0.48/0.80 % Maximum clause weight is 37.000.
% 0.48/0.80 % Given clauses 4.
% 0.48/0.80
% 0.48/0.80 1 apply(apply(k,A),B) = A # label(k_definition) # label(axiom). [assumption].
% 0.48/0.80 2 apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)) # label(s_definition) # label(axiom). [assumption].
% 0.48/0.80 3 apply(apply(apply(apply(s,apply(k,apply(s,apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))),x),y) != apply(y,apply(apply(x,x),y)) # label(prove_u_combinator) # label(negated_conjecture) # answer(prove_u_combinator). [assumption].
% 0.48/0.80 4 apply(apply(apply(s,k),A),B) = B. [para(2(a,2),1(a,1))].
% 0.48/0.80 5 apply(apply(apply(s,apply(k,A)),B),C) = apply(A,apply(B,C)). [para(1(a,1),2(a,2,1))].
% 0.48/0.80 13 apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),x)),y) != apply(y,apply(apply(x,x),y)) # answer(prove_u_combinator). [back_rewrite(3),rewrite([5(27)])].
% 0.48/0.80 14 apply(apply(apply(s,apply(apply(s,k),A)),B),C) = apply(C,apply(B,C)). [para(4(a,1),2(a,2,1))].
% 0.48/0.80 18 apply(apply(apply(s,apply(apply(s,k),k)),apply(x,x)),y) != apply(y,apply(apply(x,x),y)) # answer(prove_u_combinator). [para(2(a,1),13(a,1,1,2)),rewrite([4(14),4(15)])].
% 0.48/0.80 19 $F # answer(prove_u_combinator). [resolve(18,a,14,a)].
% 0.48/0.80
% 0.48/0.80 % SZS output end Refutation
% 0.48/0.80 ============================== end of proof ==========================
% 0.48/0.80
% 0.48/0.80 ============================== STATISTICS ============================
% 0.48/0.80
% 0.48/0.80 Given=4. Generated=29. Kept=18. proofs=1.
% 0.48/0.80 Usable=4. Sos=12. Demods=9. Limbo=0, Disabled=4. Hints=0.
% 0.48/0.80 Megabytes=0.06.
% 0.48/0.80 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.48/0.80
% 0.48/0.80 ============================== end of statistics =====================
% 0.48/0.80
% 0.48/0.80 ============================== end of search =========================
% 0.48/0.80
% 0.48/0.80 THEOREM PROVED
% 0.48/0.80 % SZS status Unsatisfiable
% 0.48/0.80
% 0.48/0.80 Exiting with 1 proof.
% 0.48/0.80
% 0.48/0.80 Process 16877 exit (max_proofs) Tue May 31 12:49:59 2022
% 0.48/0.80 Prover9 interrupted
%------------------------------------------------------------------------------