TSTP Solution File: COL121-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL121-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:10 EDT 2022
% Result : Unsatisfiable 0.65s 0.96s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : COL121-2 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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 16:00:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.65/0.94 ============================== Prover9 ===============================
% 0.65/0.94 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.94 Process 2564 was started by sandbox on n027.cluster.edu,
% 0.65/0.94 Tue May 31 16:00:18 2022
% 0.65/0.94 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2411_n027.cluster.edu".
% 0.65/0.94 ============================== end of head ===========================
% 0.65/0.94
% 0.65/0.94 ============================== INPUT =================================
% 0.65/0.94
% 0.65/0.94 % Reading from file /tmp/Prover9_2411_n027.cluster.edu
% 0.65/0.94
% 0.65/0.94 set(prolog_style_variables).
% 0.65/0.94 set(auto2).
% 0.65/0.94 % set(auto2) -> set(auto).
% 0.65/0.94 % set(auto) -> set(auto_inference).
% 0.65/0.94 % set(auto) -> set(auto_setup).
% 0.65/0.94 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.94 % set(auto) -> set(auto_limits).
% 0.65/0.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.94 % set(auto) -> set(auto_denials).
% 0.65/0.94 % set(auto) -> set(auto_process).
% 0.65/0.94 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.94 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.94 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.94 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.94 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.94 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.94 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.94 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.94 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.94 % set(auto2) -> assign(stats, some).
% 0.65/0.94 % set(auto2) -> clear(echo_input).
% 0.65/0.94 % set(auto2) -> set(quiet).
% 0.65/0.94 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.94 % set(auto2) -> clear(print_given).
% 0.65/0.94 assign(lrs_ticks,-1).
% 0.65/0.94 assign(sos_limit,10000).
% 0.65/0.94 assign(order,kbo).
% 0.65/0.94 set(lex_order_vars).
% 0.65/0.94 clear(print_given).
% 0.65/0.94
% 0.65/0.94 % formulas(sos). % not echoed (10 formulas)
% 0.65/0.94
% 0.65/0.94 ============================== end of input ==========================
% 0.65/0.94
% 0.65/0.94 % From the command line: assign(max_seconds, 300).
% 0.65/0.94
% 0.65/0.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.94
% 0.65/0.94 % Formulas that are not ordinary clauses:
% 0.65/0.94
% 0.65/0.94 ============================== end of process non-clausal formulas ===
% 0.65/0.94
% 0.65/0.94 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.94
% 0.65/0.94 ============================== PREDICATE ELIMINATION =================
% 0.65/0.94 1 -c_Comb_Odiamond(A,B) | -c_in(c_Pair(C,D,B,B),A,tc_prod(B,B)) | -c_in(c_Pair(C,E,B,B),c_Transitive__Closure_Ortrancl(A,B),tc_prod(B,B)) | c_in(c_Pair(E,c_Comb_Odiamond__strip__lemmaE__1(A,E,D,B),B,B),A,tc_prod(B,B)) # label(cls_Comb_Odiamond__strip__lemmaE_1) # label(axiom). [assumption].
% 0.65/0.94 2 c_Comb_Odiamond(v_r,t_a) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.65/0.94 Derived: -c_in(c_Pair(A,B,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(A,C,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | c_in(c_Pair(C,c_Comb_Odiamond__strip__lemmaE__1(v_r,C,B,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(1,a,2,a)].
% 0.65/0.94 3 -c_Comb_Odiamond(A,B) | -c_in(c_Pair(C,D,B,B),A,tc_prod(B,B)) | -c_in(c_Pair(C,E,B,B),c_Transitive__Closure_Ortrancl(A,B),tc_prod(B,B)) | c_in(c_Pair(D,c_Comb_Odiamond__strip__lemmaE__1(A,E,D,B),B,B),c_Transitive__Closure_Ortrancl(A,B),tc_prod(B,B)) # label(cls_Comb_Odiamond__strip__lemmaE_0) # label(axiom). [assumption].
% 0.65/0.94 Derived: -c_in(c_Pair(A,B,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(A,C,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | c_in(c_Pair(B,c_Comb_Odiamond__strip__lemmaE__1(v_r,C,B,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [resolve(3,a,2,a)].
% 0.65/0.94
% 0.65/0.94 ============================== end predicate elimination =============
% 0.65/0.94
% 0.65/0.94 Auto_denials:
% 0.65/0.94 % copying label cls_conjecture_6 to answer in negative clause
% 0.65/0.94
% 0.65/0.94 Term ordering decisions:
% 0.65/0.94
% 0.65/0.94 % Assigning unary symbol v_x kb_weight 0 and highest precedence (12).
% 0.65/0.94 Function symbol KB weights: t_a=1. v_r=1. v_y=1. v_ya=1. v_xaa=1. v_z=1. tc_prod=1. c_Transitive__Closure_Ortrancl=1. c_Pair=1. c_Comb_Odiamond__strip__lemmaE__1=1. v_x=0.
% 0.65/0.94
% 0.65/0.94 ============================== end of process initial clauses ========
% 0.65/0.96
% 0.65/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.96
% 0.65/0.96 ============================== end of clauses for search =============
% 0.65/0.96
% 0.65/0.96 ============================== SEARCH ================================
% 0.65/0.96
% 0.65/0.96 % Starting search at 0.01 seconds.
% 0.65/0.96
% 0.65/0.96 ============================== PROOF =================================
% 0.65/0.96 % SZS status Unsatisfiable
% 0.65/0.96 % SZS output start Refutation
% 0.65/0.96
% 0.65/0.96 % Proof 1 at 0.03 (+ 0.00) seconds: cls_conjecture_6.
% 0.65/0.96 % Length of proof is 19.
% 0.65/0.96 % Level of proof is 4.
% 0.65/0.96 % Maximum clause weight is 38.000.
% 0.65/0.96 % Given clauses 62.
% 0.65/0.96
% 0.65/0.96 1 -c_Comb_Odiamond(A,B) | -c_in(c_Pair(C,D,B,B),A,tc_prod(B,B)) | -c_in(c_Pair(C,E,B,B),c_Transitive__Closure_Ortrancl(A,B),tc_prod(B,B)) | c_in(c_Pair(E,c_Comb_Odiamond__strip__lemmaE__1(A,E,D,B),B,B),A,tc_prod(B,B)) # label(cls_Comb_Odiamond__strip__lemmaE_1) # label(axiom). [assumption].
% 0.65/0.96 2 c_Comb_Odiamond(v_r,t_a) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.65/0.96 3 -c_Comb_Odiamond(A,B) | -c_in(c_Pair(C,D,B,B),A,tc_prod(B,B)) | -c_in(c_Pair(C,E,B,B),c_Transitive__Closure_Ortrancl(A,B),tc_prod(B,B)) | c_in(c_Pair(D,c_Comb_Odiamond__strip__lemmaE__1(A,E,D,B),B,B),c_Transitive__Closure_Ortrancl(A,B),tc_prod(B,B)) # label(cls_Comb_Odiamond__strip__lemmaE_0) # label(axiom). [assumption].
% 0.65/0.96 4 c_in(c_Pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.65/0.96 5 c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.65/0.96 6 -c_in(c_Pair(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_z,A,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # label(cls_conjecture_6) # label(negated_conjecture) # answer(cls_conjecture_6). [assumption].
% 0.65/0.96 7 -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.65/0.96 8 c_in(c_Pair(v_ya,v_x(A),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_Pair(v_y,A,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.65/0.96 9 c_in(c_Pair(A,v_x(A),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_Pair(v_y,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). [assumption].
% 0.65/0.96 10 -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.65/0.96 11 -c_in(c_Pair(A,B,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(A,C,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | c_in(c_Pair(C,c_Comb_Odiamond__strip__lemmaE__1(v_r,C,B,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(1,a,2,a)].
% 0.65/0.96 12 -c_in(c_Pair(A,B,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(A,C,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | c_in(c_Pair(B,c_Comb_Odiamond__strip__lemmaE__1(v_r,C,B,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [resolve(3,a,2,a)].
% 0.65/0.96 17 c_in(c_Pair(v_ya,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [ur(8,b,5,a)].
% 0.65/0.96 20 c_in(c_Pair(v_xaa,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [ur(9,b,5,a)].
% 0.65/0.96 22 -c_in(c_Pair(A,B,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_Pair(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_z,B,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) # answer(cls_conjecture_6). [resolve(10,c,6,a)].
% 0.65/0.96 40 c_in(c_Pair(v_z,c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [ur(12,a,4,a,b,17,a)].
% 0.65/0.96 41 c_in(c_Pair(v_x(v_xaa),c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [ur(11,a,4,a,b,17,a)].
% 0.65/0.96 111 c_in(c_Pair(v_x(v_xaa),c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)). [ur(7,a,41,a)].
% 0.65/0.96 167 $F # answer(cls_conjecture_6). [ur(22,b,20,a,c,40,a),unit_del(a,111)].
% 0.65/0.96
% 0.65/0.96 % SZS output end Refutation
% 0.65/0.96 ============================== end of proof ==========================
% 0.65/0.96
% 0.65/0.96 ============================== STATISTICS ============================
% 0.65/0.96
% 0.65/0.96 Given=62. Generated=271. Kept=163. proofs=1.
% 0.65/0.96 Usable=62. Sos=85. Demods=0. Limbo=9, Disabled=19. Hints=0.
% 0.65/0.96 Megabytes=0.25.
% 0.65/0.96 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.65/0.96
% 0.65/0.96 ============================== end of statistics =====================
% 0.65/0.96
% 0.65/0.96 ============================== end of search =========================
% 0.65/0.96
% 0.65/0.96 THEOREM PROVED
% 0.65/0.96 % SZS status Unsatisfiable
% 0.65/0.96
% 0.65/0.96 Exiting with 1 proof.
% 0.65/0.96
% 0.65/0.96 Process 2564 exit (max_proofs) Tue May 31 16:00:18 2022
% 0.65/0.96 Prover9 interrupted
%------------------------------------------------------------------------------