TSTP Solution File: LCL112-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL112-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:07 EDT 2022
% Result : Unsatisfiable 0.73s 1.01s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL112-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 17:10:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.73/1.01 ============================== Prover9 ===============================
% 0.73/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.01 Process 8039 was started by sandbox2 on n026.cluster.edu,
% 0.73/1.01 Sat Jul 2 17:10:51 2022
% 0.73/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7886_n026.cluster.edu".
% 0.73/1.01 ============================== end of head ===========================
% 0.73/1.01
% 0.73/1.01 ============================== INPUT =================================
% 0.73/1.01
% 0.73/1.01 % Reading from file /tmp/Prover9_7886_n026.cluster.edu
% 0.73/1.01
% 0.73/1.01 set(prolog_style_variables).
% 0.73/1.01 set(auto2).
% 0.73/1.01 % set(auto2) -> set(auto).
% 0.73/1.01 % set(auto) -> set(auto_inference).
% 0.73/1.01 % set(auto) -> set(auto_setup).
% 0.73/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.01 % set(auto) -> set(auto_limits).
% 0.73/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.01 % set(auto) -> set(auto_denials).
% 0.73/1.01 % set(auto) -> set(auto_process).
% 0.73/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.01 % set(auto2) -> assign(stats, some).
% 0.73/1.01 % set(auto2) -> clear(echo_input).
% 0.73/1.01 % set(auto2) -> set(quiet).
% 0.73/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.01 % set(auto2) -> clear(print_given).
% 0.73/1.01 assign(lrs_ticks,-1).
% 0.73/1.01 assign(sos_limit,10000).
% 0.73/1.01 assign(order,kbo).
% 0.73/1.01 set(lex_order_vars).
% 0.73/1.01 clear(print_given).
% 0.73/1.01
% 0.73/1.01 % formulas(sos). % not echoed (6 formulas)
% 0.73/1.01
% 0.73/1.01 ============================== end of input ==========================
% 0.73/1.01
% 0.73/1.01 % From the command line: assign(max_seconds, 300).
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.01
% 0.73/1.01 % Formulas that are not ordinary clauses:
% 0.73/1.01
% 0.73/1.01 ============================== end of process non-clausal formulas ===
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.01
% 0.73/1.01 ============================== PREDICATE ELIMINATION =================
% 0.73/1.01
% 0.73/1.01 ============================== end predicate elimination =============
% 0.73/1.01
% 0.73/1.01 Auto_denials:
% 0.73/1.01 % copying label prove_mv_29 to answer in negative clause
% 0.73/1.01
% 0.73/1.01 Term ordering decisions:
% 0.73/1.01
% 0.73/1.01 % Assigning unary symbol not kb_weight 0 and highest precedence (4).
% 0.73/1.01 Function symbol KB weights: a=1. implies=1. not=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of process initial clauses ========
% 0.73/1.01
% 0.73/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.01
% 0.73/1.01 ============================== end of clauses for search =============
% 0.73/1.01
% 0.73/1.01 ============================== SEARCH ================================
% 0.73/1.01
% 0.73/1.01 % Starting search at 0.01 seconds.
% 0.73/1.01
% 0.73/1.01 ============================== PROOF =================================
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01 % SZS output start Refutation
% 0.73/1.02
% 0.73/1.02 % Proof 1 at 0.03 (+ 0.00) seconds: prove_mv_29.
% 0.73/1.02 % Length of proof is 19.
% 0.73/1.02 % Level of proof is 8.
% 0.73/1.02 % Maximum clause weight is 14.000.
% 0.73/1.02 % Given clauses 43.
% 0.73/1.02
% 0.73/1.02 1 is_a_theorem(implies(A,implies(B,A))) # label(mv_1) # label(axiom). [assumption].
% 0.73/1.02 2 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) # label(mv_5) # label(axiom). [assumption].
% 0.73/1.02 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(mv_2) # label(axiom). [assumption].
% 0.73/1.02 4 is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))) # label(mv_3) # label(axiom). [assumption].
% 0.73/1.02 5 -is_a_theorem(implies(a,not(not(a)))) # label(prove_mv_29) # label(negated_conjecture) # answer(prove_mv_29). [assumption].
% 0.73/1.02 6 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.73/1.02 9 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))). [hyper(6,a,3,a,b,2,a)].
% 0.73/1.02 10 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(6,a,3,a,b,1,a)].
% 0.73/1.02 14 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(6,a,1,a,b,1,a)].
% 0.73/1.02 21 is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)). [hyper(6,a,4,a,b,14,a)].
% 0.73/1.02 27 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(6,a,10,a,b,4,a)].
% 0.73/1.02 29 is_a_theorem(implies(not(A),implies(A,B))). [hyper(6,a,10,a,b,2,a)].
% 0.73/1.02 31 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))). [hyper(6,a,3,a,b,29,a)].
% 0.73/1.02 75 is_a_theorem(implies(A,A)). [hyper(6,a,10,a,b,21,a)].
% 0.73/1.02 80 is_a_theorem(implies(implies(implies(A,A),B),B)). [hyper(6,a,27,a,b,75,a)].
% 0.73/1.02 107 is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)). [hyper(6,a,9,a,b,80,a)].
% 0.73/1.02 351 is_a_theorem(implies(not(not(A)),A)). [hyper(6,a,31,a,b,107,a)].
% 0.73/1.02 396 is_a_theorem(implies(A,not(not(A)))). [hyper(6,a,2,a,b,351,a)].
% 0.73/1.02 397 $F # answer(prove_mv_29). [resolve(396,a,5,a)].
% 0.73/1.02
% 0.73/1.02 % SZS output end Refutation
% 0.73/1.02 ============================== end of proof ==========================
% 0.73/1.02
% 0.73/1.02 ============================== STATISTICS ============================
% 0.73/1.02
% 0.73/1.02 Given=43. Generated=1365. Kept=396. proofs=1.
% 0.73/1.02 Usable=43. Sos=341. Demods=0. Limbo=8, Disabled=9. Hints=0.
% 0.73/1.02 Megabytes=0.34.
% 0.73/1.02 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.73/1.02
% 0.73/1.02 ============================== end of statistics =====================
% 0.73/1.02
% 0.73/1.02 ============================== end of search =========================
% 0.73/1.02
% 0.73/1.02 THEOREM PROVED
% 0.73/1.02 % SZS status Unsatisfiable
% 0.73/1.02
% 0.73/1.02 Exiting with 1 proof.
% 0.73/1.02
% 0.73/1.02 Process 8039 exit (max_proofs) Sat Jul 2 17:10:51 2022
% 0.73/1.02 Prover9 interrupted
%------------------------------------------------------------------------------