TSTP Solution File: LCL111-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL111-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:44:06 EDT 2022
% Result : Unsatisfiable 0.65s 0.99s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL111-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 : Mon Jul 4 14:40:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/0.99 ============================== Prover9 ===============================
% 0.65/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.99 Process 24178 was started by sandbox on n027.cluster.edu,
% 0.65/0.99 Mon Jul 4 14:40:56 2022
% 0.65/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24025_n027.cluster.edu".
% 0.65/0.99 ============================== end of head ===========================
% 0.65/0.99
% 0.65/0.99 ============================== INPUT =================================
% 0.65/0.99
% 0.65/0.99 % Reading from file /tmp/Prover9_24025_n027.cluster.edu
% 0.65/0.99
% 0.65/0.99 set(prolog_style_variables).
% 0.65/0.99 set(auto2).
% 0.65/0.99 % set(auto2) -> set(auto).
% 0.65/0.99 % set(auto) -> set(auto_inference).
% 0.65/0.99 % set(auto) -> set(auto_setup).
% 0.65/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.99 % set(auto) -> set(auto_limits).
% 0.65/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.99 % set(auto) -> set(auto_denials).
% 0.65/0.99 % set(auto) -> set(auto_process).
% 0.65/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.99 % set(auto2) -> assign(stats, some).
% 0.65/0.99 % set(auto2) -> clear(echo_input).
% 0.65/0.99 % set(auto2) -> set(quiet).
% 0.65/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.99 % set(auto2) -> clear(print_given).
% 0.65/0.99 assign(lrs_ticks,-1).
% 0.65/0.99 assign(sos_limit,10000).
% 0.65/0.99 assign(order,kbo).
% 0.65/0.99 set(lex_order_vars).
% 0.65/0.99 clear(print_given).
% 0.65/0.99
% 0.65/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.65/0.99
% 0.65/0.99 ============================== end of input ==========================
% 0.65/0.99
% 0.65/0.99 % From the command line: assign(max_seconds, 300).
% 0.65/0.99
% 0.65/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.99
% 0.65/0.99 % Formulas that are not ordinary clauses:
% 0.65/0.99
% 0.65/0.99 ============================== end of process non-clausal formulas ===
% 0.65/0.99
% 0.65/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.99
% 0.65/0.99 ============================== PREDICATE ELIMINATION =================
% 0.65/0.99
% 0.65/0.99 ============================== end predicate elimination =============
% 0.65/0.99
% 0.65/0.99 Auto_denials:
% 0.65/0.99 % copying label prove_mv_25 to answer in negative clause
% 0.65/0.99
% 0.65/0.99 Term ordering decisions:
% 0.65/0.99
% 0.65/0.99 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 0.65/0.99 Function symbol KB weights: a=1. b=1. c=1. implies=1. not=0.
% 0.65/0.99
% 0.65/0.99 ============================== end of process initial clauses ========
% 0.65/0.99
% 0.65/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.99
% 0.65/0.99 ============================== end of clauses for search =============
% 0.65/0.99
% 0.65/0.99 ============================== SEARCH ================================
% 0.65/0.99
% 0.65/0.99 % Starting search at 0.01 seconds.
% 0.65/0.99
% 0.65/0.99 ============================== PROOF =================================
% 0.65/0.99 % SZS status Unsatisfiable
% 0.65/0.99 % SZS output start Refutation
% 0.65/0.99
% 0.65/0.99 % Proof 1 at 0.08 (+ 0.01) seconds: prove_mv_25.
% 0.65/0.99 % Length of proof is 11.
% 0.65/0.99 % Level of proof is 5.
% 0.65/0.99 % Maximum clause weight is 16.000.
% 0.65/0.99 % Given clauses 87.
% 0.65/0.99
% 0.65/0.99 1 is_a_theorem(implies(A,implies(B,A))) # label(mv_1) # label(axiom). [assumption].
% 0.65/0.99 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(mv_2) # label(axiom). [assumption].
% 0.65/0.99 4 is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))) # label(mv_3) # label(axiom). [assumption].
% 0.65/0.99 5 -is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))) # label(prove_mv_25) # label(negated_conjecture) # answer(prove_mv_25). [assumption].
% 0.65/0.99 6 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.65/0.99 8 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))). [hyper(6,a,3,a,b,3,a)].
% 0.65/0.99 10 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(6,a,3,a,b,1,a)].
% 0.65/0.99 27 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(6,a,10,a,b,4,a)].
% 0.65/0.99 36 is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))). [hyper(6,a,3,a,b,27,a)].
% 0.65/0.99 1308 is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))). [hyper(6,a,36,a,b,8,a)].
% 0.65/0.99 1309 $F # answer(prove_mv_25). [resolve(1308,a,5,a)].
% 0.65/0.99
% 0.65/0.99 % SZS output end Refutation
% 0.65/0.99 ============================== end of proof ==========================
% 0.65/0.99
% 0.65/0.99 ============================== STATISTICS ============================
% 0.65/0.99
% 0.65/0.99 Given=87. Generated=4194. Kept=1308. proofs=1.
% 0.65/0.99 Usable=87. Sos=1181. Demods=0. Limbo=29, Disabled=16. Hints=0.
% 0.65/0.99 Megabytes=1.07.
% 0.65/0.99 User_CPU=0.08, System_CPU=0.01, Wall_clock=0.
% 0.65/0.99
% 0.65/0.99 ============================== end of statistics =====================
% 0.65/0.99
% 0.65/0.99 ============================== end of search =========================
% 0.65/0.99
% 0.65/0.99 THEOREM PROVED
% 0.65/0.99 % SZS status Unsatisfiable
% 0.65/0.99
% 0.65/0.99 Exiting with 1 proof.
% 0.65/0.99
% 0.65/0.99 Process 24178 exit (max_proofs) Mon Jul 4 14:40:56 2022
% 0.65/0.99 Prover9 interrupted
%------------------------------------------------------------------------------