TSTP Solution File: COL003-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL003-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:41 EDT 2022
% Result : Unsatisfiable 1.18s 1.44s
% Output : Refutation 1.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : COL003-6 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n019.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.13/0.35 % DateTime : Tue May 31 11:36:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.10/1.44 ============================== Prover9 ===============================
% 1.10/1.44 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.44 Process 9355 was started by sandbox on n019.cluster.edu,
% 1.10/1.44 Tue May 31 11:36:26 2022
% 1.10/1.44 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9188_n019.cluster.edu".
% 1.10/1.44 ============================== end of head ===========================
% 1.10/1.44
% 1.10/1.44 ============================== INPUT =================================
% 1.10/1.44
% 1.10/1.44 % Reading from file /tmp/Prover9_9188_n019.cluster.edu
% 1.10/1.44
% 1.10/1.44 set(prolog_style_variables).
% 1.10/1.44 set(auto2).
% 1.10/1.44 % set(auto2) -> set(auto).
% 1.10/1.44 % set(auto) -> set(auto_inference).
% 1.10/1.44 % set(auto) -> set(auto_setup).
% 1.10/1.44 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.44 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.44 % set(auto) -> set(auto_limits).
% 1.10/1.44 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.44 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.44 % set(auto) -> set(auto_denials).
% 1.10/1.44 % set(auto) -> set(auto_process).
% 1.10/1.44 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.44 % set(auto2) -> assign(fold_denial_max, 3).
% 1.18/1.44 % set(auto2) -> assign(max_weight, "200.000").
% 1.18/1.44 % set(auto2) -> assign(max_hours, 1).
% 1.18/1.44 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.18/1.44 % set(auto2) -> assign(max_seconds, 0).
% 1.18/1.44 % set(auto2) -> assign(max_minutes, 5).
% 1.18/1.44 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.18/1.44 % set(auto2) -> set(sort_initial_sos).
% 1.18/1.44 % set(auto2) -> assign(sos_limit, -1).
% 1.18/1.44 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.18/1.44 % set(auto2) -> assign(max_megs, 400).
% 1.18/1.44 % set(auto2) -> assign(stats, some).
% 1.18/1.44 % set(auto2) -> clear(echo_input).
% 1.18/1.44 % set(auto2) -> set(quiet).
% 1.18/1.44 % set(auto2) -> clear(print_initial_clauses).
% 1.18/1.44 % set(auto2) -> clear(print_given).
% 1.18/1.44 assign(lrs_ticks,-1).
% 1.18/1.44 assign(sos_limit,10000).
% 1.18/1.44 assign(order,kbo).
% 1.18/1.44 set(lex_order_vars).
% 1.18/1.44 clear(print_given).
% 1.18/1.44
% 1.18/1.44 % formulas(sos). % not echoed (4 formulas)
% 1.18/1.44
% 1.18/1.44 ============================== end of input ==========================
% 1.18/1.44
% 1.18/1.44 % From the command line: assign(max_seconds, 300).
% 1.18/1.44
% 1.18/1.44 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.18/1.44
% 1.18/1.44 % Formulas that are not ordinary clauses:
% 1.18/1.44
% 1.18/1.44 ============================== end of process non-clausal formulas ===
% 1.18/1.44
% 1.18/1.44 ============================== PROCESS INITIAL CLAUSES ===============
% 1.18/1.44
% 1.18/1.44 ============================== PREDICATE ELIMINATION =================
% 1.18/1.44
% 1.18/1.44 ============================== end predicate elimination =============
% 1.18/1.44
% 1.18/1.44 Auto_denials:
% 1.18/1.44 % copying label prove_strong_fixed_point to answer in negative clause
% 1.18/1.44
% 1.18/1.44 Term ordering decisions:
% 1.18/1.44 Function symbol KB weights: fixed_pt=1. b=1. w=1. apply=1.
% 1.18/1.44
% 1.18/1.44 ============================== end of process initial clauses ========
% 1.18/1.44
% 1.18/1.44 ============================== CLAUSES FOR SEARCH ====================
% 1.18/1.44
% 1.18/1.44 ============================== end of clauses for search =============
% 1.18/1.44
% 1.18/1.44 ============================== SEARCH ================================
% 1.18/1.44
% 1.18/1.44 % Starting search at 0.01 seconds.
% 1.18/1.44
% 1.18/1.44 ============================== PROOF =================================
% 1.18/1.44 % SZS status Unsatisfiable
% 1.18/1.44 % SZS output start Refutation
% 1.18/1.44
% 1.18/1.44 % Proof 1 at 0.41 (+ 0.01) seconds: prove_strong_fixed_point.
% 1.18/1.44 % Length of proof is 11.
% 1.18/1.44 % Level of proof is 4.
% 1.18/1.44 % Maximum clause weight is 25.000.
% 1.18/1.44 % Given clauses 106.
% 1.18/1.44
% 1.18/1.44 1 apply(apply(w,A),B) = apply(apply(A,B),B) # label(w_definition) # label(axiom). [assumption].
% 1.18/1.44 2 apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)) # label(b_definition) # label(axiom). [assumption].
% 1.18/1.44 3 -fixed_point(apply(apply(b,apply(apply(b,apply(apply(b,apply(w,w)),w)),b)),b)) # label(prove_strong_fixed_point) # label(negated_conjecture) # answer(prove_strong_fixed_point). [assumption].
% 1.18/1.44 4 apply(A,fixed_pt) != apply(fixed_pt,apply(A,fixed_pt)) | fixed_point(A) # label(strong_fixed_point) # label(axiom). [assumption].
% 1.18/1.44 5 apply(fixed_pt,apply(A,fixed_pt)) != apply(A,fixed_pt) | fixed_point(A). [copy(4),flip(a)].
% 1.18/1.44 7 apply(apply(w,w),A) = apply(apply(A,A),A). [para(1(a,1),1(a,2))].
% 1.18/1.44 10 apply(apply(w,apply(b,A)),B) = apply(A,apply(B,B)). [para(2(a,1),1(a,2))].
% 1.18/1.44 13 apply(fixed_pt,apply(apply(w,w),apply(w,apply(b,apply(b,fixed_pt))))) != apply(apply(w,w),apply(w,apply(b,apply(b,fixed_pt)))) # answer(prove_strong_fixed_point). [ur(5,b,3,a),rewrite([2(18),2(16),2(14),2(30),2(28),2(26)])].
% 1.18/1.44 43 apply(apply(apply(w,apply(b,apply(b,A))),B),C) = apply(A,apply(apply(B,B),C)). [para(10(a,2),2(a,1,1))].
% 1.18/1.44 2273 apply(A,apply(apply(w,w),apply(w,apply(b,apply(b,A))))) = apply(apply(w,w),apply(w,apply(b,apply(b,A)))). [para(43(a,1),7(a,2)),rewrite([7(30,R)]),flip(a)].
% 1.18/1.44 2274 $F # answer(prove_strong_fixed_point). [resolve(2273,a,13,a)].
% 1.18/1.44
% 1.18/1.44 % SZS output end Refutation
% 1.18/1.44 ============================== end of proof ==========================
% 1.18/1.44
% 1.18/1.44 ============================== STATISTICS ============================
% 1.18/1.44
% 1.18/1.44 Given=106. Generated=9292. Kept=2272. proofs=1.
% 1.18/1.44 Usable=101. Sos=1916. Demods=452. Limbo=20, Disabled=238. Hints=0.
% 1.18/1.44 Megabytes=3.36.
% 1.18/1.44 User_CPU=0.41, System_CPU=0.01, Wall_clock=0.
% 1.18/1.44
% 1.18/1.44 ============================== end of statistics =====================
% 1.18/1.44
% 1.18/1.44 ============================== end of search =========================
% 1.18/1.44
% 1.18/1.44 THEOREM PROVED
% 1.18/1.44 % SZS status Unsatisfiable
% 1.18/1.44
% 1.18/1.44 Exiting with 1 proof.
% 1.18/1.44
% 1.18/1.44 Process 9355 exit (max_proofs) Tue May 31 11:36:26 2022
% 1.18/1.44 Prover9 interrupted
%------------------------------------------------------------------------------