TSTP Solution File: COM010-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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 01:38:21 EDT 2022
% Result : Unsatisfiable 0.41s 0.96s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n016.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 : Thu Jun 16 17:10:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.96 ============================== Prover9 ===============================
% 0.41/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96 Process 3391 was started by sandbox2 on n016.cluster.edu,
% 0.41/0.96 Thu Jun 16 17:10:20 2022
% 0.41/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3237_n016.cluster.edu".
% 0.41/0.96 ============================== end of head ===========================
% 0.41/0.96
% 0.41/0.96 ============================== INPUT =================================
% 0.41/0.96
% 0.41/0.96 % Reading from file /tmp/Prover9_3237_n016.cluster.edu
% 0.41/0.96
% 0.41/0.96 set(prolog_style_variables).
% 0.41/0.96 set(auto2).
% 0.41/0.96 % set(auto2) -> set(auto).
% 0.41/0.96 % set(auto) -> set(auto_inference).
% 0.41/0.96 % set(auto) -> set(auto_setup).
% 0.41/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96 % set(auto) -> set(auto_limits).
% 0.41/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96 % set(auto) -> set(auto_denials).
% 0.41/0.96 % set(auto) -> set(auto_process).
% 0.41/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96 % set(auto2) -> assign(stats, some).
% 0.41/0.96 % set(auto2) -> clear(echo_input).
% 0.41/0.96 % set(auto2) -> set(quiet).
% 0.41/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96 % set(auto2) -> clear(print_given).
% 0.41/0.96 assign(lrs_ticks,-1).
% 0.41/0.96 assign(sos_limit,10000).
% 0.41/0.96 assign(order,kbo).
% 0.41/0.96 set(lex_order_vars).
% 0.41/0.96 clear(print_given).
% 0.41/0.96
% 0.41/0.96 % formulas(sos). % not echoed (5 formulas)
% 0.41/0.96
% 0.41/0.96 ============================== end of input ==========================
% 0.41/0.96
% 0.41/0.96 % From the command line: assign(max_seconds, 300).
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96
% 0.41/0.96 % Formulas that are not ordinary clauses:
% 0.41/0.96
% 0.41/0.96 ============================== end of process non-clausal formulas ===
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.96
% 0.41/0.96 ============================== PREDICATE ELIMINATION =================
% 0.41/0.96
% 0.41/0.96 ============================== end predicate elimination =============
% 0.41/0.96
% 0.41/0.96 Auto_denials:
% 0.41/0.96 % copying label cls_conjecture_3 to answer in negative clause
% 0.41/0.96
% 0.41/0.96 Term ordering decisions:
% 0.41/0.96
% 0.41/0.96 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (11).
% 0.41/0.96 Function symbol KB weights: t_a=1. v_F=1. v_G=1. tc_prod=1. c_UNITY_OActs=1. c_UNITY_OAllowedActs=1. c_UNITY_OInit=1. c_UNITY_Omk__program=1. c_Pair=1. tc_set=0.
% 0.41/0.96
% 0.41/0.96 ============================== end of process initial clauses ========
% 0.41/0.96
% 0.41/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.96
% 0.41/0.96 ============================== end of clauses for search =============
% 0.41/0.96
% 0.41/0.96 ============================== SEARCH ================================
% 0.41/0.96
% 0.41/0.96 % Starting search at 0.01 seconds.
% 0.41/0.96
% 0.41/0.96 ============================== PROOF =================================
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96 % SZS output start Refutation
% 0.41/0.96
% 0.41/0.96 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_3.
% 0.41/0.96 % Length of proof is 11.
% 0.41/0.96 % Level of proof is 3.
% 0.41/0.96 % Maximum clause weight is 38.000.
% 0.41/0.96 % Given clauses 4.
% 0.41/0.96
% 0.41/0.96 1 c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.41/0.96 2 c_UNITY_OInit(v_G,t_a) = c_UNITY_OInit(v_F,t_a). [copy(1),flip(a)].
% 0.41/0.96 3 c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.41/0.96 4 c_UNITY_OActs(v_G,t_a) = c_UNITY_OActs(v_F,t_a). [copy(3),flip(a)].
% 0.41/0.96 5 c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.41/0.96 6 c_UNITY_OAllowedActs(v_G,t_a) = c_UNITY_OAllowedActs(v_F,t_a). [copy(5),flip(a)].
% 0.41/0.96 7 c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(A,B),c_Pair(c_UNITY_OActs(A,B),c_UNITY_OAllowedActs(A,B),tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B)))),tc_set(B),tc_prod(tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B))))),B) = A # label(cls_UNITY_Osurjective__mk__program_0) # label(axiom). [assumption].
% 0.41/0.96 8 v_F != v_G # label(cls_conjecture_3) # label(negated_conjecture) # answer(cls_conjecture_3). [assumption].
% 0.41/0.96 9 v_G != v_F # answer(cls_conjecture_3). [copy(8),flip(a)].
% 0.41/0.96 10 v_G = v_F. [para(2(a,1),7(a,1,1,1)),rewrite([4(6),6(9),7(36)]),flip(a)].
% 0.41/0.96 11 $F # answer(cls_conjecture_3). [resolve(10,a,9,a)].
% 0.41/0.96
% 0.41/0.96 % SZS output end Refutation
% 0.41/0.96 ============================== end of proof ==========================
% 0.41/0.96
% 0.41/0.96 ============================== STATISTICS ============================
% 0.41/0.96
% 0.41/0.96 Given=4. Generated=9. Kept=6. proofs=1.
% 0.41/0.96 Usable=4. Sos=1. Demods=4. Limbo=0, Disabled=5. Hints=0.
% 0.41/0.96 Megabytes=0.04.
% 0.41/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.96
% 0.41/0.96 ============================== end of statistics =====================
% 0.41/0.96
% 0.41/0.96 ============================== end of search =========================
% 0.41/0.96
% 0.41/0.96 THEOREM PROVED
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96
% 0.41/0.96 Exiting with 1 proof.
% 0.41/0.96
% 0.41/0.96 Process 3391 exit (max_proofs) Thu Jun 16 17:10:20 2022
% 0.41/0.96 Prover9 interrupted
%------------------------------------------------------------------------------