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