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