TSTP Solution File: LCL397-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:22 EDT 2022
% Result : Unsatisfiable 0.68s 0.96s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% 0.02/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n014.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 01:49:09 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.68/0.96 ============================== Prover9 ===============================
% 0.68/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.96 Process 10965 was started by sandbox on n014.cluster.edu,
% 0.68/0.96 Mon Jul 4 01:49:09 2022
% 0.68/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10811_n014.cluster.edu".
% 0.68/0.96 ============================== end of head ===========================
% 0.68/0.96
% 0.68/0.96 ============================== INPUT =================================
% 0.68/0.96
% 0.68/0.96 % Reading from file /tmp/Prover9_10811_n014.cluster.edu
% 0.68/0.96
% 0.68/0.96 set(prolog_style_variables).
% 0.68/0.96 set(auto2).
% 0.68/0.96 % set(auto2) -> set(auto).
% 0.68/0.96 % set(auto) -> set(auto_inference).
% 0.68/0.96 % set(auto) -> set(auto_setup).
% 0.68/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.96 % set(auto) -> set(auto_limits).
% 0.68/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.96 % set(auto) -> set(auto_denials).
% 0.68/0.96 % set(auto) -> set(auto_process).
% 0.68/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.96 % set(auto2) -> assign(stats, some).
% 0.68/0.96 % set(auto2) -> clear(echo_input).
% 0.68/0.96 % set(auto2) -> set(quiet).
% 0.68/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.96 % set(auto2) -> clear(print_given).
% 0.68/0.96 assign(lrs_ticks,-1).
% 0.68/0.96 assign(sos_limit,10000).
% 0.68/0.96 assign(order,kbo).
% 0.68/0.96 set(lex_order_vars).
% 0.68/0.96 clear(print_given).
% 0.68/0.96
% 0.68/0.96 % formulas(sos). % not echoed (5 formulas)
% 0.68/0.96
% 0.68/0.96 ============================== end of input ==========================
% 0.68/0.96
% 0.68/0.96 % From the command line: assign(max_seconds, 300).
% 0.68/0.96
% 0.68/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.96
% 0.68/0.96 % Formulas that are not ordinary clauses:
% 0.68/0.96
% 0.68/0.96 ============================== end of process non-clausal formulas ===
% 0.68/0.96
% 0.68/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.96
% 0.68/0.96 ============================== PREDICATE ELIMINATION =================
% 0.68/0.96
% 0.68/0.96 ============================== end predicate elimination =============
% 0.68/0.96
% 0.68/0.96 Auto_denials:
% 0.68/0.96 % copying label prove_cn_63 to answer in negative clause
% 0.68/0.96
% 0.68/0.96 Term ordering decisions:
% 0.68/0.96
% 0.68/0.96 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.68/0.96 Function symbol KB weights: x=1. y=1. implies=1. not=0.
% 0.68/0.96
% 0.68/0.96 ============================== end of process initial clauses ========
% 0.68/0.96
% 0.68/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.96
% 0.68/0.96 ============================== end of clauses for search =============
% 0.68/0.96
% 0.68/0.96 ============================== SEARCH ================================
% 0.68/0.96
% 0.68/0.96 % Starting search at 0.01 seconds.
% 0.68/0.96
% 0.68/0.96 ============================== PROOF =================================
% 0.68/0.96 % SZS status Unsatisfiable
% 0.68/0.96 % SZS output start Refutation
% 0.68/0.96
% 0.68/0.96 % Proof 1 at 0.04 (+ 0.00) seconds: prove_cn_63.
% 0.68/0.96 % Length of proof is 14.
% 0.68/0.96 % Level of proof is 7.
% 0.68/0.96 % Maximum clause weight is 16.000.
% 0.68/0.96 % Given clauses 44.
% 0.68/0.96
% 0.68/0.96 1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom). [assumption].
% 0.68/0.96 2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom). [assumption].
% 0.68/0.96 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom). [assumption].
% 0.68/0.96 4 -is_a_theorem(implies(x,implies(y,y))) # label(prove_cn_63) # label(negated_conjecture) # answer(prove_cn_63). [assumption].
% 0.68/0.96 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.68/0.96 6 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))). [hyper(5,a,3,a,b,3,a)].
% 0.68/0.96 7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))). [hyper(5,a,3,a,b,2,a)].
% 0.68/0.96 21 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,6,a,b,7,a)].
% 0.68/0.96 26 is_a_theorem(implies(A,A)). [hyper(5,a,7,a,b,1,a)].
% 0.68/0.96 27 is_a_theorem(implies(not(implies(A,A)),B)). [hyper(5,a,2,a,b,26,a)].
% 0.68/0.96 72 is_a_theorem(implies(A,implies(not(implies(B,B)),C))). [hyper(5,a,21,a,b,27,a)].
% 0.68/0.96 95 is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))). [hyper(5,a,3,a,b,72,a)].
% 0.68/0.96 460 is_a_theorem(implies(A,implies(B,B))). [hyper(5,a,95,a,b,1,a)].
% 0.68/0.96 461 $F # answer(prove_cn_63). [resolve(460,a,4,a)].
% 0.68/0.96
% 0.68/0.96 % SZS output end Refutation
% 0.68/0.96 ============================== end of proof ==========================
% 0.68/0.96
% 0.68/0.96 ============================== STATISTICS ============================
% 0.68/0.96
% 0.68/0.96 Given=44. Generated=949. Kept=460. proofs=1.
% 0.68/0.96 Usable=44. Sos=382. Demods=0. Limbo=16, Disabled=22. Hints=0.
% 0.68/0.96 Megabytes=0.65.
% 0.68/0.96 User_CPU=0.04, System_CPU=0.00, Wall_clock=1.
% 0.68/0.96
% 0.68/0.96 ============================== end of statistics =====================
% 0.68/0.96
% 0.68/0.96 ============================== end of search =========================
% 0.68/0.96
% 0.68/0.96 THEOREM PROVED
% 0.68/0.96 % SZS status Unsatisfiable
% 0.68/0.96
% 0.68/0.96 Exiting with 1 proof.
% 0.68/0.96
% 0.68/0.96 Process 10965 exit (max_proofs) Mon Jul 4 01:49:10 2022
% 0.68/0.96 Prover9 interrupted
%------------------------------------------------------------------------------