TSTP Solution File: LCL082-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL082-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:52 EDT 2022
% Result : Unsatisfiable 0.42s 0.91s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL082-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n023.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 : Sun Jul 3 18:04:13 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.42/0.91 ============================== Prover9 ===============================
% 0.42/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.91 Process 1688 was started by sandbox on n023.cluster.edu,
% 0.42/0.91 Sun Jul 3 18:04:13 2022
% 0.42/0.91 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1531_n023.cluster.edu".
% 0.42/0.91 ============================== end of head ===========================
% 0.42/0.91
% 0.42/0.91 ============================== INPUT =================================
% 0.42/0.91
% 0.42/0.91 % Reading from file /tmp/Prover9_1531_n023.cluster.edu
% 0.42/0.91
% 0.42/0.91 set(prolog_style_variables).
% 0.42/0.91 set(auto2).
% 0.42/0.91 % set(auto2) -> set(auto).
% 0.42/0.91 % set(auto) -> set(auto_inference).
% 0.42/0.91 % set(auto) -> set(auto_setup).
% 0.42/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.91 % set(auto) -> set(auto_limits).
% 0.42/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.91 % set(auto) -> set(auto_denials).
% 0.42/0.91 % set(auto) -> set(auto_process).
% 0.42/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.91 % set(auto2) -> assign(stats, some).
% 0.42/0.91 % set(auto2) -> clear(echo_input).
% 0.42/0.91 % set(auto2) -> set(quiet).
% 0.42/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.91 % set(auto2) -> clear(print_given).
% 0.42/0.91 assign(lrs_ticks,-1).
% 0.42/0.91 assign(sos_limit,10000).
% 0.42/0.91 assign(order,kbo).
% 0.42/0.91 set(lex_order_vars).
% 0.42/0.91 clear(print_given).
% 0.42/0.91
% 0.42/0.91 % formulas(sos). % not echoed (3 formulas)
% 0.42/0.91
% 0.42/0.91 ============================== end of input ==========================
% 0.42/0.91
% 0.42/0.91 % From the command line: assign(max_seconds, 300).
% 0.42/0.91
% 0.42/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.91
% 0.42/0.91 % Formulas that are not ordinary clauses:
% 0.42/0.91
% 0.42/0.91 ============================== end of process non-clausal formulas ===
% 0.42/0.91
% 0.42/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.91
% 0.42/0.91 ============================== PREDICATE ELIMINATION =================
% 0.42/0.91
% 0.42/0.91 ============================== end predicate elimination =============
% 0.42/0.91
% 0.42/0.91 Auto_denials:
% 0.42/0.91 % copying label prove_ic_2 to answer in negative clause
% 0.42/0.91
% 0.42/0.91 Term ordering decisions:
% 0.42/0.91 Function symbol KB weights: a=1. b=1. implies=1.
% 0.42/0.91
% 0.42/0.91 ============================== end of process initial clauses ========
% 0.42/0.91
% 0.42/0.91 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.91
% 0.42/0.91 ============================== end of clauses for search =============
% 0.42/0.91
% 0.42/0.91 ============================== SEARCH ================================
% 0.42/0.91
% 0.42/0.91 % Starting search at 0.01 seconds.
% 0.42/0.91
% 0.42/0.91 ============================== PROOF =================================
% 0.42/0.91 % SZS status Unsatisfiable
% 0.42/0.91 % SZS output start Refutation
% 0.42/0.91
% 0.42/0.91 % Proof 1 at 0.01 (+ 0.00) seconds: prove_ic_2.
% 0.42/0.91 % Length of proof is 14.
% 0.42/0.91 % Level of proof is 10.
% 0.42/0.91 % Maximum clause weight is 24.000.
% 0.42/0.91 % Given clauses 18.
% 0.42/0.91
% 0.42/0.91 1 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))) # label(ic_JLukasiewicz) # label(axiom). [assumption].
% 0.42/0.91 2 -is_a_theorem(implies(a,implies(b,a))) # label(prove_ic_2) # label(negated_conjecture) # answer(prove_ic_2). [assumption].
% 0.42/0.91 3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.42/0.91 4 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))). [hyper(3,a,1,a,b,1,a)].
% 0.42/0.91 5 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))). [hyper(3,a,4,a,b,4,a)].
% 0.42/0.91 6 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(E,B))),implies(F,implies(implies(D,B),implies(E,B))))). [hyper(3,a,1,a,b,4,a)].
% 0.42/0.91 7 is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))). [hyper(3,a,5,a,b,5,a)].
% 0.42/0.91 9 is_a_theorem(implies(implies(implies(A,implies(B,A)),B),implies(C,B))). [hyper(3,a,1,a,b,7,a)].
% 0.42/0.91 24 is_a_theorem(implies(A,implies(implies(B,C),implies(C,C)))). [hyper(3,a,6,a,b,9,a)].
% 0.42/0.91 26 is_a_theorem(implies(implies(A,B),implies(B,B))). [hyper(3,a,24,a,b,24,a)].
% 0.42/0.91 30 is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))). [hyper(3,a,1,a,b,26,a)].
% 0.42/0.91 37 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(3,a,4,a,b,30,a)].
% 0.42/0.91 44 is_a_theorem(implies(A,implies(B,A))). [hyper(3,a,37,a,b,37,a)].
% 0.42/0.91 45 $F # answer(prove_ic_2). [resolve(44,a,2,a)].
% 0.42/0.91
% 0.42/0.91 % SZS output end Refutation
% 0.42/0.91 ============================== end of proof ==========================
% 0.42/0.91
% 0.42/0.91 ============================== STATISTICS ============================
% 0.42/0.91
% 0.42/0.91 Given=18. Generated=182. Kept=44. proofs=1.
% 0.42/0.91 Usable=13. Sos=14. Demods=0. Limbo=0, Disabled=19. Hints=0.
% 0.42/0.91 Megabytes=0.06.
% 0.42/0.91 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.91
% 0.42/0.91 ============================== end of statistics =====================
% 0.42/0.91
% 0.42/0.91 ============================== end of search =========================
% 0.42/0.91
% 0.42/0.91 THEOREM PROVED
% 0.42/0.91 % SZS status Unsatisfiable
% 0.42/0.91
% 0.42/0.91 Exiting with 1 proof.
% 0.42/0.91
% 0.42/0.91 Process 1688 exit (max_proofs) Sun Jul 3 18:04:13 2022
% 0.42/0.91 Prover9 interrupted
%------------------------------------------------------------------------------