TSTP Solution File: LCL076-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL076-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:43:48 EDT 2022
% Result : Unsatisfiable 0.75s 1.17s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL076-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 14:48:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.17 ============================== Prover9 ===============================
% 0.75/1.17 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.17 Process 11164 was started by sandbox on n007.cluster.edu,
% 0.75/1.17 Sun Jul 3 14:48:56 2022
% 0.75/1.17 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11009_n007.cluster.edu".
% 0.75/1.17 ============================== end of head ===========================
% 0.75/1.17
% 0.75/1.17 ============================== INPUT =================================
% 0.75/1.17
% 0.75/1.17 % Reading from file /tmp/Prover9_11009_n007.cluster.edu
% 0.75/1.17
% 0.75/1.17 set(prolog_style_variables).
% 0.75/1.17 set(auto2).
% 0.75/1.17 % set(auto2) -> set(auto).
% 0.75/1.17 % set(auto) -> set(auto_inference).
% 0.75/1.17 % set(auto) -> set(auto_setup).
% 0.75/1.17 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.17 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.17 % set(auto) -> set(auto_limits).
% 0.75/1.17 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.17 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.17 % set(auto) -> set(auto_denials).
% 0.75/1.17 % set(auto) -> set(auto_process).
% 0.75/1.17 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.17 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.17 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.17 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.17 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.17 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.17 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.17 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.17 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.17 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.17 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.17 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.17 % set(auto2) -> assign(stats, some).
% 0.75/1.17 % set(auto2) -> clear(echo_input).
% 0.75/1.17 % set(auto2) -> set(quiet).
% 0.75/1.17 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.17 % set(auto2) -> clear(print_given).
% 0.75/1.17 assign(lrs_ticks,-1).
% 0.75/1.17 assign(sos_limit,10000).
% 0.75/1.17 assign(order,kbo).
% 0.75/1.17 set(lex_order_vars).
% 0.75/1.17 clear(print_given).
% 0.75/1.17
% 0.75/1.17 % formulas(sos). % not echoed (5 formulas)
% 0.75/1.17
% 0.75/1.17 ============================== end of input ==========================
% 0.75/1.17
% 0.75/1.17 % From the command line: assign(max_seconds, 300).
% 0.75/1.17
% 0.75/1.17 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.17
% 0.75/1.17 % Formulas that are not ordinary clauses:
% 0.75/1.17
% 0.75/1.17 ============================== end of process non-clausal formulas ===
% 0.75/1.17
% 0.75/1.17 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.17
% 0.75/1.17 ============================== PREDICATE ELIMINATION =================
% 0.75/1.17
% 0.75/1.17 ============================== end predicate elimination =============
% 0.75/1.17
% 0.75/1.17 Auto_denials:
% 0.75/1.17 % copying label prove_cn_40 to answer in negative clause
% 0.75/1.17
% 0.75/1.17 Term ordering decisions:
% 0.75/1.17
% 0.75/1.17 % Assigning unary symbol not kb_weight 0 and highest precedence (4).
% 0.75/1.17 Function symbol KB weights: a=1. implies=1. not=0.
% 0.75/1.17
% 0.75/1.17 ============================== end of process initial clauses ========
% 0.75/1.17
% 0.75/1.17 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.17
% 0.75/1.17 ============================== end of clauses for search =============
% 0.75/1.17
% 0.75/1.17 ============================== SEARCH ================================
% 0.75/1.17
% 0.75/1.17 % Starting search at 0.01 seconds.
% 0.75/1.17
% 0.75/1.17 ============================== PROOF =================================
% 0.75/1.17 % SZS status Unsatisfiable
% 0.75/1.17 % SZS output start Refutation
% 0.75/1.17
% 0.75/1.17 % Proof 1 at 0.15 (+ 0.02) seconds: prove_cn_40.
% 0.75/1.17 % Length of proof is 22.
% 0.75/1.17 % Level of proof is 8.
% 0.75/1.17 % Maximum clause weight is 20.000.
% 0.75/1.17 % Given clauses 130.
% 0.75/1.17
% 0.75/1.17 1 is_a_theorem(implies(A,implies(B,A))) # label(cn_18) # label(axiom). [assumption].
% 0.75/1.17 2 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) # label(cn_49) # label(axiom). [assumption].
% 0.75/1.17 3 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) # label(cn_35) # label(axiom). [assumption].
% 0.75/1.17 4 -is_a_theorem(implies(a,not(not(a)))) # label(prove_cn_40) # label(negated_conjecture) # answer(prove_cn_40). [assumption].
% 0.75/1.17 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.75/1.17 6 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))). [hyper(5,a,3,a,b,3,a)].
% 0.75/1.17 7 is_a_theorem(implies(implies(implies(not(A),not(B)),B),implies(implies(not(A),not(B)),A))). [hyper(5,a,3,a,b,2,a)].
% 0.75/1.17 8 is_a_theorem(implies(implies(A,B),implies(A,A))). [hyper(5,a,3,a,b,1,a)].
% 0.75/1.17 10 is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))). [hyper(5,a,1,a,b,2,a)].
% 0.75/1.17 11 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(5,a,1,a,b,1,a)].
% 0.75/1.17 17 is_a_theorem(implies(A,A)). [hyper(5,a,8,a,b,1,a)].
% 0.75/1.17 18 is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))). [hyper(5,a,3,a,b,17,a)].
% 0.75/1.17 21 is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))). [hyper(5,a,6,a,b,11,a)].
% 0.75/1.17 26 is_a_theorem(implies(A,implies(implies(implies(not(B),not(C)),C),implies(implies(not(B),not(C)),B)))). [hyper(5,a,1,a,b,7,a)].
% 0.75/1.17 141 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,21,a,b,10,a)].
% 0.75/1.17 154 is_a_theorem(implies(A,implies(not(B),implies(B,C)))). [hyper(5,a,1,a,b,141,a)].
% 0.75/1.17 160 is_a_theorem(implies(implies(implies(not(A),implies(A,B)),C),C)). [hyper(5,a,18,a,b,154,a)].
% 0.75/1.17 237 is_a_theorem(implies(A,implies(implies(not(B),not(A)),B))). [hyper(5,a,21,a,b,26,a)].
% 0.75/1.17 247 is_a_theorem(implies(implies(A,implies(not(B),not(A))),implies(A,B))). [hyper(5,a,3,a,b,237,a)].
% 0.75/1.17 2055 is_a_theorem(implies(not(not(A)),A)). [hyper(5,a,160,a,b,247,a)].
% 0.75/1.17 2097 is_a_theorem(implies(A,not(not(A)))). [hyper(5,a,2,a,b,2055,a)].
% 0.75/1.17 2098 $F # answer(prove_cn_40). [resolve(2097,a,4,a)].
% 0.75/1.17
% 0.75/1.17 % SZS output end Refutation
% 0.75/1.17 ============================== end of proof ==========================
% 0.75/1.17
% 0.75/1.17 ============================== STATISTICS ============================
% 0.75/1.17
% 0.75/1.17 Given=130. Generated=10813. Kept=2097. proofs=1.
% 0.75/1.17 Usable=129. Sos=1925. Demods=0. Limbo=27, Disabled=20. Hints=0.
% 0.75/1.17 Megabytes=1.99.
% 0.75/1.17 User_CPU=0.15, System_CPU=0.02, Wall_clock=1.
% 0.75/1.17
% 0.75/1.17 ============================== end of statistics =====================
% 0.75/1.17
% 0.75/1.17 ============================== end of search =========================
% 0.75/1.17
% 0.75/1.17 THEOREM PROVED
% 0.75/1.17 % SZS status Unsatisfiable
% 0.75/1.17
% 0.75/1.17 Exiting with 1 proof.
% 0.75/1.17
% 0.75/1.17 Process 11164 exit (max_proofs) Sun Jul 3 14:48:57 2022
% 0.75/1.17 Prover9 interrupted
%------------------------------------------------------------------------------