TSTP Solution File: LCL378-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL378-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:46:14 EDT 2022
% Result : Unsatisfiable 1.01s 1.32s
% Output : Refutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL378-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n016.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 : Sat Jul 2 11:29:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.01/1.32 ============================== Prover9 ===============================
% 1.01/1.32 Prover9 (32) version 2009-11A, November 2009.
% 1.01/1.32 Process 27239 was started by sandbox on n016.cluster.edu,
% 1.01/1.32 Sat Jul 2 11:29:44 2022
% 1.01/1.32 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27086_n016.cluster.edu".
% 1.01/1.32 ============================== end of head ===========================
% 1.01/1.32
% 1.01/1.32 ============================== INPUT =================================
% 1.01/1.32
% 1.01/1.32 % Reading from file /tmp/Prover9_27086_n016.cluster.edu
% 1.01/1.32
% 1.01/1.32 set(prolog_style_variables).
% 1.01/1.32 set(auto2).
% 1.01/1.32 % set(auto2) -> set(auto).
% 1.01/1.32 % set(auto) -> set(auto_inference).
% 1.01/1.32 % set(auto) -> set(auto_setup).
% 1.01/1.32 % set(auto_setup) -> set(predicate_elim).
% 1.01/1.32 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.01/1.32 % set(auto) -> set(auto_limits).
% 1.01/1.32 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.01/1.32 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.01/1.32 % set(auto) -> set(auto_denials).
% 1.01/1.32 % set(auto) -> set(auto_process).
% 1.01/1.32 % set(auto2) -> assign(new_constants, 1).
% 1.01/1.32 % set(auto2) -> assign(fold_denial_max, 3).
% 1.01/1.32 % set(auto2) -> assign(max_weight, "200.000").
% 1.01/1.32 % set(auto2) -> assign(max_hours, 1).
% 1.01/1.32 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.01/1.32 % set(auto2) -> assign(max_seconds, 0).
% 1.01/1.32 % set(auto2) -> assign(max_minutes, 5).
% 1.01/1.32 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.01/1.32 % set(auto2) -> set(sort_initial_sos).
% 1.01/1.32 % set(auto2) -> assign(sos_limit, -1).
% 1.01/1.32 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.01/1.32 % set(auto2) -> assign(max_megs, 400).
% 1.01/1.32 % set(auto2) -> assign(stats, some).
% 1.01/1.32 % set(auto2) -> clear(echo_input).
% 1.01/1.32 % set(auto2) -> set(quiet).
% 1.01/1.32 % set(auto2) -> clear(print_initial_clauses).
% 1.01/1.32 % set(auto2) -> clear(print_given).
% 1.01/1.32 assign(lrs_ticks,-1).
% 1.01/1.32 assign(sos_limit,10000).
% 1.01/1.32 assign(order,kbo).
% 1.01/1.32 set(lex_order_vars).
% 1.01/1.32 clear(print_given).
% 1.01/1.32
% 1.01/1.32 % formulas(sos). % not echoed (5 formulas)
% 1.01/1.32
% 1.01/1.32 ============================== end of input ==========================
% 1.01/1.32
% 1.01/1.32 % From the command line: assign(max_seconds, 300).
% 1.01/1.32
% 1.01/1.32 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.01/1.32
% 1.01/1.32 % Formulas that are not ordinary clauses:
% 1.01/1.32
% 1.01/1.32 ============================== end of process non-clausal formulas ===
% 1.01/1.32
% 1.01/1.32 ============================== PROCESS INITIAL CLAUSES ===============
% 1.01/1.32
% 1.01/1.32 ============================== PREDICATE ELIMINATION =================
% 1.01/1.32
% 1.01/1.32 ============================== end predicate elimination =============
% 1.01/1.32
% 1.01/1.32 Auto_denials:
% 1.01/1.32 % copying label prove_cn_36 to answer in negative clause
% 1.01/1.32
% 1.01/1.32 Term ordering decisions:
% 1.01/1.32
% 1.01/1.32 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 1.01/1.32 Function symbol KB weights: x=1. y=1. implies=1. not=0.
% 1.01/1.32
% 1.01/1.32 ============================== end of process initial clauses ========
% 1.01/1.32
% 1.01/1.32 ============================== CLAUSES FOR SEARCH ====================
% 1.01/1.32
% 1.01/1.32 ============================== end of clauses for search =============
% 1.01/1.32
% 1.01/1.32 ============================== SEARCH ================================
% 1.01/1.32
% 1.01/1.32 % Starting search at 0.01 seconds.
% 1.01/1.32
% 1.01/1.32 ============================== PROOF =================================
% 1.01/1.32 % SZS status Unsatisfiable
% 1.01/1.32 % SZS output start Refutation
% 1.01/1.32
% 1.01/1.32 % Proof 1 at 0.35 (+ 0.02) seconds: prove_cn_36.
% 1.01/1.32 % Length of proof is 30.
% 1.01/1.32 % Level of proof is 16.
% 1.01/1.32 % Maximum clause weight is 17.000.
% 1.01/1.32 % Given clauses 195.
% 1.01/1.32
% 1.01/1.32 1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom). [assumption].
% 1.01/1.32 2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom). [assumption].
% 1.01/1.32 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom). [assumption].
% 1.01/1.32 4 -is_a_theorem(implies(not(x),implies(x,y))) # label(prove_cn_36) # label(negated_conjecture) # answer(prove_cn_36). [assumption].
% 1.01/1.32 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 1.01/1.32 6 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))). [hyper(5,a,3,a,b,3,a)].
% 1.01/1.32 7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))). [hyper(5,a,3,a,b,2,a)].
% 1.01/1.32 8 is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))). [hyper(5,a,3,a,b,1,a)].
% 1.01/1.32 12 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))). [hyper(5,a,6,a,b,6,a)].
% 1.01/1.32 21 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,6,a,b,7,a)].
% 1.01/1.32 26 is_a_theorem(implies(A,A)). [hyper(5,a,7,a,b,1,a)].
% 1.01/1.32 27 is_a_theorem(implies(not(implies(A,A)),B)). [hyper(5,a,2,a,b,26,a)].
% 1.01/1.32 37 is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))). [hyper(5,a,8,a,b,3,a)].
% 1.01/1.32 68 is_a_theorem(implies(A,implies(B,implies(not(A),C)))). [hyper(5,a,7,a,b,21,a)].
% 1.01/1.32 69 is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))). [hyper(5,a,3,a,b,21,a)].
% 1.01/1.32 72 is_a_theorem(implies(A,implies(not(implies(B,B)),C))). [hyper(5,a,21,a,b,27,a)].
% 1.01/1.32 81 is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))). [hyper(5,a,3,a,b,68,a)].
% 1.01/1.32 95 is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))). [hyper(5,a,3,a,b,72,a)].
% 1.01/1.32 460 is_a_theorem(implies(A,implies(B,B))). [hyper(5,a,95,a,b,1,a)].
% 1.01/1.32 469 is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,460,a)].
% 1.01/1.32 550 is_a_theorem(implies(A,implies(implies(not(B),B),B))). [hyper(5,a,469,a,b,1,a)].
% 1.01/1.32 588 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,550,a)].
% 1.01/1.32 1506 is_a_theorem(implies(A,implies(B,implies(C,A)))). [hyper(5,a,81,a,b,588,a)].
% 1.01/1.32 1534 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(5,a,588,a,b,1506,a)].
% 1.01/1.32 1622 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(5,a,37,a,b,1534,a)].
% 1.01/1.32 5016 is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))). [hyper(5,a,69,a,b,588,a)].
% 1.01/1.32 5106 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,1622,a,b,5016,a)].
% 1.01/1.32 5143 is_a_theorem(implies(A,implies(not(B),implies(B,C)))). [hyper(5,a,588,a,b,5106,a)].
% 1.01/1.32 5161 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,5143,a,b,5143,a)].
% 1.01/1.32 5162 $F # answer(prove_cn_36). [resolve(5161,a,4,a)].
% 1.01/1.32
% 1.01/1.32 % SZS output end Refutation
% 1.01/1.32 ============================== end of proof ==========================
% 1.01/1.32
% 1.01/1.32 ============================== STATISTICS ============================
% 1.01/1.32
% 1.01/1.32 Given=195. Generated=20069. Kept=5161. proofs=1.
% 1.01/1.32 Usable=189. Sos=4810. Demods=0. Limbo=0, Disabled=166. Hints=0.
% 1.01/1.32 Megabytes=5.26.
% 1.01/1.32 User_CPU=0.35, System_CPU=0.02, Wall_clock=0.
% 1.01/1.32
% 1.01/1.32 ============================== end of statistics =====================
% 1.01/1.32
% 1.01/1.32 ============================== end of search =========================
% 1.01/1.32
% 1.01/1.32 THEOREM PROVED
% 1.01/1.32 % SZS status Unsatisfiable
% 1.01/1.32
% 1.01/1.32 Exiting with 1 proof.
% 1.01/1.32
% 1.01/1.32 Process 27239 exit (max_proofs) Sat Jul 2 11:29:44 2022
% 1.01/1.32 Prover9 interrupted
%------------------------------------------------------------------------------