TSTP Solution File: LCL443-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL443-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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 : Sun Jul 17 13:46:49 EDT 2022
% Result : Unsatisfiable 0.84s 1.14s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL443-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n008.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 : Sat Jul 2 22:03:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.84/1.14 ============================== Prover9 ===============================
% 0.84/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.84/1.14 Process 5556 was started by sandbox2 on n008.cluster.edu,
% 0.84/1.14 Sat Jul 2 22:03:54 2022
% 0.84/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5402_n008.cluster.edu".
% 0.84/1.14 ============================== end of head ===========================
% 0.84/1.14
% 0.84/1.14 ============================== INPUT =================================
% 0.84/1.14
% 0.84/1.14 % Reading from file /tmp/Prover9_5402_n008.cluster.edu
% 0.84/1.14
% 0.84/1.14 set(prolog_style_variables).
% 0.84/1.14 set(auto2).
% 0.84/1.14 % set(auto2) -> set(auto).
% 0.84/1.14 % set(auto) -> set(auto_inference).
% 0.84/1.14 % set(auto) -> set(auto_setup).
% 0.84/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.84/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.84/1.14 % set(auto) -> set(auto_limits).
% 0.84/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.84/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.84/1.14 % set(auto) -> set(auto_denials).
% 0.84/1.14 % set(auto) -> set(auto_process).
% 0.84/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.84/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.84/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.84/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.84/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.84/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.84/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.84/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.84/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.84/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.84/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.84/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.84/1.14 % set(auto2) -> assign(stats, some).
% 0.84/1.14 % set(auto2) -> clear(echo_input).
% 0.84/1.14 % set(auto2) -> set(quiet).
% 0.84/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.84/1.14 % set(auto2) -> clear(print_given).
% 0.84/1.14 assign(lrs_ticks,-1).
% 0.84/1.14 assign(sos_limit,10000).
% 0.84/1.14 assign(order,kbo).
% 0.84/1.14 set(lex_order_vars).
% 0.84/1.14 clear(print_given).
% 0.84/1.14
% 0.84/1.14 % formulas(sos). % not echoed (9 formulas)
% 0.84/1.14
% 0.84/1.14 ============================== end of input ==========================
% 0.84/1.14
% 0.84/1.14 % From the command line: assign(max_seconds, 300).
% 0.84/1.14
% 0.84/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.84/1.14
% 0.84/1.14 % Formulas that are not ordinary clauses:
% 0.84/1.14
% 0.84/1.14 ============================== end of process non-clausal formulas ===
% 0.84/1.14
% 0.84/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.84/1.14
% 0.84/1.14 ============================== PREDICATE ELIMINATION =================
% 0.84/1.14
% 0.84/1.14 ============================== end predicate elimination =============
% 0.84/1.14
% 0.84/1.14 Auto_denials:
% 0.84/1.14 % copying label cls_conjecture_2 to answer in negative clause
% 0.84/1.14
% 0.84/1.14 Term ordering decisions:
% 0.84/1.14
% 0.84/1.14 % Assigning unary symbol tc_PropLog_Opl kb_weight 0 and highest precedence (13).
% 0.84/1.14 Function symbol KB weights: true=1. t_a=1. v_H=1. c_PropLog_Opl_Ofalse=1. v_p=1. v_q=1. c_PropLog_Othms=1. c_in=1. c_PropLog_Opl_Oop_A_N_62=1. c_insert=1. ifeq=1. tc_PropLog_Opl=0.
% 0.84/1.14
% 0.84/1.14 ============================== end of process initial clauses ========
% 0.84/1.14
% 0.84/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.84/1.14
% 0.84/1.14 ============================== end of clauses for search =============
% 0.84/1.14
% 0.84/1.14 ============================== SEARCH ================================
% 0.84/1.14
% 0.84/1.14 % Starting search at 0.01 seconds.
% 0.84/1.14
% 0.84/1.14 ============================== PROOF =================================
% 0.84/1.14 % SZS status Unsatisfiable
% 0.84/1.14 % SZS output start Refutation
% 0.84/1.14
% 0.84/1.14 % Proof 1 at 0.16 (+ 0.00) seconds: cls_conjecture_2.
% 0.84/1.14 % Length of proof is 26.
% 0.84/1.14 % Level of proof is 8.
% 0.84/1.14 % Maximum clause weight is 62.000.
% 0.84/1.14 % Given clauses 161.
% 0.84/1.14
% 0.84/1.14 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 0.84/1.14 2 c_in(A,c_insert(A,B,C),C) = true # label(cls_Set_OinsertCI_1) # label(axiom). [assumption].
% 0.84/1.14 3 c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.84/1.14 4 true = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [copy(3),flip(a)].
% 0.84/1.14 5 c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.84/1.14 6 c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [copy(5),rewrite([4(11)])].
% 0.84/1.14 7 ifeq(c_in(A,B,tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true) = true # label(cls_PropLog_Othms_OH_0) # label(axiom). [assumption].
% 0.84/1.14 8 ifeq(c_in(A,B,tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [copy(7),rewrite([4(3),4(13),4(21)])].
% 0.84/1.14 9 ifeq(c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),true) = true # label(cls_PropLog_Oweaken__left__insert_0) # label(axiom). [assumption].
% 0.84/1.14 10 ifeq(c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [copy(9),rewrite([4(4),4(16),4(24)])].
% 0.84/1.14 11 ifeq(c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)),true,c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)),true) = true # label(cls_PropLog_Odeduction_0) # label(axiom). [assumption].
% 0.84/1.14 12 ifeq(c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [copy(11),rewrite([4(6),4(17),4(25)])].
% 0.84/1.14 13 ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(A,B,C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,ifeq(c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,c_in(B,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true),true) = true # label(cls_PropLog_Othms_OMP_0) # label(axiom). [assumption].
% 0.84/1.14 14 ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(A,B,C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),ifeq(c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),c_in(B,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [copy(13),rewrite([4(5),4(15),4(25),4(33),4(41)])].
% 0.84/1.14 15 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != true # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.84/1.14 16 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_2). [copy(15),rewrite([4(14)])].
% 0.84/1.14 17 c_in(A,c_insert(A,B,C),C) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [back_rewrite(2),rewrite([4(3)])].
% 0.84/1.14 21 c_in(v_p,c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(10(a,1),1(a,1)),flip(a)].
% 0.84/1.14 22 c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(6(a,1),10(a,1,1)),rewrite([1(35)])].
% 0.84/1.14 28 c_in(A,c_PropLog_Othms(c_insert(A,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(17(a,1),8(a,1,1)),rewrite([1(27)])].
% 0.84/1.14 37 ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(v_p,A,t_a),c_PropLog_Othms(c_insert(B,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),c_in(A,c_PropLog_Othms(c_insert(B,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(21(a,1),14(a,1,3,1)),rewrite([1(50)])].
% 0.84/1.14 87 ifeq(c_in(v_q,c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(22(a,1),14(a,1,1)),rewrite([1(57)])].
% 0.84/1.14 167 c_in(A,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,A,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(28(a,1),37(a,1,1)),rewrite([1(34)])].
% 0.84/1.14 624 c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(167(a,1),87(a,1,1)),rewrite([1(36)])].
% 0.84/1.14 632 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [para(624(a,1),12(a,1,1)),rewrite([1(35)])].
% 0.84/1.14 633 $F # answer(cls_conjecture_2). [resolve(632,a,16,a)].
% 0.84/1.14
% 0.84/1.14 % SZS output end Refutation
% 0.84/1.14 ============================== end of proof ==========================
% 0.84/1.14
% 0.84/1.14 ============================== STATISTICS ============================
% 0.84/1.14
% 0.84/1.14 Given=161. Generated=3286. Kept=625. proofs=1.
% 0.84/1.14 Usable=161. Sos=452. Demods=615. Limbo=3, Disabled=17. Hints=0.
% 0.84/1.14 Megabytes=1.55.
% 0.84/1.14 User_CPU=0.16, System_CPU=0.00, Wall_clock=0.
% 0.84/1.14
% 0.84/1.14 ============================== end of statistics =====================
% 0.84/1.14
% 0.84/1.14 ============================== end of search =========================
% 0.84/1.14
% 0.84/1.14 THEOREM PROVED
% 0.84/1.14 % SZS status Unsatisfiable
% 0.84/1.14
% 0.84/1.14 Exiting with 1 proof.
% 0.84/1.14
% 0.84/1.14 Process 5556 exit (max_proofs) Sat Jul 2 22:03:54 2022
% 0.84/1.14 Prover9 interrupted
%------------------------------------------------------------------------------