TSTP Solution File: COL123-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL123-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:40:11 EDT 2022
% Result : Unsatisfiable 0.73s 1.01s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL123-2 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue May 31 10:00:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 3484 was started by sandbox on n028.cluster.edu,
% 0.45/1.01 Tue May 31 10:00:51 2022
% 0.45/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3331_n028.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_3331_n028.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.01 % set(auto2) -> assign(stats, some).
% 0.73/1.01 % set(auto2) -> clear(echo_input).
% 0.73/1.01 % set(auto2) -> set(quiet).
% 0.73/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.01 % set(auto2) -> clear(print_given).
% 0.73/1.01 assign(lrs_ticks,-1).
% 0.73/1.01 assign(sos_limit,10000).
% 0.73/1.01 assign(order,kbo).
% 0.73/1.01 set(lex_order_vars).
% 0.73/1.01 clear(print_given).
% 0.73/1.01
% 0.73/1.01 % formulas(sos). % not echoed (9 formulas)
% 0.73/1.01
% 0.73/1.01 ============================== end of input ==========================
% 0.73/1.01
% 0.73/1.01 % From the command line: assign(max_seconds, 300).
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.01
% 0.73/1.01 % Formulas that are not ordinary clauses:
% 0.73/1.01
% 0.73/1.01 ============================== end of process non-clausal formulas ===
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.01
% 0.73/1.01 ============================== PREDICATE ELIMINATION =================
% 0.73/1.01
% 0.73/1.01 ============================== end predicate elimination =============
% 0.73/1.01
% 0.73/1.01 Auto_denials:
% 0.73/1.01 % copying label cls_conjecture_5 to answer in negative clause
% 0.73/1.01
% 0.73/1.01 Term ordering decisions:
% 0.73/1.01
% 0.73/1.01 % Assigning unary symbol v_xaa kb_weight 0 and highest precedence (12).
% 0.73/1.01 Function symbol KB weights: t_a=1. v_r=1. v_x=1. v_y=1. v_xb=1. v_z=1. tc_prod=1. c_Transitive__Closure_Ortrancl=1. v_xa=1. c_Pair=1. v_xaa=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of process initial clauses ========
% 0.73/1.01
% 0.73/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.01
% 0.73/1.01 ============================== end of clauses for search =============
% 0.73/1.01
% 0.73/1.01 ============================== SEARCH ================================
% 0.73/1.01
% 0.73/1.01 % Starting search at 0.01 seconds.
% 0.73/1.01
% 0.73/1.01 ============================== PROOF =================================
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01 % SZS output start Refutation
% 0.73/1.01
% 0.73/1.01 % Proof 1 at 0.02 (+ 0.00) seconds: cls_conjecture_5.
% 0.73/1.01 % Length of proof is 16.
% 0.73/1.01 % Level of proof is 4.
% 0.73/1.01 % Maximum clause weight is 36.000.
% 0.73/1.01 % Given clauses 40.
% 0.73/1.01
% 0.73/1.01 1 c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.73/1.01 2 c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.73/1.01 3 -c_in(c_Pair(v_z,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(v_xb,A,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # label(cls_conjecture_5) # label(negated_conjecture) # answer(cls_conjecture_5). [assumption].
% 0.73/1.01 4 -c_in(A,B,tc_prod(C,C)) | c_in(A,c_Transitive__Closure_Ortrancl(B,C),tc_prod(C,C)) # label(cls_Transitive__Closure_Or__into__rtrancl_0) # label(axiom). [assumption].
% 0.73/1.01 5 c_in(c_Pair(v_y,v_xaa(A),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(v_x,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.73/1.01 6 c_in(c_Pair(A,v_xaa(A),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_Pair(v_x,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.73/1.01 7 c_in(c_Pair(A,v_xa(B,A,C),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(B,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_6) # label(negated_conjecture). [assumption].
% 0.73/1.01 8 c_in(c_Pair(A,v_xa(B,C,A),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(B,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_7) # label(negated_conjecture). [assumption].
% 0.73/1.01 9 -c_in(c_Pair(A,B,C,C),c_Transitive__Closure_Ortrancl(D,C),tc_prod(C,C)) | -c_in(c_Pair(E,A,C,C),c_Transitive__Closure_Ortrancl(D,C),tc_prod(C,C)) | c_in(c_Pair(E,B,C,C),c_Transitive__Closure_Ortrancl(D,C),tc_prod(C,C)) # label(cls_Transitive__Closure_Ortrancl__trans_0) # label(axiom). [assumption].
% 0.73/1.01 13 c_in(c_Pair(v_y,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a)). [ur(5,b,2,a)].
% 0.73/1.01 15 c_in(c_Pair(v_xb,v_xaa(v_xb),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [ur(6,b,2,a)].
% 0.73/1.01 16 -c_in(c_Pair(A,B,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(A,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(v_xb,v_xa(A,v_z,B),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # answer(cls_conjecture_5). [resolve(7,a,3,a)].
% 0.73/1.01 36 c_in(c_Pair(v_xaa(v_xb),v_xa(v_y,v_z,v_xaa(v_xb)),t_a,t_a),v_r,tc_prod(t_a,t_a)). [ur(8,b,13,a,c,1,a)].
% 0.73/1.01 44 -c_in(c_Pair(v_xb,v_xa(v_y,v_z,v_xaa(v_xb)),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # answer(cls_conjecture_5). [resolve(16,a,13,a),unit_del(a,1)].
% 0.73/1.01 74 -c_in(c_Pair(v_xaa(v_xb),v_xa(v_y,v_z,v_xaa(v_xb)),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # answer(cls_conjecture_5). [ur(9,b,15,a,c,44,a)].
% 0.73/1.01 112 $F # answer(cls_conjecture_5). [resolve(74,a,4,b),unit_del(a,36)].
% 0.73/1.01
% 0.73/1.01 % SZS output end Refutation
% 0.73/1.01 ============================== end of proof ==========================
% 0.73/1.01
% 0.73/1.01 ============================== STATISTICS ============================
% 0.73/1.01
% 0.73/1.01 Given=40. Generated=175. Kept=111. proofs=1.
% 0.73/1.01 Usable=40. Sos=68. Demods=0. Limbo=1, Disabled=11. Hints=0.
% 0.73/1.01 Megabytes=0.19.
% 0.73/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of statistics =====================
% 0.73/1.01
% 0.73/1.01 ============================== end of search =========================
% 0.73/1.01
% 0.73/1.01 THEOREM PROVED
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01
% 0.73/1.01 Exiting with 1 proof.
% 0.73/1.01
% 0.73/1.01 Process 3484 exit (max_proofs) Tue May 31 10:00:51 2022
% 0.73/1.01 Prover9 interrupted
%------------------------------------------------------------------------------