TSTP Solution File: COL036-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL036-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:46 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL036-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue May 31 05:16:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.10 ============================== Prover9 ===============================
% 0.71/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.10 Process 20017 was started by sandbox2 on n023.cluster.edu,
% 0.71/1.10 Tue May 31 05:16:12 2022
% 0.71/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19863_n023.cluster.edu".
% 0.71/1.10 ============================== end of head ===========================
% 0.71/1.10
% 0.71/1.10 ============================== INPUT =================================
% 0.71/1.10
% 0.71/1.10 % Reading from file /tmp/Prover9_19863_n023.cluster.edu
% 0.71/1.10
% 0.71/1.10 set(prolog_style_variables).
% 0.71/1.10 set(auto2).
% 0.71/1.10 % set(auto2) -> set(auto).
% 0.71/1.10 % set(auto) -> set(auto_inference).
% 0.71/1.10 % set(auto) -> set(auto_setup).
% 0.71/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.10 % set(auto) -> set(auto_limits).
% 0.71/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.10 % set(auto) -> set(auto_denials).
% 0.71/1.10 % set(auto) -> set(auto_process).
% 0.71/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.10 % set(auto2) -> assign(stats, some).
% 0.71/1.10 % set(auto2) -> clear(echo_input).
% 0.71/1.10 % set(auto2) -> set(quiet).
% 0.71/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.10 % set(auto2) -> clear(print_given).
% 0.71/1.10 assign(lrs_ticks,-1).
% 0.71/1.10 assign(sos_limit,10000).
% 0.71/1.10 assign(order,kbo).
% 0.71/1.10 set(lex_order_vars).
% 0.71/1.10 clear(print_given).
% 0.71/1.10
% 0.71/1.10 % formulas(sos). % not echoed (4 formulas)
% 0.71/1.10
% 0.71/1.10 ============================== end of input ==========================
% 0.71/1.10
% 0.71/1.10 % From the command line: assign(max_seconds, 300).
% 0.71/1.10
% 0.71/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.10
% 0.71/1.10 % Formulas that are not ordinary clauses:
% 0.71/1.10
% 0.71/1.10 ============================== end of process non-clausal formulas ===
% 0.71/1.10
% 0.71/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.10
% 0.71/1.10 ============================== PREDICATE ELIMINATION =================
% 0.71/1.10
% 0.71/1.10 ============================== end predicate elimination =============
% 0.71/1.10
% 0.71/1.10 Auto_denials:
% 0.71/1.10 % copying label prove_fixed_point to answer in negative clause
% 0.71/1.10
% 0.71/1.10 Term ordering decisions:
% 0.71/1.10
% 0.71/1.10 % Assigning unary symbol f kb_weight 0 and highest precedence (6).
% 0.71/1.10 Function symbol KB weights: b=1. s=1. t=1. apply=1. f=0.
% 0.71/1.10
% 0.71/1.10 ============================== end of process initial clauses ========
% 0.71/1.10
% 0.71/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.10
% 0.71/1.10 ============================== end of clauses for search =============
% 0.71/1.10
% 0.71/1.10 ============================== SEARCH ================================
% 0.71/1.10
% 0.71/1.10 % Starting search at 0.01 seconds.
% 0.71/1.10
% 0.71/1.10 ============================== PROOF =================================
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 % Proof 1 at 0.12 (+ 0.01) seconds: prove_fixed_point.
% 0.71/1.10 % Length of proof is 11.
% 0.71/1.10 % Level of proof is 4.
% 0.71/1.10 % Maximum clause weight is 28.000.
% 0.71/1.10 % Given clauses 30.
% 0.71/1.10
% 0.71/1.10 1 apply(apply(t,A),B) = apply(B,A) # label(t_definition) # label(axiom). [assumption].
% 0.71/1.10 2 apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)) # label(b_definition) # label(axiom). [assumption].
% 0.71/1.10 3 apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)) # label(s_definition) # label(axiom). [assumption].
% 0.71/1.10 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.71/1.10 5 apply(f(A),apply(A,f(A))) != apply(A,f(A)) # answer(prove_fixed_point). [copy(4),flip(a)].
% 0.71/1.10 6 apply(apply(apply(s,t),A),B) = apply(apply(A,B),B). [para(3(a,2),1(a,1))].
% 0.71/1.10 10 apply(apply(A,apply(B,C)),apply(D,apply(B,C))) = apply(apply(apply(s,A),D),apply(B,C)). [para(3(a,1),2(a,2)),rewrite([2(7)]),flip(a)].
% 0.71/1.10 21 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(2(a,1),5(a,1,2)),rewrite([2(19)])].
% 0.71/1.10 28 apply(apply(apply(s,t),apply(b,A)),B) = apply(A,apply(B,B)). [para(6(a,2),2(a,1))].
% 0.71/1.10 596 apply(apply(apply(s,apply(s,t)),A),apply(b,B)) = apply(B,apply(apply(apply(s,A),A),apply(b,B))). [para(28(a,1),3(a,2)),rewrite([10(16)])].
% 0.71/1.10 597 $F # answer(prove_fixed_point). [resolve(596,a,21,a(flip))].
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 ============================== end of proof ==========================
% 0.71/1.10
% 0.71/1.10 ============================== STATISTICS ============================
% 0.71/1.10
% 0.71/1.10 Given=30. Generated=1055. Kept=595. proofs=1.
% 0.71/1.10 Usable=29. Sos=486. Demods=121. Limbo=10, Disabled=73. Hints=0.
% 0.71/1.10 Megabytes=1.22.
% 0.71/1.10 User_CPU=0.12, System_CPU=0.01, Wall_clock=0.
% 0.71/1.10
% 0.71/1.10 ============================== end of statistics =====================
% 0.71/1.10
% 0.71/1.10 ============================== end of search =========================
% 0.71/1.10
% 0.71/1.10 THEOREM PROVED
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10
% 0.71/1.10 Exiting with 1 proof.
% 0.71/1.10
% 0.71/1.10 Process 20017 exit (max_proofs) Tue May 31 05:16:12 2022
% 0.71/1.10 Prover9 interrupted
%------------------------------------------------------------------------------