TSTP Solution File: LCL064-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL064-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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.83s 1.12s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL064-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 18:36:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.83/1.12 ============================== Prover9 ===============================
% 0.83/1.12 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.12 Process 7076 was started by sandbox on n012.cluster.edu,
% 0.83/1.12 Sun Jul 3 18:36:47 2022
% 0.83/1.12 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6922_n012.cluster.edu".
% 0.83/1.12 ============================== end of head ===========================
% 0.83/1.12
% 0.83/1.12 ============================== INPUT =================================
% 0.83/1.12
% 0.83/1.12 % Reading from file /tmp/Prover9_6922_n012.cluster.edu
% 0.83/1.12
% 0.83/1.12 set(prolog_style_variables).
% 0.83/1.12 set(auto2).
% 0.83/1.12 % set(auto2) -> set(auto).
% 0.83/1.12 % set(auto) -> set(auto_inference).
% 0.83/1.12 % set(auto) -> set(auto_setup).
% 0.83/1.12 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.12 % set(auto) -> set(auto_limits).
% 0.83/1.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.12 % set(auto) -> set(auto_denials).
% 0.83/1.12 % set(auto) -> set(auto_process).
% 0.83/1.12 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.12 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.12 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.12 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.12 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.12 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.12 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.12 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.12 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.12 % set(auto2) -> assign(stats, some).
% 0.83/1.12 % set(auto2) -> clear(echo_input).
% 0.83/1.12 % set(auto2) -> set(quiet).
% 0.83/1.12 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.12 % set(auto2) -> clear(print_given).
% 0.83/1.12 assign(lrs_ticks,-1).
% 0.83/1.12 assign(sos_limit,10000).
% 0.83/1.12 assign(order,kbo).
% 0.83/1.12 set(lex_order_vars).
% 0.83/1.12 clear(print_given).
% 0.83/1.12
% 0.83/1.12 % formulas(sos). % not echoed (4 formulas)
% 0.83/1.12
% 0.83/1.12 ============================== end of input ==========================
% 0.83/1.12
% 0.83/1.12 % From the command line: assign(max_seconds, 300).
% 0.83/1.12
% 0.83/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.12
% 0.83/1.12 % Formulas that are not ordinary clauses:
% 0.83/1.12
% 0.83/1.12 ============================== end of process non-clausal formulas ===
% 0.83/1.12
% 0.83/1.12 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.12
% 0.83/1.12 ============================== PREDICATE ELIMINATION =================
% 0.83/1.12
% 0.83/1.12 ============================== end predicate elimination =============
% 0.83/1.12
% 0.83/1.12 Auto_denials:
% 0.83/1.12 % copying label prove_cn_1 to answer in negative clause
% 0.83/1.12
% 0.83/1.12 Term ordering decisions:
% 0.83/1.12 Function symbol KB weights: a=1. b=1. c=1. implies=1.
% 0.83/1.12
% 0.83/1.12 ============================== end of process initial clauses ========
% 0.83/1.12
% 0.83/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.12
% 0.83/1.12 ============================== end of clauses for search =============
% 0.83/1.12
% 0.83/1.12 ============================== SEARCH ================================
% 0.83/1.12
% 0.83/1.12 % Starting search at 0.01 seconds.
% 0.83/1.12
% 0.83/1.12 ============================== PROOF =================================
% 0.83/1.12 % SZS status Unsatisfiable
% 0.83/1.12 % SZS output start Refutation
% 0.83/1.12
% 0.83/1.12 % Proof 1 at 0.17 (+ 0.01) seconds: prove_cn_1.
% 0.83/1.12 % Length of proof is 17.
% 0.83/1.12 % Level of proof is 8.
% 0.83/1.12 % Maximum clause weight is 24.000.
% 0.83/1.12 % Given clauses 94.
% 0.83/1.12
% 0.83/1.12 1 is_a_theorem(implies(A,implies(B,A))) # label(cn_18) # label(axiom). [assumption].
% 0.83/1.12 2 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) # label(cn_35) # label(axiom). [assumption].
% 0.83/1.12 3 -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))) # label(prove_cn_1) # label(negated_conjecture) # answer(prove_cn_1). [assumption].
% 0.83/1.12 4 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.83/1.12 5 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))). [hyper(4,a,2,a,b,2,a)].
% 0.83/1.12 7 is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))). [hyper(4,a,1,a,b,2,a)].
% 0.83/1.12 8 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(4,a,1,a,b,1,a)].
% 0.83/1.12 18 is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))). [hyper(4,a,5,a,b,8,a)].
% 0.83/1.12 20 is_a_theorem(implies(A,implies(B,implies(C,implies(D,C))))). [hyper(4,a,1,a,b,8,a)].
% 0.83/1.12 21 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(implies(A,B),implies(A,C)),D)),implies(implies(A,implies(B,C)),D))). [hyper(4,a,5,a,b,7,a)].
% 0.83/1.12 53 is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))). [hyper(4,a,5,a,b,20,a)].
% 0.83/1.12 109 is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))). [hyper(4,a,18,a,b,7,a)].
% 0.83/1.12 503 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(4,a,53,a,b,109,a)].
% 0.83/1.12 520 is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))). [hyper(4,a,1,a,b,503,a)].
% 0.83/1.12 856 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))). [hyper(4,a,21,a,b,520,a)].
% 0.83/1.12 1728 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))). [hyper(4,a,856,a,b,109,a)].
% 0.83/1.12 1729 $F # answer(prove_cn_1). [resolve(1728,a,3,a)].
% 0.83/1.12
% 0.83/1.12 % SZS output end Refutation
% 0.83/1.12 ============================== end of proof ==========================
% 0.83/1.12
% 0.83/1.12 ============================== STATISTICS ============================
% 0.83/1.12
% 0.83/1.12 Given=94. Generated=7535. Kept=1728. proofs=1.
% 0.83/1.12 Usable=93. Sos=1595. Demods=0. Limbo=33, Disabled=10. Hints=0.
% 0.83/1.12 Megabytes=1.72.
% 0.83/1.12 User_CPU=0.17, System_CPU=0.01, Wall_clock=0.
% 0.83/1.12
% 0.83/1.12 ============================== end of statistics =====================
% 0.83/1.12
% 0.83/1.12 ============================== end of search =========================
% 0.83/1.12
% 0.83/1.12 THEOREM PROVED
% 0.83/1.12 % SZS status Unsatisfiable
% 0.83/1.12
% 0.83/1.12 Exiting with 1 proof.
% 0.83/1.12
% 0.83/1.12 Process 7076 exit (max_proofs) Sun Jul 3 18:36:47 2022
% 0.83/1.12 Prover9 interrupted
%------------------------------------------------------------------------------