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