TSTP Solution File: COL052-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL052-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:50 EDT 2022
% Result : Unsatisfiable 0.49s 0.79s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : COL052-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/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 06:07:58 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.49/0.79 ============================== Prover9 ===============================
% 0.49/0.79 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.79 Process 21248 was started by sandbox on n032.cluster.edu,
% 0.49/0.79 Tue May 31 06:07:58 2022
% 0.49/0.79 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21095_n032.cluster.edu".
% 0.49/0.79 ============================== end of head ===========================
% 0.49/0.79
% 0.49/0.79 ============================== INPUT =================================
% 0.49/0.79
% 0.49/0.79 % Reading from file /tmp/Prover9_21095_n032.cluster.edu
% 0.49/0.79
% 0.49/0.79 set(prolog_style_variables).
% 0.49/0.79 set(auto2).
% 0.49/0.79 % set(auto2) -> set(auto).
% 0.49/0.79 % set(auto) -> set(auto_inference).
% 0.49/0.79 % set(auto) -> set(auto_setup).
% 0.49/0.79 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.79 % set(auto) -> set(auto_limits).
% 0.49/0.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.79 % set(auto) -> set(auto_denials).
% 0.49/0.79 % set(auto) -> set(auto_process).
% 0.49/0.79 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.79 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.79 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.79 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.79 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.79 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.79 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.79 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.79 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.79 % set(auto2) -> assign(stats, some).
% 0.49/0.79 % set(auto2) -> clear(echo_input).
% 0.49/0.79 % set(auto2) -> set(quiet).
% 0.49/0.79 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.79 % set(auto2) -> clear(print_given).
% 0.49/0.79 assign(lrs_ticks,-1).
% 0.49/0.79 assign(sos_limit,10000).
% 0.49/0.79 assign(order,kbo).
% 0.49/0.79 set(lex_order_vars).
% 0.49/0.79 clear(print_given).
% 0.49/0.79
% 0.49/0.79 % formulas(sos). % not echoed (4 formulas)
% 0.49/0.79
% 0.49/0.79 ============================== end of input ==========================
% 0.49/0.79
% 0.49/0.79 % From the command line: assign(max_seconds, 300).
% 0.49/0.79
% 0.49/0.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.79
% 0.49/0.79 % Formulas that are not ordinary clauses:
% 0.49/0.79
% 0.49/0.79 ============================== end of process non-clausal formulas ===
% 0.49/0.79
% 0.49/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.79
% 0.49/0.79 ============================== PREDICATE ELIMINATION =================
% 0.49/0.79
% 0.49/0.79 ============================== end predicate elimination =============
% 0.49/0.79
% 0.49/0.79 Auto_denials:
% 0.49/0.79 % copying label prove_a_is_agreeable to answer in negative clause
% 0.49/0.79
% 0.49/0.79 Term ordering decisions:
% 0.49/0.79
% 0.49/0.79 % Assigning unary symbol common_bird kb_weight 0 and highest precedence (8).
% 0.49/0.79 Function symbol KB weights: c=1. a=1. b=1. odd_bird=1. response=1. compose=1. common_bird=0.
% 0.49/0.79
% 0.49/0.79 ============================== end of process initial clauses ========
% 0.49/0.79
% 0.49/0.79 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.79
% 0.49/0.79 ============================== end of clauses for search =============
% 0.49/0.79
% 0.49/0.79 ============================== SEARCH ================================
% 0.49/0.79
% 0.49/0.79 % Starting search at 0.01 seconds.
% 0.49/0.79
% 0.49/0.79 ============================== PROOF =================================
% 0.49/0.79 % SZS status Unsatisfiable
% 0.49/0.79 % SZS output start Refutation
% 0.49/0.79
% 0.49/0.79 % Proof 1 at 0.01 (+ 0.00) seconds: prove_a_is_agreeable.
% 0.49/0.79 % Length of proof is 10.
% 0.49/0.79 % Level of proof is 4.
% 0.49/0.79 % Maximum clause weight is 15.000.
% 0.49/0.79 % Given clauses 5.
% 0.49/0.79
% 0.49/0.79 1 c = compose(a,b) # label(c_composes_a_with_b) # label(hypothesis). [assumption].
% 0.49/0.79 2 compose(a,b) = c. [copy(1),flip(a)].
% 0.49/0.79 3 response(c,common_bird(A)) = response(A,common_bird(A)) # label(agreeable1) # label(hypothesis). [assumption].
% 0.49/0.79 4 response(compose(A,B),C) = response(A,response(B,C)) # label(composer_exists) # label(axiom). [assumption].
% 0.49/0.79 5 response(a,A) != response(odd_bird,A) # label(prove_a_is_agreeable) # label(negated_conjecture) # answer(prove_a_is_agreeable). [assumption].
% 0.49/0.79 6 response(odd_bird,A) != response(a,A) # answer(prove_a_is_agreeable). [copy(5),flip(a)].
% 0.49/0.79 7 response(a,response(b,A)) = response(c,A). [para(2(a,1),4(a,1,1)),flip(a)].
% 0.49/0.79 8 response(A,response(B,common_bird(compose(A,B)))) = response(c,common_bird(compose(A,B))). [para(4(a,1),3(a,2)),flip(a)].
% 0.49/0.79 13 response(odd_bird,response(b,A)) != response(c,A) # answer(prove_a_is_agreeable). [para(7(a,1),6(a,2))].
% 0.49/0.79 14 $F # answer(prove_a_is_agreeable). [resolve(13,a,8,a)].
% 0.49/0.79
% 0.49/0.79 % SZS output end Refutation
% 0.49/0.79 ============================== end of proof ==========================
% 0.49/0.79
% 0.49/0.79 ============================== STATISTICS ============================
% 0.49/0.79
% 0.49/0.79 Given=5. Generated=26. Kept=11. proofs=1.
% 0.49/0.79 Usable=5. Sos=4. Demods=6. Limbo=1, Disabled=4. Hints=0.
% 0.49/0.79 Megabytes=0.03.
% 0.49/0.79 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/0.79
% 0.49/0.79 ============================== end of statistics =====================
% 0.49/0.79
% 0.49/0.79 ============================== end of search =========================
% 0.49/0.79
% 0.49/0.79 THEOREM PROVED
% 0.49/0.79 % SZS status Unsatisfiable
% 0.49/0.79
% 0.49/0.79 Exiting with 1 proof.
% 0.49/0.79
% 0.49/0.79 Process 21248 exit (max_proofs) Tue May 31 06:07:58 2022
% 0.49/0.79 Prover9 interrupted
%------------------------------------------------------------------------------