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