TSTP Solution File: LCL439-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL439-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:45 EDT 2022
% Result : Unsatisfiable 0.40s 1.01s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL439-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 : n023.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 : Sat Jul 2 20:29:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/1.01 ============================== Prover9 ===============================
% 0.40/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.40/1.01 Process 19020 was started by sandbox on n023.cluster.edu,
% 0.40/1.01 Sat Jul 2 20:29:59 2022
% 0.40/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18867_n023.cluster.edu".
% 0.40/1.01 ============================== end of head ===========================
% 0.40/1.01
% 0.40/1.01 ============================== INPUT =================================
% 0.40/1.01
% 0.40/1.01 % Reading from file /tmp/Prover9_18867_n023.cluster.edu
% 0.40/1.01
% 0.40/1.01 set(prolog_style_variables).
% 0.40/1.01 set(auto2).
% 0.40/1.01 % set(auto2) -> set(auto).
% 0.40/1.01 % set(auto) -> set(auto_inference).
% 0.40/1.01 % set(auto) -> set(auto_setup).
% 0.40/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.40/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/1.01 % set(auto) -> set(auto_limits).
% 0.40/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/1.01 % set(auto) -> set(auto_denials).
% 0.40/1.01 % set(auto) -> set(auto_process).
% 0.40/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.40/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.40/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.40/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.40/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.40/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.40/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.40/1.01 % set(auto2) -> assign(stats, some).
% 0.40/1.01 % set(auto2) -> clear(echo_input).
% 0.40/1.01 % set(auto2) -> set(quiet).
% 0.40/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.40/1.01 % set(auto2) -> clear(print_given).
% 0.40/1.01 assign(lrs_ticks,-1).
% 0.40/1.01 assign(sos_limit,10000).
% 0.40/1.01 assign(order,kbo).
% 0.40/1.01 set(lex_order_vars).
% 0.40/1.01 clear(print_given).
% 0.40/1.01
% 0.40/1.01 % formulas(sos). % not echoed (7 formulas)
% 0.40/1.01
% 0.40/1.01 ============================== end of input ==========================
% 0.40/1.01
% 0.40/1.01 % From the command line: assign(max_seconds, 300).
% 0.40/1.01
% 0.40/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/1.01
% 0.40/1.01 % Formulas that are not ordinary clauses:
% 0.40/1.01
% 0.40/1.01 ============================== end of process non-clausal formulas ===
% 0.40/1.01
% 0.40/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/1.01
% 0.40/1.01 ============================== PREDICATE ELIMINATION =================
% 0.40/1.01
% 0.40/1.01 ============================== end predicate elimination =============
% 0.40/1.01
% 0.40/1.01 Auto_denials:
% 0.40/1.01 % copying label cls_conjecture_1 to answer in negative clause
% 0.40/1.01
% 0.40/1.01 Term ordering decisions:
% 0.40/1.01
% 0.40/1.01 % Assigning unary symbol tc_PropLog_Opl kb_weight 0 and highest precedence (10).
% 0.40/1.01 Function symbol KB weights: t_a=1. c_PropLog_Opl_Ofalse=1. v_H=1. v_p=1. v_q=1. c_PropLog_Othms=1. c_PropLog_Opl_Oop_A_N_62=1. c_insert=1. tc_PropLog_Opl=0.
% 0.40/1.01
% 0.40/1.01 ============================== end of process initial clauses ========
% 0.40/1.01
% 0.40/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.40/1.01
% 0.40/1.01 ============================== end of clauses for search =============
% 0.40/1.01
% 0.40/1.01 ============================== SEARCH ================================
% 0.40/1.01
% 0.40/1.01 % Starting search at 0.01 seconds.
% 0.40/1.01
% 0.40/1.01 ============================== PROOF =================================
% 0.40/1.01 % SZS status Unsatisfiable
% 0.40/1.01 % SZS output start Refutation
% 0.40/1.01
% 0.40/1.01 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_1.
% 0.40/1.01 % Length of proof is 12.
% 0.40/1.01 % Level of proof is 3.
% 0.40/1.01 % Maximum clause weight is 24.000.
% 0.40/1.01 % Given clauses 13.
% 0.40/1.01
% 0.40/1.01 1 c_in(A,c_insert(A,B,C),C) # label(cls_Set_OinsertCI_1) # label(axiom). [assumption].
% 0.40/1.01 2 c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.40/1.01 3 -c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_1) # label(negated_conjecture) # answer(cls_conjecture_1). [assumption].
% 0.40/1.01 4 -c_in(A,B,tc_PropLog_Opl(C)) | c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Othms_OH_0) # label(axiom). [assumption].
% 0.40/1.01 5 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__left__insert_0) # label(axiom). [assumption].
% 0.40/1.01 6 -c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)) | c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)) # label(cls_PropLog_Odeduction_0) # label(axiom). [assumption].
% 0.40/1.01 7 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | -c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Othms__notE_0) # label(axiom). [assumption].
% 0.40/1.01 10 c_in(A,c_PropLog_Othms(c_insert(A,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)). [ur(4,a,1,a)].
% 0.40/1.01 11 c_in(c_PropLog_Opl_Oop_A_N_62(v_p,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)). [ur(5,a,2,a)].
% 0.40/1.01 12 -c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_1). [resolve(6,b,3,a)].
% 0.40/1.01 24 -c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_1). [ur(7,a,10,a,c,12,a)].
% 0.40/1.01 25 $F # answer(cls_conjecture_1). [resolve(24,a,11,a)].
% 0.40/1.01
% 0.40/1.01 % SZS output end Refutation
% 0.40/1.01 ============================== end of proof ==========================
% 0.40/1.01
% 0.40/1.01 ============================== STATISTICS ============================
% 0.40/1.01
% 0.40/1.01 Given=13. Generated=36. Kept=24. proofs=1.
% 0.40/1.01 Usable=13. Sos=7. Demods=0. Limbo=3, Disabled=7. Hints=0.
% 0.40/1.01 Megabytes=0.05.
% 0.40/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.40/1.01
% 0.40/1.01 ============================== end of statistics =====================
% 0.40/1.01
% 0.40/1.01 ============================== end of search =========================
% 0.40/1.01
% 0.40/1.01 THEOREM PROVED
% 0.40/1.01 % SZS status Unsatisfiable
% 0.40/1.01
% 0.40/1.01 Exiting with 1 proof.
% 0.40/1.01
% 0.40/1.01 Process 19020 exit (max_proofs) Sat Jul 2 20:29:59 2022
% 0.40/1.01 Prover9 interrupted
%------------------------------------------------------------------------------