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