TSTP Solution File: LCL071-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:46 EDT 2022
% Result : Unsatisfiable 3.65s 3.94s
% Output : Refutation 3.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 15:34:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.24/2.50 ============================== Prover9 ===============================
% 2.24/2.50 Prover9 (32) version 2009-11A, November 2009.
% 2.24/2.50 Process 10657 was started by sandbox on n028.cluster.edu,
% 2.24/2.50 Sat Jul 2 15:34:33 2022
% 2.24/2.50 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10504_n028.cluster.edu".
% 2.24/2.50 ============================== end of head ===========================
% 2.24/2.50
% 2.24/2.50 ============================== INPUT =================================
% 2.24/2.50
% 2.24/2.50 % Reading from file /tmp/Prover9_10504_n028.cluster.edu
% 2.24/2.50
% 2.24/2.50 set(prolog_style_variables).
% 2.24/2.50 set(auto2).
% 2.24/2.50 % set(auto2) -> set(auto).
% 2.24/2.50 % set(auto) -> set(auto_inference).
% 2.24/2.50 % set(auto) -> set(auto_setup).
% 2.24/2.50 % set(auto_setup) -> set(predicate_elim).
% 2.24/2.50 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.24/2.50 % set(auto) -> set(auto_limits).
% 2.24/2.50 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.24/2.50 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.24/2.50 % set(auto) -> set(auto_denials).
% 2.24/2.50 % set(auto) -> set(auto_process).
% 2.24/2.50 % set(auto2) -> assign(new_constants, 1).
% 2.24/2.50 % set(auto2) -> assign(fold_denial_max, 3).
% 2.24/2.50 % set(auto2) -> assign(max_weight, "200.000").
% 2.24/2.50 % set(auto2) -> assign(max_hours, 1).
% 2.24/2.50 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.24/2.50 % set(auto2) -> assign(max_seconds, 0).
% 2.24/2.50 % set(auto2) -> assign(max_minutes, 5).
% 2.24/2.50 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.24/2.50 % set(auto2) -> set(sort_initial_sos).
% 2.24/2.50 % set(auto2) -> assign(sos_limit, -1).
% 2.24/2.50 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.24/2.50 % set(auto2) -> assign(max_megs, 400).
% 2.24/2.50 % set(auto2) -> assign(stats, some).
% 2.24/2.50 % set(auto2) -> clear(echo_input).
% 2.24/2.50 % set(auto2) -> set(quiet).
% 2.24/2.50 % set(auto2) -> clear(print_initial_clauses).
% 2.24/2.50 % set(auto2) -> clear(print_given).
% 2.24/2.50 assign(lrs_ticks,-1).
% 2.24/2.50 assign(sos_limit,10000).
% 2.24/2.50 assign(order,kbo).
% 2.24/2.50 set(lex_order_vars).
% 2.24/2.50 clear(print_given).
% 2.24/2.50
% 2.24/2.50 % formulas(sos). % not echoed (5 formulas)
% 2.24/2.50
% 2.24/2.50 ============================== end of input ==========================
% 2.24/2.50
% 2.24/2.50 % From the command line: assign(max_seconds, 300).
% 2.24/2.50
% 2.24/2.50 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.24/2.50
% 2.24/2.50 % Formulas that are not ordinary clauses:
% 2.24/2.50
% 2.24/2.50 ============================== end of process non-clausal formulas ===
% 2.24/2.50
% 2.24/2.50 ============================== PROCESS INITIAL CLAUSES ===============
% 2.24/2.50
% 2.24/2.50 ============================== PREDICATE ELIMINATION =================
% 2.24/2.50
% 2.24/2.50 ============================== end predicate elimination =============
% 2.24/2.50
% 2.24/2.50 Auto_denials:
% 2.24/2.50 % copying label prove_cn_2 to answer in negative clause
% 2.24/2.50
% 2.24/2.50 Term ordering decisions:
% 2.24/2.50
% 2.24/2.50 % Assigning unary symbol not kb_weight 0 and highest precedence (4).
% 2.24/2.50 Function symbol KB weights: a=1. implies=1. not=0.
% 2.24/2.50
% 2.24/2.50 ============================== end of process initial clauses ========
% 2.24/2.50
% 2.24/2.50 ============================== CLAUSES FOR SEARCH ====================
% 2.24/2.50
% 2.24/2.50 ============================== end of clauses for search =============
% 2.24/2.50
% 2.24/2.50 ============================== SEARCH ================================
% 2.24/2.50
% 2.24/2.50 % Starting search at 0.01 seconds.
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=44.000, iters=3350
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=43.000, iters=3333
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=42.000, iters=3354
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=38.000, iters=3438
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=36.000, iters=3405
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=34.000, iters=3355
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=32.000, iters=3385
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=31.000, iters=3455
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=29.000, iters=3353
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=28.000, iters=3453
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=27.000, iters=3376
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=26.000, iters=3435
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=25.000, iters=3335
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=24.000, iters=3366
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=23.000, iters=3366
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=22.000, iters=3477
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=21.000, iters=3348
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=20.000, iters=3345
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=19.000, iters=3343
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=18.000, iters=3334
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=17.000, iters=3384
% 2.24/2.50
% 2.24/2.50 Low Water (displace): id=10764, wt=15.000
% 2.24/2.50
% 2.24/2.50 Low Water (displace): id=10767, wt=14.000
% 2.24/2.50
% 2.24/2.50 Low Water (displace): id=10835, wt=13.000
% 2.24/2.50
% 2.24/2.50 Low Water (displace): id=10848, wt=12.000
% 2.24/2.50
% 2.24/2.50 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 31 (0.00 of 0.87 sec).
% 2.24/2.50
% 2.24/2.50 Low Water (keep): wt=16.000, iters=3336
% 3.65/3.94
% 3.65/3.94 ============================== PROOF =================================
% 3.65/3.94 % SZS status Unsatisfiable
% 3.65/3.94 % SZS output start Refutation
% 3.65/3.94
% 3.65/3.94 % Proof 1 at 2.62 (+ 0.36) seconds: prove_cn_2.
% 3.65/3.94 % Length of proof is 54.
% 3.65/3.94 % Level of proof is 22.
% 3.65/3.94 % Maximum clause weight is 19.000.
% 3.65/3.94 % Given clauses 1164.
% 3.65/3.94
% 3.65/3.94 1 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))) # label(cn_19) # label(axiom). [assumption].
% 3.65/3.94 2 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))) # label(cn_37) # label(axiom). [assumption].
% 3.65/3.94 3 is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))) # label(cn_60) # label(axiom). [assumption].
% 3.65/3.94 4 -is_a_theorem(implies(implies(not(a),a),a)) # label(prove_cn_2) # label(negated_conjecture) # answer(prove_cn_2). [assumption].
% 3.65/3.94 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 3.65/3.94 7 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(D,C),implies(implies(A,D),C)))). [hyper(5,a,3,a,b,2,a)].
% 3.65/3.95 8 is_a_theorem(implies(implies(implies(A,not(B)),C),implies(implies(D,C),implies(implies(B,D),C)))). [hyper(5,a,3,a,b,1,a)].
% 3.65/3.95 12 is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(D,B),implies(implies(A,D),B))))). [hyper(5,a,1,a,b,3,a)].
% 3.65/3.95 14 is_a_theorem(implies(A,implies(B,A))). [hyper(5,a,1,a,b,1,a)].
% 3.65/3.95 20 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,2,a,b,14,a)].
% 3.65/3.95 21 is_a_theorem(implies(A,implies(B,implies(C,A)))). [hyper(5,a,1,a,b,14,a)].
% 3.65/3.95 34 is_a_theorem(implies(A,implies(B,implies(C,implies(D,A))))). [hyper(5,a,1,a,b,21,a)].
% 3.65/3.95 47 is_a_theorem(implies(not(implies(A,B)),implies(implies(C,D),implies(implies(A,C),D)))). [hyper(5,a,2,a,b,7,a)].
% 3.65/3.95 49 is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))). [hyper(5,a,7,a,b,14,a)].
% 3.65/3.95 53 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(implies(D,B),A),implies(B,C)))). [hyper(5,a,7,a,b,1,a)].
% 3.65/3.95 67 is_a_theorem(implies(implies(A,implies(B,not(C))),implies(implies(C,A),implies(B,not(C))))). [hyper(5,a,8,a,b,1,a)].
% 3.65/3.95 254 is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))). [hyper(5,a,53,a,b,20,a)].
% 3.65/3.95 266 is_a_theorem(implies(implies(implies(A,B),implies(implies(C,B),D)),implies(B,D))). [hyper(5,a,53,a,b,1,a)].
% 3.65/3.95 345 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,266,a,b,254,a)].
% 3.65/3.95 348 is_a_theorem(implies(A,A)). [hyper(5,a,266,a,b,1,a)].
% 3.65/3.95 356 is_a_theorem(implies(A,implies(implies(B,not(C)),implies(implies(C,B),not(C))))). [hyper(5,a,12,a,b,348,a)].
% 3.65/3.95 357 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(B,A),implies(B,C)))). [hyper(5,a,7,a,b,348,a)].
% 3.65/3.95 481 is_a_theorem(implies(implies(A,not(B)),implies(implies(B,A),not(B)))). [hyper(5,a,356,a,b,356,a)].
% 3.65/3.95 591 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,49,a,b,345,a)].
% 3.65/3.95 610 is_a_theorem(implies(implies(A,B),implies(C,implies(A,implies(D,B))))). [hyper(5,a,49,a,b,34,a)].
% 3.65/3.95 613 is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))). [hyper(5,a,49,a,b,14,a)].
% 3.65/3.95 634 is_a_theorem(implies(A,implies(not(A),B))). [hyper(5,a,591,a,b,348,a)].
% 3.65/3.95 676 is_a_theorem(implies(not(implies(A,A)),B)). [hyper(5,a,634,a,b,348,a)].
% 3.65/3.95 751 is_a_theorem(implies(implies(A,not(implies(B,B))),not(A))). [hyper(5,a,481,a,b,676,a)].
% 3.65/3.95 1209 is_a_theorem(not(implies(implies(A,A),not(implies(B,B))))). [hyper(5,a,751,a,b,751,a)].
% 3.65/3.95 1352 is_a_theorem(implies(implies(A,B),implies(implies(implies(C,C),A),B))). [hyper(5,a,47,a,b,1209,a)].
% 3.65/3.95 1547 is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))). [hyper(5,a,67,a,b,634,a)].
% 3.65/3.95 1557 is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))). [hyper(5,a,67,a,b,345,a)].
% 3.65/3.95 1581 is_a_theorem(implies(not(not(A)),not(implies(A,not(implies(B,B)))))). [hyper(5,a,1547,a,b,751,a)].
% 3.65/3.95 1627 is_a_theorem(implies(not(implies(A,B)),not(B))). [hyper(5,a,1547,a,b,14,a)].
% 3.65/3.95 1637 is_a_theorem(implies(not(not(A)),not(not(implies(B,A))))). [hyper(5,a,1547,a,b,1627,a)].
% 3.65/3.95 1698 is_a_theorem(implies(A,not(not(A)))). [hyper(5,a,1557,a,b,348,a)].
% 3.65/3.95 1705 is_a_theorem(implies(implies(not(A),A),not(not(A)))). [hyper(5,a,481,a,b,1698,a)].
% 3.65/3.95 3335 is_a_theorem(implies(not(implies(A,B)),implies(not(not(B)),C))). [hyper(5,a,591,a,b,1637,a)].
% 3.65/3.95 9784 is_a_theorem(not(not(implies(not(not(A)),A)))). [hyper(5,a,1705,a,b,3335,a)].
% 3.65/3.95 10900 is_a_theorem(implies(A,implies(implies(B,C),implies(B,implies(D,C))))). [hyper(5,a,613,a,b,610,a)].
% 3.65/3.95 11537 is_a_theorem(implies(implies(implies(A,A),B),B)). [hyper(5,a,1352,a,b,348,a)].
% 3.65/3.95 12732 is_a_theorem(not(implies(implies(not(not(A)),A),not(implies(B,B))))). [hyper(5,a,1581,a,b,9784,a)].
% 3.65/3.95 15497 is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))). [hyper(5,a,11537,a,b,10900,a)].
% 3.65/3.95 15517 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))). [hyper(5,a,49,a,b,15497,a)].
% 3.65/3.95 17075 is_a_theorem(implies(A,implies(implies(B,implies(A,C)),implies(B,C)))). [hyper(5,a,15517,a,b,15517,a)].
% 3.65/3.95 19122 is_a_theorem(implies(implies(A,implies(implies(B,B),C)),implies(A,C))). [hyper(5,a,11537,a,b,17075,a)].
% 3.65/3.95 21063 is_a_theorem(implies(not(implies(A,B)),implies(implies(A,C),C))). [hyper(5,a,19122,a,b,47,a)].
% 3.65/3.95 21068 is_a_theorem(implies(not(implies(A,B)),A)). [hyper(5,a,19122,a,b,21063,a)].
% 3.65/3.95 21157 is_a_theorem(implies(not(not(A)),A)). [hyper(5,a,21068,a,b,12732,a)].
% 3.65/3.95 21180 is_a_theorem(implies(not(not(A)),implies(B,A))). [hyper(5,a,15497,a,b,21157,a)].
% 3.65/3.95 21260 is_a_theorem(implies(implies(A,not(not(B))),implies(A,B))). [hyper(5,a,357,a,b,21180,a)].
% 3.65/3.95 21939 is_a_theorem(implies(implies(not(A),A),A)). [hyper(5,a,21260,a,b,1705,a)].
% 3.65/3.95 21940 $F # answer(prove_cn_2). [resolve(21939,a,4,a)].
% 3.65/3.95
% 3.65/3.95 % SZS output end Refutation
% 3.65/3.95 ============================== end of proof ==========================
% 3.65/3.95
% 3.65/3.95 ============================== STATISTICS ============================
% 3.65/3.95
% 3.65/3.95 Given=1164. Generated=694105. Kept=21939. proofs=1.
% 3.65/3.95 Usable=1156. Sos=9999. Demods=0. Limbo=122, Disabled=10666. Hints=0.
% 3.65/3.95 Megabytes=14.52.
% 3.65/3.95 User_CPU=2.62, System_CPU=0.36, Wall_clock=3.
% 3.65/3.95
% 3.65/3.95 ============================== end of statistics =====================
% 3.65/3.95
% 3.65/3.95 ============================== end of search =========================
% 3.65/3.95
% 3.65/3.95 THEOREM PROVED
% 3.65/3.95 % SZS status Unsatisfiable
% 3.65/3.95
% 3.65/3.95 Exiting with 1 proof.
% 3.65/3.95
% 3.65/3.95 Process 10657 exit (max_proofs) Sat Jul 2 15:34:36 2022
% 3.65/3.95 Prover9 interrupted
%------------------------------------------------------------------------------