TSTP Solution File: COL034-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL034-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:46 EDT 2022
% Result : Unsatisfiable 0.86s 1.14s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL034-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n029.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:09:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.86/1.14 ============================== Prover9 ===============================
% 0.86/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.14 Process 14977 was started by sandbox on n029.cluster.edu,
% 0.86/1.14 Tue May 31 09:09:30 2022
% 0.86/1.14 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14824_n029.cluster.edu".
% 0.86/1.14 ============================== end of head ===========================
% 0.86/1.14
% 0.86/1.14 ============================== INPUT =================================
% 0.86/1.14
% 0.86/1.14 % Reading from file /tmp/Prover9_14824_n029.cluster.edu
% 0.86/1.14
% 0.86/1.14 set(prolog_style_variables).
% 0.86/1.14 set(auto2).
% 0.86/1.14 % set(auto2) -> set(auto).
% 0.86/1.14 % set(auto) -> set(auto_inference).
% 0.86/1.14 % set(auto) -> set(auto_setup).
% 0.86/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.86/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.14 % set(auto) -> set(auto_limits).
% 0.86/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.14 % set(auto) -> set(auto_denials).
% 0.86/1.14 % set(auto) -> set(auto_process).
% 0.86/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.86/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.86/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.86/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.86/1.14 % set(auto2) -> assign(stats, some).
% 0.86/1.14 % set(auto2) -> clear(echo_input).
% 0.86/1.14 % set(auto2) -> set(quiet).
% 0.86/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.14 % set(auto2) -> clear(print_given).
% 0.86/1.14 assign(lrs_ticks,-1).
% 0.86/1.14 assign(sos_limit,10000).
% 0.86/1.14 assign(order,kbo).
% 0.86/1.14 set(lex_order_vars).
% 0.86/1.14 clear(print_given).
% 0.86/1.14
% 0.86/1.14 % formulas(sos). % not echoed (4 formulas)
% 0.86/1.14
% 0.86/1.14 ============================== end of input ==========================
% 0.86/1.14
% 0.86/1.14 % From the command line: assign(max_seconds, 300).
% 0.86/1.14
% 0.86/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.14
% 0.86/1.14 % Formulas that are not ordinary clauses:
% 0.86/1.14
% 0.86/1.14 ============================== end of process non-clausal formulas ===
% 0.86/1.14
% 0.86/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.14
% 0.86/1.14 ============================== PREDICATE ELIMINATION =================
% 0.86/1.14
% 0.86/1.14 ============================== end predicate elimination =============
% 0.86/1.14
% 0.86/1.14 Auto_denials:
% 0.86/1.14 % copying label prove_fixed_point to answer in negative clause
% 0.86/1.14
% 0.86/1.14 Term ordering decisions:
% 0.86/1.14
% 0.86/1.14 % Assigning unary symbol f kb_weight 0 and highest precedence (6).
% 0.86/1.14 Function symbol KB weights: b=1. m=1. t=1. apply=1. f=0.
% 0.86/1.14
% 0.86/1.14 ============================== end of process initial clauses ========
% 0.86/1.14
% 0.86/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.14
% 0.86/1.14 ============================== end of clauses for search =============
% 0.86/1.14
% 0.86/1.14 ============================== SEARCH ================================
% 0.86/1.14
% 0.86/1.14 % Starting search at 0.01 seconds.
% 0.86/1.14
% 0.86/1.14 ============================== PROOF =================================
% 0.86/1.14 % SZS status Unsatisfiable
% 0.86/1.14 % SZS output start Refutation
% 0.86/1.14
% 0.86/1.14 % Proof 1 at 0.18 (+ 0.01) seconds: prove_fixed_point.
% 0.86/1.14 % Length of proof is 10.
% 0.86/1.14 % Level of proof is 5.
% 0.86/1.14 % Maximum clause weight is 50.000.
% 0.86/1.14 % Given clauses 41.
% 0.86/1.14
% 0.86/1.14 1 apply(m,A) = apply(A,A) # label(m_definition) # label(axiom). [assumption].
% 0.86/1.14 2 apply(apply(t,A),B) = apply(B,A) # label(t_definition) # label(axiom). [assumption].
% 0.86/1.14 3 apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)) # label(b_definition) # label(axiom). [assumption].
% 0.86/1.14 4 apply(A,f(A)) != apply(f(A),apply(A,f(A))) # label(prove_fixed_point) # label(negated_conjecture) # answer(prove_fixed_point). [assumption].
% 0.86/1.14 5 apply(f(A),apply(A,f(A))) != apply(A,f(A)) # answer(prove_fixed_point). [copy(4),flip(a)].
% 0.86/1.14 8 apply(A,apply(B,apply(apply(b,A),B))) = apply(m,apply(apply(b,A),B)). [para(3(a,1),1(a,2)),flip(a)].
% 0.86/1.14 12 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_fixed_point). [para(3(a,1),5(a,1,2)),rewrite([3(19)])].
% 0.86/1.14 19 apply(f(apply(apply(b,A),apply(apply(b,B),C))),apply(A,apply(B,apply(C,f(apply(apply(b,A),apply(apply(b,B),C))))))) != apply(A,apply(B,apply(C,f(apply(apply(b,A),apply(apply(b,B),C)))))) # answer(prove_fixed_point). [para(3(a,1),12(a,1,2,2)),rewrite([3(29)])].
% 0.86/1.14 680 apply(f(apply(apply(b,A),apply(apply(b,apply(t,B)),C))),apply(A,apply(apply(C,f(apply(apply(b,A),apply(apply(b,apply(t,B)),C)))),B))) != apply(A,apply(apply(C,f(apply(apply(b,A),apply(apply(b,apply(t,B)),C)))),B)) # answer(prove_fixed_point). [para(2(a,1),19(a,1,2,2)),rewrite([2(35)])].
% 0.86/1.14 681 $F # answer(prove_fixed_point). [resolve(680,a,8,a)].
% 0.86/1.14
% 0.86/1.14 % SZS output end Refutation
% 0.86/1.14 ============================== end of proof ==========================
% 0.86/1.14
% 0.86/1.14 ============================== STATISTICS ============================
% 0.86/1.14
% 0.86/1.14 Given=41. Generated=2962. Kept=679. proofs=1.
% 0.86/1.14 Usable=39. Sos=563. Demods=90. Limbo=2, Disabled=78. Hints=0.
% 0.86/1.14 Megabytes=1.36.
% 0.86/1.14 User_CPU=0.18, System_CPU=0.01, Wall_clock=0.
% 0.86/1.14
% 0.86/1.14 ============================== end of statistics =====================
% 0.86/1.14
% 0.86/1.14 ============================== end of search =========================
% 0.86/1.14
% 0.86/1.14 THEOREM PROVED
% 0.86/1.14 % SZS status Unsatisfiable
% 0.86/1.14
% 0.86/1.14 Exiting with 1 proof.
% 0.86/1.14
% 0.86/1.14 Process 14977 exit (max_proofs) Tue May 31 09:09:30 2022
% 0.86/1.14 Prover9 interrupted
%------------------------------------------------------------------------------