TSTP Solution File: LCL065-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL065-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:44 EDT 2022
% Result : Unsatisfiable 0.64s 1.05s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL065-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n003.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 : Mon Jul 4 00:15:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.64/1.05 ============================== Prover9 ===============================
% 0.64/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.64/1.05 Process 15587 was started by sandbox on n003.cluster.edu,
% 0.64/1.05 Mon Jul 4 00:15:10 2022
% 0.64/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15434_n003.cluster.edu".
% 0.64/1.05 ============================== end of head ===========================
% 0.64/1.05
% 0.64/1.05 ============================== INPUT =================================
% 0.64/1.05
% 0.64/1.05 % Reading from file /tmp/Prover9_15434_n003.cluster.edu
% 0.64/1.05
% 0.64/1.05 set(prolog_style_variables).
% 0.64/1.05 set(auto2).
% 0.64/1.05 % set(auto2) -> set(auto).
% 0.64/1.05 % set(auto) -> set(auto_inference).
% 0.64/1.05 % set(auto) -> set(auto_setup).
% 0.64/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.64/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/1.05 % set(auto) -> set(auto_limits).
% 0.64/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/1.05 % set(auto) -> set(auto_denials).
% 0.64/1.05 % set(auto) -> set(auto_process).
% 0.64/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.64/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.64/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.64/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.64/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.64/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.64/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.64/1.05 % set(auto2) -> assign(stats, some).
% 0.64/1.05 % set(auto2) -> clear(echo_input).
% 0.64/1.05 % set(auto2) -> set(quiet).
% 0.64/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.64/1.05 % set(auto2) -> clear(print_given).
% 0.64/1.05 assign(lrs_ticks,-1).
% 0.64/1.05 assign(sos_limit,10000).
% 0.64/1.05 assign(order,kbo).
% 0.64/1.05 set(lex_order_vars).
% 0.64/1.05 clear(print_given).
% 0.64/1.05
% 0.64/1.05 % formulas(sos). % not echoed (5 formulas)
% 0.64/1.05
% 0.64/1.05 ============================== end of input ==========================
% 0.64/1.05
% 0.64/1.05 % From the command line: assign(max_seconds, 300).
% 0.64/1.05
% 0.64/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/1.05
% 0.64/1.05 % Formulas that are not ordinary clauses:
% 0.64/1.05
% 0.64/1.05 ============================== end of process non-clausal formulas ===
% 0.64/1.05
% 0.64/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/1.05
% 0.64/1.05 ============================== PREDICATE ELIMINATION =================
% 0.64/1.05
% 0.64/1.05 ============================== end predicate elimination =============
% 0.64/1.05
% 0.64/1.05 Auto_denials:
% 0.64/1.05 % copying label prove_cn_2 to answer in negative clause
% 0.64/1.05
% 0.64/1.05 Term ordering decisions:
% 0.64/1.05
% 0.64/1.05 % Assigning unary symbol not kb_weight 0 and highest precedence (4).
% 0.64/1.05 Function symbol KB weights: a=1. implies=1. not=0.
% 0.64/1.05
% 0.64/1.05 ============================== end of process initial clauses ========
% 0.64/1.05
% 0.64/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.64/1.05
% 0.64/1.05 ============================== end of clauses for search =============
% 0.64/1.05
% 0.64/1.05 ============================== SEARCH ================================
% 0.64/1.05
% 0.64/1.05 % Starting search at 0.01 seconds.
% 0.64/1.05
% 0.64/1.05 ============================== PROOF =================================
% 0.64/1.05 % SZS status Unsatisfiable
% 0.64/1.05 % SZS output start Refutation
% 0.64/1.05
% 0.64/1.05 % Proof 1 at 0.16 (+ 0.01) seconds: prove_cn_2.
% 0.64/1.05 % Length of proof is 17.
% 0.64/1.05 % Level of proof is 6.
% 0.64/1.05 % Maximum clause weight is 20.000.
% 0.64/1.05 % Given clauses 129.
% 0.64/1.05
% 0.64/1.05 1 is_a_theorem(implies(A,implies(B,A))) # label(cn_18) # label(axiom). [assumption].
% 0.64/1.05 2 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) # label(cn_49) # label(axiom). [assumption].
% 0.64/1.05 3 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) # label(cn_35) # label(axiom). [assumption].
% 0.64/1.05 4 -is_a_theorem(implies(implies(not(a),a),a)) # label(prove_cn_2) # label(negated_conjecture) # answer(prove_cn_2). [assumption].
% 0.64/1.05 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.64/1.05 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.64/1.05 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.64/1.05 10 is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))). [hyper(5,a,1,a,b,2,a)].
% 0.64/1.05 11 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(5,a,1,a,b,1,a)].
% 0.64/1.05 21 is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))). [hyper(5,a,6,a,b,11,a)].
% 0.64/1.05 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.64/1.05 141 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,21,a,b,10,a)].
% 0.64/1.05 153 is_a_theorem(implies(implies(not(A),A),implies(not(A),B))). [hyper(5,a,3,a,b,141,a)].
% 0.64/1.05 237 is_a_theorem(implies(A,implies(implies(not(B),not(A)),B))). [hyper(5,a,21,a,b,26,a)].
% 0.64/1.05 247 is_a_theorem(implies(implies(A,implies(not(B),not(A))),implies(A,B))). [hyper(5,a,3,a,b,237,a)].
% 0.64/1.05 2069 is_a_theorem(implies(implies(not(A),A),A)). [hyper(5,a,247,a,b,153,a)].
% 0.64/1.05 2070 $F # answer(prove_cn_2). [resolve(2069,a,4,a)].
% 0.64/1.05
% 0.64/1.05 % SZS output end Refutation
% 0.64/1.05 ============================== end of proof ==========================
% 0.64/1.05
% 0.64/1.05 ============================== STATISTICS ============================
% 0.64/1.05
% 0.64/1.05 Given=129. Generated=10737. Kept=2069. proofs=1.
% 0.64/1.05 Usable=128. Sos=1901. Demods=0. Limbo=24, Disabled=20. Hints=0.
% 0.64/1.05 Megabytes=1.97.
% 0.64/1.05 User_CPU=0.16, System_CPU=0.01, Wall_clock=0.
% 0.64/1.05
% 0.64/1.05 ============================== end of statistics =====================
% 0.64/1.05
% 0.64/1.05 ============================== end of search =========================
% 0.64/1.05
% 0.64/1.05 THEOREM PROVED
% 0.64/1.05 % SZS status Unsatisfiable
% 0.64/1.05
% 0.64/1.05 Exiting with 1 proof.
% 0.64/1.05
% 0.64/1.05 Process 15587 exit (max_proofs) Mon Jul 4 00:15:10 2022
% 0.64/1.05 Prover9 interrupted
%------------------------------------------------------------------------------