TSTP Solution File: LCL069-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL069-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:46 EDT 2022
% Result : Unsatisfiable 0.81s 1.10s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL069-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n024.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 : Sat Jul 2 23:37:45 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.81/1.10 ============================== Prover9 ===============================
% 0.81/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.10 Process 32573 was started by sandbox on n024.cluster.edu,
% 0.81/1.10 Sat Jul 2 23:37:45 2022
% 0.81/1.10 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32418_n024.cluster.edu".
% 0.81/1.10 ============================== end of head ===========================
% 0.81/1.10
% 0.81/1.10 ============================== INPUT =================================
% 0.81/1.10
% 0.81/1.10 % Reading from file /tmp/Prover9_32418_n024.cluster.edu
% 0.81/1.10
% 0.81/1.10 set(prolog_style_variables).
% 0.81/1.10 set(auto2).
% 0.81/1.10 % set(auto2) -> set(auto).
% 0.81/1.10 % set(auto) -> set(auto_inference).
% 0.81/1.10 % set(auto) -> set(auto_setup).
% 0.81/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.10 % set(auto) -> set(auto_limits).
% 0.81/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.10 % set(auto) -> set(auto_denials).
% 0.81/1.10 % set(auto) -> set(auto_process).
% 0.81/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.10 % set(auto2) -> assign(stats, some).
% 0.81/1.10 % set(auto2) -> clear(echo_input).
% 0.81/1.10 % set(auto2) -> set(quiet).
% 0.81/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.10 % set(auto2) -> clear(print_given).
% 0.81/1.10 assign(lrs_ticks,-1).
% 0.81/1.10 assign(sos_limit,10000).
% 0.81/1.10 assign(order,kbo).
% 0.81/1.10 set(lex_order_vars).
% 0.81/1.10 clear(print_given).
% 0.81/1.10
% 0.81/1.10 % formulas(sos). % not echoed (5 formulas)
% 0.81/1.10
% 0.81/1.10 ============================== end of input ==========================
% 0.81/1.10
% 0.81/1.10 % From the command line: assign(max_seconds, 300).
% 0.81/1.10
% 0.81/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.10
% 0.81/1.10 % Formulas that are not ordinary clauses:
% 0.81/1.10
% 0.81/1.10 ============================== end of process non-clausal formulas ===
% 0.81/1.10
% 0.81/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.10
% 0.81/1.10 ============================== PREDICATE ELIMINATION =================
% 0.81/1.10
% 0.81/1.10 ============================== end predicate elimination =============
% 0.81/1.10
% 0.81/1.10 Auto_denials:
% 0.81/1.10 % copying label prove_cn_3 to answer in negative clause
% 0.81/1.10
% 0.81/1.10 Term ordering decisions:
% 0.81/1.10
% 0.81/1.10 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.81/1.10 Function symbol KB weights: a=1. b=1. implies=1. not=0.
% 0.81/1.10
% 0.81/1.10 ============================== end of process initial clauses ========
% 0.81/1.10
% 0.81/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.10
% 0.81/1.10 ============================== end of clauses for search =============
% 0.81/1.10
% 0.81/1.10 ============================== SEARCH ================================
% 0.81/1.10
% 0.81/1.10 % Starting search at 0.01 seconds.
% 0.81/1.10
% 0.81/1.10 ============================== PROOF =================================
% 0.81/1.10 % SZS status Unsatisfiable
% 0.81/1.10 % SZS output start Refutation
% 0.81/1.10
% 0.81/1.10 % Proof 1 at 0.14 (+ 0.02) seconds: prove_cn_3.
% 0.81/1.10 % Length of proof is 15.
% 0.81/1.10 % Level of proof is 10.
% 0.81/1.10 % Maximum clause weight is 18.000.
% 0.81/1.10 % Given clauses 149.
% 0.81/1.10
% 0.81/1.10 1 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))) # label(cn_19) # label(axiom). [assumption].
% 0.81/1.10 2 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))) # label(cn_37) # label(axiom). [assumption].
% 0.81/1.10 3 is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))) # label(cn_59) # label(axiom). [assumption].
% 0.81/1.10 4 -is_a_theorem(implies(a,implies(not(a),b))) # label(prove_cn_3) # label(negated_conjecture) # answer(prove_cn_3). [assumption].
% 0.81/1.10 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.81/1.10 11 is_a_theorem(implies(A,implies(B,A))). [hyper(5,a,1,a,b,1,a)].
% 0.81/1.10 15 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,2,a,b,11,a)].
% 0.81/1.10 40 is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))). [hyper(5,a,3,a,b,15,a)].
% 0.81/1.10 465 is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))). [hyper(5,a,40,a,b,11,a)].
% 0.81/1.10 555 is_a_theorem(implies(A,implies(B,B))). [hyper(5,a,465,a,b,11,a)].
% 0.81/1.10 559 is_a_theorem(implies(A,A)). [hyper(5,a,555,a,b,555,a)].
% 0.81/1.10 577 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,2,a,b,559,a)].
% 0.81/1.10 581 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,40,a,b,577,a)].
% 0.81/1.10 1916 is_a_theorem(implies(A,implies(not(A),B))). [hyper(5,a,581,a,b,559,a)].
% 0.81/1.10 1917 $F # answer(prove_cn_3). [resolve(1916,a,4,a)].
% 0.81/1.10
% 0.81/1.10 % SZS output end Refutation
% 0.81/1.10 ============================== end of proof ==========================
% 0.81/1.10
% 0.81/1.10 ============================== STATISTICS ============================
% 0.81/1.10
% 0.81/1.10 Given=149. Generated=12153. Kept=1916. proofs=1.
% 0.81/1.10 Usable=148. Sos=1730. Demods=0. Limbo=21, Disabled=21. Hints=0.
% 0.81/1.10 Megabytes=1.94.
% 0.81/1.10 User_CPU=0.14, System_CPU=0.02, Wall_clock=0.
% 0.81/1.10
% 0.81/1.10 ============================== end of statistics =====================
% 0.81/1.10
% 0.81/1.10 ============================== end of search =========================
% 0.81/1.10
% 0.81/1.10 THEOREM PROVED
% 0.81/1.10 % SZS status Unsatisfiable
% 0.81/1.10
% 0.81/1.10 Exiting with 1 proof.
% 0.81/1.10
% 0.81/1.10 Process 32573 exit (max_proofs) Sat Jul 2 23:37:45 2022
% 0.81/1.10 Prover9 interrupted
%------------------------------------------------------------------------------