TSTP Solution File: LCL434-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL434-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:41 EDT 2022
% Result : Unsatisfiable 0.49s 1.06s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL434-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 3 12:51:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.06 ============================== Prover9 ===============================
% 0.49/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.06 Process 24464 was started by sandbox2 on n026.cluster.edu,
% 0.49/1.06 Sun Jul 3 12:51:22 2022
% 0.49/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24309_n026.cluster.edu".
% 0.49/1.06 ============================== end of head ===========================
% 0.49/1.06
% 0.49/1.06 ============================== INPUT =================================
% 0.49/1.06
% 0.49/1.06 % Reading from file /tmp/Prover9_24309_n026.cluster.edu
% 0.49/1.06
% 0.49/1.06 set(prolog_style_variables).
% 0.49/1.06 set(auto2).
% 0.49/1.06 % set(auto2) -> set(auto).
% 0.49/1.06 % set(auto) -> set(auto_inference).
% 0.49/1.06 % set(auto) -> set(auto_setup).
% 0.49/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.06 % set(auto) -> set(auto_limits).
% 0.49/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.06 % set(auto) -> set(auto_denials).
% 0.49/1.06 % set(auto) -> set(auto_process).
% 0.49/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.06 % set(auto2) -> assign(stats, some).
% 0.49/1.06 % set(auto2) -> clear(echo_input).
% 0.49/1.06 % set(auto2) -> set(quiet).
% 0.49/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.06 % set(auto2) -> clear(print_given).
% 0.49/1.06 assign(lrs_ticks,-1).
% 0.49/1.06 assign(sos_limit,10000).
% 0.49/1.06 assign(order,kbo).
% 0.49/1.06 set(lex_order_vars).
% 0.49/1.06 clear(print_given).
% 0.49/1.06
% 0.49/1.06 % formulas(sos). % not echoed (6 formulas)
% 0.49/1.06
% 0.49/1.06 ============================== end of input ==========================
% 0.49/1.06
% 0.49/1.06 % From the command line: assign(max_seconds, 300).
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.06
% 0.49/1.06 % Formulas that are not ordinary clauses:
% 0.49/1.06
% 0.49/1.06 ============================== end of process non-clausal formulas ===
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.06
% 0.49/1.06 ============================== PREDICATE ELIMINATION =================
% 0.49/1.06
% 0.49/1.06 ============================== end predicate elimination =============
% 0.49/1.06
% 0.49/1.06 Auto_denials: (non-Horn, no changes).
% 0.49/1.06
% 0.49/1.06 Term ordering decisions:
% 0.49/1.06
% 0.49/1.06 % Assigning unary symbol tc_PropLog_Opl kb_weight 0 and highest precedence (10).
% 0.49/1.06 Function symbol KB weights: t_a=1. v_H=1. v_p=1. v_pa=1. c_PropLog_Othms=1. c_PropLog_Opl_Oop_A_N_62=1. c_insert=1. tc_PropLog_Opl=0.
% 0.49/1.06
% 0.49/1.06 ============================== end of process initial clauses ========
% 0.49/1.06
% 0.49/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.06
% 0.49/1.06 ============================== end of clauses for search =============
% 0.49/1.06
% 0.49/1.06 ============================== SEARCH ================================
% 0.49/1.06
% 0.49/1.06 % Starting search at 0.01 seconds.
% 0.49/1.06
% 0.49/1.06 ============================== PROOF =================================
% 0.49/1.06 % SZS status Unsatisfiable
% 0.49/1.06 % SZS output start Refutation
% 0.49/1.06
% 0.49/1.06 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.49/1.06 % Length of proof is 11.
% 0.49/1.06 % Level of proof is 4.
% 0.49/1.06 % Maximum clause weight is 17.000.
% 0.49/1.06 % Given clauses 8.
% 0.49/1.06
% 0.49/1.06 1 c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.49/1.06 2 c_in(c_PropLog_Opl_Oop_A_N_62(A,A,B),c_PropLog_Othms(C,B),tc_PropLog_Opl(B)) # label(cls_PropLog_Othms__I_0) # label(axiom). [assumption].
% 0.49/1.06 3 -c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.49/1.06 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.49/1.06 5 -c_in(A,c_insert(B,C,D),D) | c_in(A,C,D) | A = B # label(cls_Set_OinsertE_0) # label(axiom). [assumption].
% 0.49/1.06 6 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(c_PropLog_Opl_Oop_A_N_62(D,A,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__right_0) # label(axiom). [assumption].
% 0.49/1.06 9 c_in(v_pa,v_H,tc_PropLog_Opl(t_a)) | v_pa = v_p. [resolve(5,a,1,a)].
% 0.49/1.06 11 -c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)). [ur(6,b,3,a)].
% 0.49/1.06 14 -c_in(v_pa,v_H,tc_PropLog_Opl(t_a)). [ur(4,b,11,a)].
% 0.49/1.06 15 v_pa = v_p. [back_unit_del(9),unit_del(a,14)].
% 0.49/1.06 22 $F. [back_rewrite(3),rewrite([15(2)]),unit_del(a,2)].
% 0.49/1.06
% 0.49/1.06 % SZS output end Refutation
% 0.49/1.06 ============================== end of proof ==========================
% 0.49/1.06
% 0.49/1.06 ============================== STATISTICS ============================
% 0.49/1.06
% 0.49/1.06 Given=8. Generated=23. Kept=21. proofs=1.
% 0.49/1.06 Usable=5. Sos=1. Demods=1. Limbo=7, Disabled=14. Hints=0.
% 0.49/1.06 Megabytes=0.04.
% 0.49/1.06 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/1.06
% 0.49/1.06 ============================== end of statistics =====================
% 0.49/1.06
% 0.49/1.06 ============================== end of search =========================
% 0.49/1.06
% 0.49/1.06 THEOREM PROVED
% 0.49/1.06 % SZS status Unsatisfiable
% 0.49/1.06
% 0.49/1.06 Exiting with 1 proof.
% 0.49/1.06
% 0.49/1.06 Process 24464 exit (max_proofs) Sun Jul 3 12:51:22 2022
% 0.49/1.06 Prover9 interrupted
%------------------------------------------------------------------------------