TSTP Solution File: LCL057-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL057-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:43:41 EDT 2022
% Result : Unsatisfiable 1.10s 1.44s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL057-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 11:22:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 1.10/1.44 ============================== Prover9 ===============================
% 1.10/1.44 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.44 Process 16354 was started by sandbox2 on n026.cluster.edu,
% 1.10/1.44 Mon Jul 4 11:22:52 2022
% 1.10/1.44 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16201_n026.cluster.edu".
% 1.10/1.44 ============================== end of head ===========================
% 1.10/1.44
% 1.10/1.44 ============================== INPUT =================================
% 1.10/1.44
% 1.10/1.44 % Reading from file /tmp/Prover9_16201_n026.cluster.edu
% 1.10/1.44
% 1.10/1.44 set(prolog_style_variables).
% 1.10/1.44 set(auto2).
% 1.10/1.44 % set(auto2) -> set(auto).
% 1.10/1.44 % set(auto) -> set(auto_inference).
% 1.10/1.44 % set(auto) -> set(auto_setup).
% 1.10/1.44 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.44 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.44 % set(auto) -> set(auto_limits).
% 1.10/1.44 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.44 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.44 % set(auto) -> set(auto_denials).
% 1.10/1.44 % set(auto) -> set(auto_process).
% 1.10/1.44 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.44 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.44 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.44 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.44 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.44 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.44 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.44 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.44 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.44 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.44 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.44 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.44 % set(auto2) -> assign(stats, some).
% 1.10/1.44 % set(auto2) -> clear(echo_input).
% 1.10/1.44 % set(auto2) -> set(quiet).
% 1.10/1.44 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.44 % set(auto2) -> clear(print_given).
% 1.10/1.44 assign(lrs_ticks,-1).
% 1.10/1.44 assign(sos_limit,10000).
% 1.10/1.44 assign(order,kbo).
% 1.10/1.44 set(lex_order_vars).
% 1.10/1.44 clear(print_given).
% 1.10/1.44
% 1.10/1.44 % formulas(sos). % not echoed (5 formulas)
% 1.10/1.44
% 1.10/1.44 ============================== end of input ==========================
% 1.10/1.44
% 1.10/1.44 % From the command line: assign(max_seconds, 300).
% 1.10/1.44
% 1.10/1.44 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.44
% 1.10/1.44 % Formulas that are not ordinary clauses:
% 1.10/1.44
% 1.10/1.44 ============================== end of process non-clausal formulas ===
% 1.10/1.44
% 1.10/1.44 ============================== PROCESS INITIAL CLAUSES ===============
% 1.10/1.44
% 1.10/1.44 ============================== PREDICATE ELIMINATION =================
% 1.10/1.44
% 1.10/1.44 ============================== end predicate elimination =============
% 1.10/1.44
% 1.10/1.44 Auto_denials:
% 1.10/1.44 % copying label prove_cn_40 to answer in negative clause
% 1.10/1.44
% 1.10/1.44 Term ordering decisions:
% 1.10/1.44
% 1.10/1.44 % Assigning unary symbol not kb_weight 0 and highest precedence (4).
% 1.10/1.44 Function symbol KB weights: a=1. implies=1. not=0.
% 1.10/1.44
% 1.10/1.44 ============================== end of process initial clauses ========
% 1.10/1.44
% 1.10/1.44 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.44
% 1.10/1.44 ============================== end of clauses for search =============
% 1.10/1.44
% 1.10/1.44 ============================== SEARCH ================================
% 1.10/1.44
% 1.10/1.44 % Starting search at 0.01 seconds.
% 1.10/1.44
% 1.10/1.44 ============================== PROOF =================================
% 1.10/1.44 % SZS status Unsatisfiable
% 1.10/1.44 % SZS output start Refutation
% 1.10/1.44
% 1.10/1.44 % Proof 1 at 0.37 (+ 0.03) seconds: prove_cn_40.
% 1.10/1.44 % Length of proof is 34.
% 1.10/1.44 % Level of proof is 20.
% 1.10/1.44 % Maximum clause weight is 17.000.
% 1.10/1.44 % Given clauses 202.
% 1.10/1.44
% 1.10/1.44 1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom). [assumption].
% 1.10/1.44 2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom). [assumption].
% 1.10/1.44 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom). [assumption].
% 1.10/1.44 4 -is_a_theorem(implies(a,not(not(a)))) # label(prove_cn_40) # label(negated_conjecture) # answer(prove_cn_40). [assumption].
% 1.10/1.44 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 1.10/1.44 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.10/1.44 7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))). [hyper(5,a,3,a,b,2,a)].
% 1.10/1.44 8 is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))). [hyper(5,a,3,a,b,1,a)].
% 1.10/1.44 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.10/1.44 21 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,6,a,b,7,a)].
% 1.10/1.44 26 is_a_theorem(implies(A,A)). [hyper(5,a,7,a,b,1,a)].
% 1.10/1.44 27 is_a_theorem(implies(not(implies(A,A)),B)). [hyper(5,a,2,a,b,26,a)].
% 1.10/1.44 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.10/1.44 68 is_a_theorem(implies(A,implies(B,implies(not(A),C)))). [hyper(5,a,7,a,b,21,a)].
% 1.10/1.44 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.10/1.44 72 is_a_theorem(implies(A,implies(not(implies(B,B)),C))). [hyper(5,a,21,a,b,27,a)].
% 1.10/1.44 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.10/1.44 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.10/1.44 460 is_a_theorem(implies(A,implies(B,B))). [hyper(5,a,95,a,b,1,a)].
% 1.10/1.44 469 is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,460,a)].
% 1.10/1.44 550 is_a_theorem(implies(A,implies(implies(not(B),B),B))). [hyper(5,a,469,a,b,1,a)].
% 1.10/1.44 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.10/1.44 1506 is_a_theorem(implies(A,implies(B,implies(C,A)))). [hyper(5,a,81,a,b,588,a)].
% 1.10/1.44 1534 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(5,a,588,a,b,1506,a)].
% 1.10/1.44 1622 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(5,a,37,a,b,1534,a)].
% 1.10/1.44 5016 is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))). [hyper(5,a,69,a,b,588,a)].
% 1.10/1.44 5106 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,1622,a,b,5016,a)].
% 1.10/1.44 5143 is_a_theorem(implies(A,implies(not(B),implies(B,C)))). [hyper(5,a,588,a,b,5106,a)].
% 1.10/1.44 5161 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,5143,a,b,5143,a)].
% 1.10/1.44 5207 is_a_theorem(implies(A,implies(not(not(B)),B))). [hyper(5,a,588,a,b,5161,a)].
% 1.10/1.44 5220 is_a_theorem(implies(not(not(A)),A)). [hyper(5,a,5207,a,b,5207,a)].
% 1.10/1.44 5256 is_a_theorem(implies(A,implies(B,not(not(B))))). [hyper(5,a,5016,a,b,5220,a)].
% 1.10/1.44 5313 is_a_theorem(implies(A,not(not(A)))). [hyper(5,a,5256,a,b,5256,a)].
% 1.10/1.44 5314 $F # answer(prove_cn_40). [resolve(5313,a,4,a)].
% 1.10/1.44
% 1.10/1.44 % SZS output end Refutation
% 1.10/1.44 ============================== end of proof ==========================
% 1.10/1.44
% 1.10/1.44 ============================== STATISTICS ============================
% 1.10/1.44
% 1.10/1.44 Given=202. Generated=21327. Kept=5313. proofs=1.
% 1.10/1.44 Usable=191. Sos=4859. Demods=0. Limbo=0, Disabled=267. Hints=0.
% 1.10/1.44 Megabytes=5.37.
% 1.10/1.44 User_CPU=0.37, System_CPU=0.03, Wall_clock=1.
% 1.10/1.44
% 1.10/1.44 ============================== end of statistics =====================
% 1.10/1.44
% 1.10/1.44 ============================== end of search =========================
% 1.10/1.44
% 1.10/1.44 THEOREM PROVED
% 1.10/1.44 % SZS status Unsatisfiable
% 1.10/1.44
% 1.10/1.44 Exiting with 1 proof.
% 1.10/1.44
% 1.10/1.44 Process 16354 exit (max_proofs) Mon Jul 4 11:22:53 2022
% 1.10/1.44 Prover9 interrupted
%------------------------------------------------------------------------------