TSTP Solution File: LCL058-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL058-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 5.14s 5.40s
% Output : Refutation 5.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL058-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 19:49:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 5.14/5.40 ============================== Prover9 ===============================
% 5.14/5.40 Prover9 (32) version 2009-11A, November 2009.
% 5.14/5.40 Process 14541 was started by sandbox2 on n029.cluster.edu,
% 5.14/5.40 Sun Jul 3 19:49:26 2022
% 5.14/5.40 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14388_n029.cluster.edu".
% 5.14/5.40 ============================== end of head ===========================
% 5.14/5.40
% 5.14/5.40 ============================== INPUT =================================
% 5.14/5.40
% 5.14/5.40 % Reading from file /tmp/Prover9_14388_n029.cluster.edu
% 5.14/5.40
% 5.14/5.40 set(prolog_style_variables).
% 5.14/5.40 set(auto2).
% 5.14/5.40 % set(auto2) -> set(auto).
% 5.14/5.40 % set(auto) -> set(auto_inference).
% 5.14/5.40 % set(auto) -> set(auto_setup).
% 5.14/5.40 % set(auto_setup) -> set(predicate_elim).
% 5.14/5.40 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.14/5.40 % set(auto) -> set(auto_limits).
% 5.14/5.40 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.14/5.40 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.14/5.40 % set(auto) -> set(auto_denials).
% 5.14/5.40 % set(auto) -> set(auto_process).
% 5.14/5.40 % set(auto2) -> assign(new_constants, 1).
% 5.14/5.40 % set(auto2) -> assign(fold_denial_max, 3).
% 5.14/5.40 % set(auto2) -> assign(max_weight, "200.000").
% 5.14/5.40 % set(auto2) -> assign(max_hours, 1).
% 5.14/5.40 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.14/5.40 % set(auto2) -> assign(max_seconds, 0).
% 5.14/5.40 % set(auto2) -> assign(max_minutes, 5).
% 5.14/5.40 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.14/5.40 % set(auto2) -> set(sort_initial_sos).
% 5.14/5.40 % set(auto2) -> assign(sos_limit, -1).
% 5.14/5.40 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.14/5.40 % set(auto2) -> assign(max_megs, 400).
% 5.14/5.40 % set(auto2) -> assign(stats, some).
% 5.14/5.40 % set(auto2) -> clear(echo_input).
% 5.14/5.40 % set(auto2) -> set(quiet).
% 5.14/5.40 % set(auto2) -> clear(print_initial_clauses).
% 5.14/5.40 % set(auto2) -> clear(print_given).
% 5.14/5.40 assign(lrs_ticks,-1).
% 5.14/5.40 assign(sos_limit,10000).
% 5.14/5.40 assign(order,kbo).
% 5.14/5.40 set(lex_order_vars).
% 5.14/5.40 clear(print_given).
% 5.14/5.40
% 5.14/5.40 % formulas(sos). % not echoed (5 formulas)
% 5.14/5.40
% 5.14/5.40 ============================== end of input ==========================
% 5.14/5.40
% 5.14/5.40 % From the command line: assign(max_seconds, 300).
% 5.14/5.40
% 5.14/5.40 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.14/5.40
% 5.14/5.40 % Formulas that are not ordinary clauses:
% 5.14/5.40
% 5.14/5.40 ============================== end of process non-clausal formulas ===
% 5.14/5.40
% 5.14/5.40 ============================== PROCESS INITIAL CLAUSES ===============
% 5.14/5.40
% 5.14/5.40 ============================== PREDICATE ELIMINATION =================
% 5.14/5.40
% 5.14/5.40 ============================== end predicate elimination =============
% 5.14/5.40
% 5.14/5.40 Auto_denials:
% 5.14/5.40 % copying label prove_cn_46 to answer in negative clause
% 5.14/5.40
% 5.14/5.40 Term ordering decisions:
% 5.14/5.40
% 5.14/5.40 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 5.14/5.40 Function symbol KB weights: a=1. b=1. implies=1. not=0.
% 5.14/5.40
% 5.14/5.40 ============================== end of process initial clauses ========
% 5.14/5.40
% 5.14/5.40 ============================== CLAUSES FOR SEARCH ====================
% 5.14/5.40
% 5.14/5.40 ============================== end of clauses for search =============
% 5.14/5.40
% 5.14/5.40 ============================== SEARCH ================================
% 5.14/5.40
% 5.14/5.40 % Starting search at 0.01 seconds.
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=35.000, iters=3372
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=33.000, iters=3366
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=31.000, iters=3353
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=27.000, iters=3394
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=26.000, iters=3433
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=25.000, iters=3383
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=23.000, iters=3333
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=22.000, iters=3344
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=21.000, iters=3366
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=20.000, iters=3356
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=19.000, iters=3380
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=18.000, iters=3435
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=17.000, iters=3344
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=4352, wt=63.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=1375, wt=59.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=4355, wt=57.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=2941, wt=49.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=4228, wt=47.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=10627, wt=14.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=10634, wt=13.000
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=10741, wt=11.000
% 5.14/5.40
% 5.14/5.40 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 42 (0.00 of 0.96 sec).
% 5.14/5.40
% 5.14/5.40 Low Water (displace): id=14561, wt=10.000
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=16.000, iters=3338
% 5.14/5.40
% 5.14/5.40 Low Water (keep): wt=15.000, iters=3333
% 5.14/5.40
% 5.14/5.40 ============================== PROOF =================================
% 5.14/5.40 % SZS status Unsatisfiable
% 5.14/5.40 % SZS output start Refutation
% 5.14/5.40
% 5.14/5.40 % Proof 1 at 3.91 (+ 0.53) seconds: prove_cn_46.
% 5.14/5.40 % Length of proof is 47.
% 5.14/5.40 % Level of proof is 27.
% 5.14/5.40 % Maximum clause weight is 27.000.
% 5.14/5.40 % Given clauses 1582.
% 5.14/5.40
% 5.14/5.40 1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom). [assumption].
% 5.14/5.40 2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom). [assumption].
% 5.14/5.40 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom). [assumption].
% 5.14/5.40 4 -is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))) # label(prove_cn_46) # label(negated_conjecture) # answer(prove_cn_46). [assumption].
% 5.14/5.40 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 5.14/5.40 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)].
% 5.14/5.40 7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))). [hyper(5,a,3,a,b,2,a)].
% 5.14/5.40 8 is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))). [hyper(5,a,3,a,b,1,a)].
% 5.14/5.40 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)].
% 5.14/5.40 13 is_a_theorem(implies(implies(implies(implies(A,B),C),D),implies(implies(implies(implies(B,E),implies(A,E)),C),D))). [hyper(5,a,3,a,b,6,a)].
% 5.14/5.40 21 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,6,a,b,7,a)].
% 5.14/5.40 26 is_a_theorem(implies(A,A)). [hyper(5,a,7,a,b,1,a)].
% 5.14/5.40 27 is_a_theorem(implies(not(implies(A,A)),B)). [hyper(5,a,2,a,b,26,a)].
% 5.14/5.40 31 is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))). [hyper(5,a,3,a,b,8,a)].
% 5.14/5.40 36 is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))). [hyper(5,a,8,a,b,6,a)].
% 5.14/5.40 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)].
% 5.14/5.40 68 is_a_theorem(implies(A,implies(B,implies(not(A),C)))). [hyper(5,a,7,a,b,21,a)].
% 5.14/5.40 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)].
% 5.14/5.40 72 is_a_theorem(implies(A,implies(not(implies(B,B)),C))). [hyper(5,a,21,a,b,27,a)].
% 5.14/5.40 81 is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))). [hyper(5,a,3,a,b,68,a)].
% 5.14/5.40 95 is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))). [hyper(5,a,3,a,b,72,a)].
% 5.14/5.40 173 is_a_theorem(implies(implies(implies(implies(implies(A,B),C),implies(implies(D,B),C)),E),implies(implies(A,D),E))). [hyper(5,a,13,a,b,6,a)].
% 5.14/5.40 460 is_a_theorem(implies(A,implies(B,B))). [hyper(5,a,95,a,b,1,a)].
% 5.14/5.40 469 is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,460,a)].
% 5.14/5.40 550 is_a_theorem(implies(A,implies(implies(not(B),B),B))). [hyper(5,a,469,a,b,1,a)].
% 5.14/5.40 588 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,550,a)].
% 5.14/5.40 1506 is_a_theorem(implies(A,implies(B,implies(C,A)))). [hyper(5,a,81,a,b,588,a)].
% 5.14/5.40 1534 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(5,a,588,a,b,1506,a)].
% 5.14/5.40 1622 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(5,a,37,a,b,1534,a)].
% 5.14/5.40 5016 is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))). [hyper(5,a,69,a,b,588,a)].
% 5.14/5.40 5106 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,1622,a,b,5016,a)].
% 5.14/5.40 5143 is_a_theorem(implies(A,implies(not(B),implies(B,C)))). [hyper(5,a,588,a,b,5106,a)].
% 5.14/5.40 5187 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))). [hyper(5,a,37,a,b,5143,a)].
% 5.14/5.40 10677 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(5,a,588,a,b,5187,a)].
% 5.14/5.40 10977 is_a_theorem(implies(implies(implies(A,B),A),A)). [hyper(5,a,10677,a,b,10677,a)].
% 5.14/5.40 11005 is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))). [hyper(5,a,36,a,b,10677,a)].
% 5.14/5.40 11122 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))). [hyper(5,a,11005,a,b,588,a)].
% 5.14/5.40 13882 is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))). [hyper(5,a,6,a,b,11122,a)].
% 5.14/5.40 14424 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(5,a,1622,a,b,13882,a)].
% 5.14/5.40 14686 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))). [hyper(5,a,12,a,b,14424,a)].
% 5.14/5.40 14733 is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)). [hyper(5,a,14424,a,b,10977,a)].
% 5.14/5.40 23686 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))). [hyper(5,a,173,a,b,14733,a)].
% 5.14/5.40 25593 is_a_theorem(implies(implies(A,B),implies(implies(implies(B,C),A),B))). [hyper(5,a,14686,a,b,23686,a)].
% 5.14/5.40 28450 is_a_theorem(implies(not(A),implies(implies(implies(B,C),A),B))). [hyper(5,a,5187,a,b,25593,a)].
% 5.14/5.40 28488 is_a_theorem(implies(implies(implies(A,B),C),implies(not(C),A))). [hyper(5,a,14686,a,b,28450,a)].
% 5.14/5.40 28529 is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))). [hyper(5,a,31,a,b,28488,a)].
% 5.14/5.40 28530 $F # answer(prove_cn_46). [resolve(28529,a,4,a)].
% 5.14/5.40
% 5.14/5.40 % SZS output end Refutation
% 5.14/5.40 ============================== end of proof ==========================
% 5.14/5.40
% 5.14/5.40 ============================== STATISTICS ============================
% 5.14/5.40
% 5.14/5.40 Given=1582. Generated=1014984. Kept=28529. proofs=1.
% 5.14/5.40 Usable=1571. Sos=9998. Demods=0. Limbo=13, Disabled=16951. Hints=0.
% 5.14/5.40 Megabytes=16.63.
% 5.14/5.40 User_CPU=3.91, System_CPU=0.53, Wall_clock=5.
% 5.14/5.40
% 5.14/5.40 ============================== end of statistics =====================
% 5.14/5.40
% 5.14/5.40 ============================== end of search =========================
% 5.14/5.40
% 5.14/5.40 THEOREM PROVED
% 5.14/5.40 % SZS status Unsatisfiable
% 5.14/5.40
% 5.14/5.40 Exiting with 1 proof.
% 5.14/5.40
% 5.14/5.40 Process 14541 exit (max_proofs) Sun Jul 3 19:49:31 2022
% 5.14/5.40 Prover9 interrupted
%------------------------------------------------------------------------------