TSTP Solution File: COL044-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL044-5 : 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:48 EDT 2022
% Result : Unsatisfiable 0.90s 1.19s
% Output : Refutation 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL044-5 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n022.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 12:42:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.90/1.19 ============================== Prover9 ===============================
% 0.90/1.19 Prover9 (32) version 2009-11A, November 2009.
% 0.90/1.19 Process 10548 was started by sandbox2 on n022.cluster.edu,
% 0.90/1.19 Tue May 31 12:42:38 2022
% 0.90/1.19 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10394_n022.cluster.edu".
% 0.90/1.19 ============================== end of head ===========================
% 0.90/1.19
% 0.90/1.19 ============================== INPUT =================================
% 0.90/1.19
% 0.90/1.19 % Reading from file /tmp/Prover9_10394_n022.cluster.edu
% 0.90/1.19
% 0.90/1.19 set(prolog_style_variables).
% 0.90/1.19 set(auto2).
% 0.90/1.19 % set(auto2) -> set(auto).
% 0.90/1.19 % set(auto) -> set(auto_inference).
% 0.90/1.19 % set(auto) -> set(auto_setup).
% 0.90/1.19 % set(auto_setup) -> set(predicate_elim).
% 0.90/1.19 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.90/1.19 % set(auto) -> set(auto_limits).
% 0.90/1.19 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.90/1.19 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.90/1.19 % set(auto) -> set(auto_denials).
% 0.90/1.19 % set(auto) -> set(auto_process).
% 0.90/1.19 % set(auto2) -> assign(new_constants, 1).
% 0.90/1.19 % set(auto2) -> assign(fold_denial_max, 3).
% 0.90/1.19 % set(auto2) -> assign(max_weight, "200.000").
% 0.90/1.19 % set(auto2) -> assign(max_hours, 1).
% 0.90/1.19 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.90/1.19 % set(auto2) -> assign(max_seconds, 0).
% 0.90/1.19 % set(auto2) -> assign(max_minutes, 5).
% 0.90/1.19 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.90/1.19 % set(auto2) -> set(sort_initial_sos).
% 0.90/1.19 % set(auto2) -> assign(sos_limit, -1).
% 0.90/1.19 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.90/1.19 % set(auto2) -> assign(max_megs, 400).
% 0.90/1.19 % set(auto2) -> assign(stats, some).
% 0.90/1.19 % set(auto2) -> clear(echo_input).
% 0.90/1.19 % set(auto2) -> set(quiet).
% 0.90/1.19 % set(auto2) -> clear(print_initial_clauses).
% 0.90/1.19 % set(auto2) -> clear(print_given).
% 0.90/1.19 assign(lrs_ticks,-1).
% 0.90/1.19 assign(sos_limit,10000).
% 0.90/1.19 assign(order,kbo).
% 0.90/1.19 set(lex_order_vars).
% 0.90/1.19 clear(print_given).
% 0.90/1.19
% 0.90/1.19 % formulas(sos). % not echoed (4 formulas)
% 0.90/1.19
% 0.90/1.19 ============================== end of input ==========================
% 0.90/1.19
% 0.90/1.19 % From the command line: assign(max_seconds, 300).
% 0.90/1.19
% 0.90/1.19 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.90/1.19
% 0.90/1.19 % Formulas that are not ordinary clauses:
% 0.90/1.19
% 0.90/1.19 ============================== end of process non-clausal formulas ===
% 0.90/1.19
% 0.90/1.19 ============================== PROCESS INITIAL CLAUSES ===============
% 0.90/1.19
% 0.90/1.19 ============================== PREDICATE ELIMINATION =================
% 0.90/1.19
% 0.90/1.19 ============================== end predicate elimination =============
% 0.90/1.19
% 0.90/1.19 Auto_denials:
% 0.90/1.19 % copying label prove_strong_fixed_point to answer in negative clause
% 0.90/1.19
% 0.90/1.19 Term ordering decisions:
% 0.90/1.19 Function symbol KB weights: fixed_pt=1. b=1. n=1. apply=1.
% 0.90/1.19
% 0.90/1.19 ============================== end of process initial clauses ========
% 0.90/1.19
% 0.90/1.19 ============================== CLAUSES FOR SEARCH ====================
% 0.90/1.19
% 0.90/1.19 ============================== end of clauses for search =============
% 0.90/1.19
% 0.90/1.19 ============================== SEARCH ================================
% 0.90/1.19
% 0.90/1.19 % Starting search at 0.01 seconds.
% 0.90/1.19
% 0.90/1.19 ============================== PROOF =================================
% 0.90/1.19 % SZS status Unsatisfiable
% 0.90/1.19 % SZS output start Refutation
% 0.90/1.19
% 0.90/1.19 % Proof 1 at 0.18 (+ 0.01) seconds: prove_strong_fixed_point.
% 0.90/1.19 % Length of proof is 14.
% 0.90/1.19 % Level of proof is 7.
% 0.90/1.19 % Maximum clause weight is 53.000.
% 0.90/1.19 % Given clauses 41.
% 0.90/1.19
% 0.90/1.19 1 apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)) # label(b_definition) # label(axiom). [assumption].
% 0.90/1.19 2 apply(apply(apply(n,A),B),C) = apply(apply(apply(A,C),B),C) # label(n_definition) # label(axiom). [assumption].
% 0.90/1.19 3 -fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(n,apply(b,b)))))),n)),b)),b)) # label(prove_strong_fixed_point) # label(negated_conjecture) # answer(prove_strong_fixed_point). [assumption].
% 0.90/1.19 4 apply(A,fixed_pt) != apply(fixed_pt,apply(A,fixed_pt)) | fixed_point(A) # label(strong_fixed_point) # label(axiom). [assumption].
% 0.90/1.19 5 apply(fixed_pt,apply(A,fixed_pt)) != apply(A,fixed_pt) | fixed_point(A). [copy(4),flip(a)].
% 0.90/1.19 10 apply(apply(apply(n,apply(b,A)),B),C) = apply(apply(A,apply(C,B)),C). [para(1(a,1),2(a,2,1))].
% 0.90/1.19 12 apply(apply(apply(apply(A,B),C),B),C) = apply(apply(apply(n,apply(n,A)),B),C). [para(2(a,1),2(a,2,1)),flip(a)].
% 0.90/1.19 16 apply(fixed_pt,apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(n,apply(b,b)))))),n),apply(b,apply(b,fixed_pt)))) != apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(n,apply(b,b)))))),n),apply(b,apply(b,fixed_pt))) # answer(prove_strong_fixed_point). [ur(5,b,3,a),rewrite([1(30),1(28),1(56),1(54)])].
% 0.90/1.19 139 apply(apply(apply(n,apply(b,apply(b,A))),B),C) = apply(A,apply(apply(C,B),C)). [para(10(a,2),1(a,1))].
% 0.90/1.19 498 apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(n,apply(b,b)))))),n),apply(b,apply(b,fixed_pt))) != apply(fixed_pt,apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt))))) # answer(prove_strong_fixed_point). [para(12(a,2),16(a,1,2)),rewrite([1(16),1(20),1(26)]),flip(a)].
% 0.90/1.19 1258 apply(fixed_pt,apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))) # answer(prove_strong_fixed_point). [para(12(a,2),498(a,1)),rewrite([1(15),1(19),1(25)]),flip(a)].
% 0.90/1.19 1262 apply(fixed_pt,apply(apply(apply(n,apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))) # answer(prove_strong_fixed_point). [para(12(a,2),1258(a,1,2,1)),rewrite([1(12),1(18)])].
% 0.90/1.19 1266 apply(fixed_pt,apply(apply(apply(n,apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(n,apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),apply(n,apply(b,apply(b,fixed_pt)))) # answer(prove_strong_fixed_point). [para(12(a,2),1262(a,2,1)),rewrite([1(36),1(42)])].
% 0.90/1.19 1267 $F # answer(prove_strong_fixed_point). [resolve(1266,a,139,a(flip))].
% 0.90/1.19
% 0.90/1.19 % SZS output end Refutation
% 0.90/1.19 ============================== end of proof ==========================
% 0.90/1.19
% 0.90/1.19 ============================== STATISTICS ============================
% 0.90/1.19
% 0.90/1.19 Given=41. Generated=3075. Kept=1265. proofs=1.
% 0.90/1.19 Usable=40. Sos=1164. Demods=246. Limbo=2, Disabled=62. Hints=0.
% 0.90/1.19 Megabytes=2.11.
% 0.90/1.19 User_CPU=0.18, System_CPU=0.01, Wall_clock=0.
% 0.90/1.19
% 0.90/1.19 ============================== end of statistics =====================
% 0.90/1.19
% 0.90/1.19 ============================== end of search =========================
% 0.90/1.19
% 0.90/1.19 THEOREM PROVED
% 0.90/1.19 % SZS status Unsatisfiable
% 0.90/1.19
% 0.90/1.19 Exiting with 1 proof.
% 0.90/1.19
% 0.90/1.19 Process 10548 exit (max_proofs) Tue May 31 12:42:38 2022
% 0.90/1.19 Prover9 interrupted
%------------------------------------------------------------------------------