TSTP Solution File: LCL034-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL034-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:43:32 EDT 2022
% Result : Unsatisfiable 0.98s 1.23s
% Output : Refutation 0.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL034-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n027.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 : Sun Jul 3 22:54:25 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.98/1.23 ============================== Prover9 ===============================
% 0.98/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.98/1.23 Process 21885 was started by sandbox on n027.cluster.edu,
% 0.98/1.23 Sun Jul 3 22:54:26 2022
% 0.98/1.23 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21732_n027.cluster.edu".
% 0.98/1.23 ============================== end of head ===========================
% 0.98/1.23
% 0.98/1.23 ============================== INPUT =================================
% 0.98/1.23
% 0.98/1.23 % Reading from file /tmp/Prover9_21732_n027.cluster.edu
% 0.98/1.23
% 0.98/1.23 set(prolog_style_variables).
% 0.98/1.23 set(auto2).
% 0.98/1.23 % set(auto2) -> set(auto).
% 0.98/1.23 % set(auto) -> set(auto_inference).
% 0.98/1.23 % set(auto) -> set(auto_setup).
% 0.98/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.98/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.98/1.23 % set(auto) -> set(auto_limits).
% 0.98/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.98/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.98/1.23 % set(auto) -> set(auto_denials).
% 0.98/1.23 % set(auto) -> set(auto_process).
% 0.98/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.98/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.98/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.98/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.98/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.98/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.98/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.98/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.98/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.98/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.98/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.98/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.98/1.23 % set(auto2) -> assign(stats, some).
% 0.98/1.23 % set(auto2) -> clear(echo_input).
% 0.98/1.23 % set(auto2) -> set(quiet).
% 0.98/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.98/1.23 % set(auto2) -> clear(print_given).
% 0.98/1.23 assign(lrs_ticks,-1).
% 0.98/1.23 assign(sos_limit,10000).
% 0.98/1.23 assign(order,kbo).
% 0.98/1.23 set(lex_order_vars).
% 0.98/1.23 clear(print_given).
% 0.98/1.23
% 0.98/1.23 % formulas(sos). % not echoed (3 formulas)
% 0.98/1.23
% 0.98/1.23 ============================== end of input ==========================
% 0.98/1.23
% 0.98/1.23 % From the command line: assign(max_seconds, 300).
% 0.98/1.23
% 0.98/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.98/1.23
% 0.98/1.23 % Formulas that are not ordinary clauses:
% 0.98/1.23
% 0.98/1.23 ============================== end of process non-clausal formulas ===
% 0.98/1.23
% 0.98/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.98/1.23
% 0.98/1.23 ============================== PREDICATE ELIMINATION =================
% 0.98/1.23
% 0.98/1.23 ============================== end predicate elimination =============
% 0.98/1.23
% 0.98/1.23 Auto_denials:
% 0.98/1.23 % copying label prove_c0_3 to answer in negative clause
% 0.98/1.23
% 0.98/1.23 Term ordering decisions:
% 0.98/1.23 Function symbol KB weights: falsehood=1. a=1. b=1. implies=1.
% 0.98/1.23
% 0.98/1.23 ============================== end of process initial clauses ========
% 0.98/1.23
% 0.98/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.23
% 0.98/1.23 ============================== end of clauses for search =============
% 0.98/1.23
% 0.98/1.23 ============================== SEARCH ================================
% 0.98/1.23
% 0.98/1.23 % Starting search at 0.01 seconds.
% 0.98/1.23
% 0.98/1.23 ============================== PROOF =================================
% 0.98/1.23 % SZS status Unsatisfiable
% 0.98/1.23 % SZS output start Refutation
% 0.98/1.23
% 0.98/1.23 % Proof 1 at 0.16 (+ 0.02) seconds: prove_c0_3.
% 0.98/1.23 % Length of proof is 32.
% 0.98/1.23 % Level of proof is 23.
% 0.98/1.23 % Maximum clause weight is 20.000.
% 0.98/1.23 % Given clauses 140.
% 0.98/1.23
% 0.98/1.23 1 is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))) # label(c0_CAMerideth) # label(axiom). [assumption].
% 0.98/1.23 2 -is_a_theorem(implies(implies(implies(a,b),a),a)) # label(prove_c0_3) # label(negated_conjecture) # answer(prove_c0_3). [assumption].
% 0.98/1.23 3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.98/1.23 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.98/1.23 6 is_a_theorem(implies(implies(implies(A,implies(falsehood,B)),C),implies(D,C))). [hyper(3,a,1,a,b,4,a)].
% 0.98/1.23 14 is_a_theorem(implies(A,implies(B,implies(falsehood,C)))). [hyper(3,a,6,a,b,6,a)].
% 0.98/1.23 18 is_a_theorem(implies(A,implies(falsehood,B))). [hyper(3,a,14,a,b,14,a)].
% 0.98/1.23 26 is_a_theorem(implies(implies(implies(falsehood,A),B),implies(C,B))). [hyper(3,a,1,a,b,18,a)].
% 0.98/1.23 28 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(3,a,4,a,b,26,a)].
% 0.98/1.23 29 is_a_theorem(implies(A,implies(B,A))). [hyper(3,a,28,a,b,28,a)].
% 0.98/1.23 34 is_a_theorem(implies(implies(implies(A,implies(implies(implies(B,C),implies(D,falsehood)),E)),B),implies(D,B))). [hyper(3,a,1,a,b,29,a)].
% 0.98/1.23 67 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(B,D),implies(A,falsehood)),C))). [hyper(3,a,1,a,b,34,a)].
% 0.98/1.23 127 is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(D,implies(C,A)))). [hyper(3,a,67,a,b,29,a)].
% 0.98/1.23 128 is_a_theorem(implies(implies(implies(A,B),implies(implies(falsehood,C),falsehood)),implies(D,A))). [hyper(3,a,67,a,b,26,a)].
% 0.98/1.23 139 is_a_theorem(implies(implies(implies(A,implies(B,C)),B),implies(D,B))). [hyper(3,a,1,a,b,128,a)].
% 0.98/1.23 144 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(3,a,1,a,b,139,a)].
% 0.98/1.23 153 is_a_theorem(implies(implies(implies(implies(A,falsehood),B),C),implies(A,C))). [hyper(3,a,1,a,b,144,a)].
% 0.98/1.23 261 is_a_theorem(implies(implies(A,falsehood),implies(A,B))). [hyper(3,a,153,a,b,153,a)].
% 0.98/1.23 267 is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))). [hyper(3,a,1,a,b,153,a)].
% 0.98/1.23 276 is_a_theorem(implies(A,implies(implies(A,falsehood),B))). [hyper(3,a,153,a,b,261,a)].
% 0.98/1.23 277 is_a_theorem(implies(A,implies(B,B))). [hyper(3,a,127,a,b,261,a)].
% 0.98/1.23 281 is_a_theorem(implies(A,A)). [hyper(3,a,277,a,b,277,a)].
% 0.98/1.23 286 is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))). [hyper(3,a,1,a,b,277,a)].
% 0.98/1.23 287 is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(C,A))). [hyper(3,a,67,a,b,281,a)].
% 0.98/1.23 298 is_a_theorem(implies(A,implies(implies(implies(implies(A,falsehood),B),falsehood),C))). [hyper(3,a,153,a,b,276,a)].
% 0.98/1.23 1011 is_a_theorem(implies(implies(implies(implies(implies(A,B),falsehood),C),falsehood),A)). [hyper(3,a,287,a,b,298,a)].
% 0.98/1.23 1551 is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))). [hyper(3,a,1,a,b,1011,a)].
% 0.98/1.23 1600 is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))). [hyper(3,a,1551,a,b,286,a)].
% 0.98/1.23 1602 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(3,a,1551,a,b,267,a)].
% 0.98/1.23 1622 is_a_theorem(implies(implies(implies(A,A),B),B)). [hyper(3,a,1600,a,b,1600,a)].
% 0.98/1.23 1659 is_a_theorem(implies(implies(implies(A,B),A),A)). [hyper(3,a,1622,a,b,1602,a)].
% 0.98/1.23 1660 $F # answer(prove_c0_3). [resolve(1659,a,2,a)].
% 0.98/1.23
% 0.98/1.23 % SZS output end Refutation
% 0.98/1.23 ============================== end of proof ==========================
% 0.98/1.23
% 0.98/1.23 ============================== STATISTICS ============================
% 0.98/1.23
% 0.98/1.23 Given=140. Generated=12943. Kept=1659. proofs=1.
% 0.98/1.23 Usable=132. Sos=1453. Demods=0. Limbo=0, Disabled=76. Hints=0.
% 0.98/1.23 Megabytes=1.68.
% 0.98/1.23 User_CPU=0.17, System_CPU=0.02, Wall_clock=0.
% 0.98/1.23
% 0.98/1.23 ============================== end of statistics =====================
% 0.98/1.23
% 0.98/1.23 ============================== end of search =========================
% 0.98/1.23
% 0.98/1.23 THEOREM PROVED
% 0.98/1.23 % SZS status Unsatisfiable
% 0.98/1.23
% 0.98/1.23 Exiting with 1 proof.
% 0.98/1.23
% 0.98/1.23 Process 21885 exit (max_proofs) Sun Jul 3 22:54:26 2022
% 0.98/1.23 Prover9 interrupted
%------------------------------------------------------------------------------