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