TSTP Solution File: LCL060-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL060-10 : TPTP v8.1.0. Released v7.3.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:42 EDT 2022
% Result : Unsatisfiable 232.25s 232.55s
% Output : Refutation 232.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL060-10 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n029.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 : Sun Jul 3 03:04:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 4.49/4.80 ============================== Prover9 ===============================
% 4.49/4.80 Prover9 (32) version 2009-11A, November 2009.
% 4.49/4.80 Process 13847 was started by sandbox on n029.cluster.edu,
% 4.49/4.80 Sun Jul 3 03:04:26 2022
% 4.49/4.80 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13694_n029.cluster.edu".
% 4.49/4.80 ============================== end of head ===========================
% 4.49/4.80
% 4.49/4.80 ============================== INPUT =================================
% 4.49/4.80
% 4.49/4.80 % Reading from file /tmp/Prover9_13694_n029.cluster.edu
% 4.49/4.80
% 4.49/4.80 set(prolog_style_variables).
% 4.49/4.80 set(auto2).
% 4.49/4.80 % set(auto2) -> set(auto).
% 4.49/4.80 % set(auto) -> set(auto_inference).
% 4.49/4.80 % set(auto) -> set(auto_setup).
% 4.49/4.80 % set(auto_setup) -> set(predicate_elim).
% 4.49/4.80 % set(auto_setup) -> assign(eq_defs, unfold).
% 4.49/4.80 % set(auto) -> set(auto_limits).
% 4.49/4.80 % set(auto_limits) -> assign(max_weight, "100.000").
% 4.49/4.80 % set(auto_limits) -> assign(sos_limit, 20000).
% 4.49/4.80 % set(auto) -> set(auto_denials).
% 4.49/4.80 % set(auto) -> set(auto_process).
% 4.49/4.80 % set(auto2) -> assign(new_constants, 1).
% 4.49/4.80 % set(auto2) -> assign(fold_denial_max, 3).
% 4.49/4.80 % set(auto2) -> assign(max_weight, "200.000").
% 4.49/4.80 % set(auto2) -> assign(max_hours, 1).
% 4.49/4.80 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 4.49/4.80 % set(auto2) -> assign(max_seconds, 0).
% 4.49/4.80 % set(auto2) -> assign(max_minutes, 5).
% 4.49/4.80 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 4.49/4.80 % set(auto2) -> set(sort_initial_sos).
% 4.49/4.80 % set(auto2) -> assign(sos_limit, -1).
% 4.49/4.80 % set(auto2) -> assign(lrs_ticks, 3000).
% 4.49/4.80 % set(auto2) -> assign(max_megs, 400).
% 4.49/4.80 % set(auto2) -> assign(stats, some).
% 4.49/4.80 % set(auto2) -> clear(echo_input).
% 4.49/4.80 % set(auto2) -> set(quiet).
% 4.49/4.80 % set(auto2) -> clear(print_initial_clauses).
% 4.49/4.80 % set(auto2) -> clear(print_given).
% 4.49/4.80 assign(lrs_ticks,-1).
% 4.49/4.80 assign(sos_limit,10000).
% 4.49/4.80 assign(order,kbo).
% 4.49/4.80 set(lex_order_vars).
% 4.49/4.80 clear(print_given).
% 4.49/4.80
% 4.49/4.80 % formulas(sos). % not echoed (6 formulas)
% 4.49/4.80
% 4.49/4.80 ============================== end of input ==========================
% 4.49/4.80
% 4.49/4.80 % From the command line: assign(max_seconds, 300).
% 4.49/4.80
% 4.49/4.80 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 4.49/4.80
% 4.49/4.80 % Formulas that are not ordinary clauses:
% 4.49/4.80
% 4.49/4.80 ============================== end of process non-clausal formulas ===
% 4.49/4.80
% 4.49/4.80 ============================== PROCESS INITIAL CLAUSES ===============
% 4.49/4.80
% 4.49/4.80 ============================== PREDICATE ELIMINATION =================
% 4.49/4.80
% 4.49/4.80 ============================== end predicate elimination =============
% 4.49/4.80
% 4.49/4.80 Auto_denials:
% 4.49/4.80 % copying label prove_cn_54 to answer in negative clause
% 4.49/4.80
% 4.49/4.80 Term ordering decisions:
% 4.49/4.80 Function symbol KB weights: true=1. a=1. b=1. implies=1. is_a_theorem=1. not=1. ifeq=1.
% 4.49/4.80
% 4.49/4.80 ============================== end of process initial clauses ========
% 4.49/4.80
% 4.49/4.80 ============================== CLAUSES FOR SEARCH ====================
% 4.49/4.80
% 4.49/4.80 ============================== end of clauses for search =============
% 4.49/4.80
% 4.49/4.80 ============================== SEARCH ================================
% 4.49/4.80
% 4.49/4.80 % Starting search at 0.01 seconds.
% 4.49/4.80
% 4.49/4.80 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 40 (0.00 of 0.96 sec).
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=41.000, iters=3333
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=40.000, iters=3344
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=39.000, iters=3575
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=33.000, iters=3366
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=32.000, iters=3386
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=31.000, iters=3390
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=30.000, iters=3365
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=29.000, iters=3341
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=28.000, iters=3355
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=27.000, iters=3361
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=26.000, iters=3333
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=25.000, iters=3355
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=24.000, iters=3343
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=23.000, iters=3340
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=4887, wt=69.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=2576, wt=65.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=4885, wt=63.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=3654, wt=61.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=11243, wt=19.000
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=22.000, iters=3338
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=11427, wt=18.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=11454, wt=17.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=11678, wt=16.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=16118, wt=15.000
% 4.49/4.80
% 4.49/4.80 Low Water (displace): id=16133, wt=14.000
% 4.49/4.80
% 4.49/4.80 Low Water (keep): wt=21.000, iters=3543
% 232.25/232.55
% 232.25/232.55 Low Water (keep): wt=20.000, iters=3346
% 232.25/232.55
% 232.25/232.55 Low Water (keep): wt=19.000, iters=3347
% 232.25/232.55
% 232.25/232.55 Low Water (keep): wt=18.000, iters=3336
% 232.25/232.55
% 232.25/232.55 Low Water (keep): wt=17.000, iters=3338
% 232.25/232.55
% 232.25/232.55 ============================== PROOF =================================
% 232.25/232.55 % SZS status Unsatisfiable
% 232.25/232.55 % SZS output start Refutation
% 232.25/232.55
% 232.25/232.55 % Proof 1 at 219.16 (+ 12.32) seconds: prove_cn_54.
% 232.25/232.55 % Length of proof is 62.
% 232.25/232.55 % Level of proof is 33.
% 232.25/232.55 % Maximum clause weight is 22.000.
% 232.25/232.55 % Given clauses 12021.
% 232.25/232.55
% 232.25/232.55 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 232.25/232.55 2 is_a_theorem(implies(implies(not(A),A),A)) = true # label(cn_2) # label(axiom). [assumption].
% 232.25/232.55 3 is_a_theorem(implies(A,implies(not(A),B))) = true # label(cn_3) # label(axiom). [assumption].
% 232.25/232.55 4 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) = true # label(cn_1) # label(axiom). [assumption].
% 232.25/232.55 5 ifeq(is_a_theorem(implies(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true) = true # label(condensed_detachment) # label(axiom). [assumption].
% 232.25/232.55 6 is_a_theorem(implies(implies(a,b),implies(implies(not(a),b),b))) != true # label(prove_cn_54) # label(negated_conjecture) # answer(prove_cn_54). [assumption].
% 232.25/232.55 8 ifeq(is_a_theorem(implies(implies(implies(not(A),A),A),B)),true,is_a_theorem(B),true) = true. [para(2(a,1),5(a,1,3,1)),rewrite([1(11)])].
% 232.25/232.55 10 ifeq(is_a_theorem(A),true,is_a_theorem(implies(not(A),B)),true) = true. [para(3(a,1),5(a,1,1)),rewrite([1(11)])].
% 232.25/232.55 11 ifeq(is_a_theorem(implies(implies(A,implies(not(A),B)),C)),true,is_a_theorem(C),true) = true. [para(3(a,1),5(a,1,3,1)),rewrite([1(11)])].
% 232.25/232.55 13 ifeq(is_a_theorem(implies(A,B)),true,is_a_theorem(implies(implies(B,C),implies(A,C))),true) = true. [para(4(a,1),5(a,1,1)),rewrite([1(13)])].
% 232.25/232.55 29 is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))) = true. [para(4(a,1),8(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 31 ifeq(is_a_theorem(implies(implies(implies(A,B),implies(implies(not(A),A),B)),C)),true,is_a_theorem(C),true) = true. [para(29(a,1),5(a,1,3,1)),rewrite([1(13)])].
% 232.25/232.55 37 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))) = true. [para(4(a,1),11(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 42 ifeq(is_a_theorem(implies(implies(not(A),B),C)),true,is_a_theorem(implies(A,C)),true) = true. [para(37(a,1),5(a,1,1)),rewrite([1(13)])].
% 232.25/232.55 43 ifeq(is_a_theorem(implies(implies(implies(implies(not(A),B),C),implies(A,C)),D)),true,is_a_theorem(D),true) = true. [para(37(a,1),5(a,1,3,1)),rewrite([1(13)])].
% 232.25/232.55 45 is_a_theorem(implies(A,A)) = true. [para(37(a,1),8(a,1,1)),rewrite([1(6)])].
% 232.25/232.55 49 is_a_theorem(implies(not(implies(A,A)),B)) = true. [para(45(a,1),10(a,1,1)),rewrite([1(8)])].
% 232.25/232.55 50 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))) = true. [para(4(a,1),13(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 60 is_a_theorem(implies(implies(A,B),implies(not(implies(C,C)),B))) = true. [para(49(a,1),13(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 149 is_a_theorem(implies(A,implies(not(implies(B,B)),C))) = true. [para(60(a,1),42(a,1,1)),rewrite([1(9)])].
% 232.25/232.55 153 is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))) = true. [para(149(a,1),13(a,1,1)),rewrite([1(11)])].
% 232.25/232.55 177 is_a_theorem(implies(A,implies(B,B))) = true. [para(153(a,1),8(a,1,1)),rewrite([1(7)])].
% 232.25/232.55 186 is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))) = true. [para(177(a,1),13(a,1,1)),rewrite([1(9)])].
% 232.25/232.55 199 is_a_theorem(implies(A,implies(implies(not(B),B),B))) = true. [para(186(a,1),31(a,1,1)),rewrite([1(9)])].
% 232.25/232.55 205 is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))) = true. [para(199(a,1),13(a,1,1)),rewrite([1(11)])].
% 232.25/232.55 290 ifeq(is_a_theorem(implies(implies(implies(implies(implies(not(A),A),A),B),implies(C,B)),D)),true,is_a_theorem(D),true) = true. [para(205(a,1),5(a,1,3,1)),rewrite([1(14)])].
% 232.25/232.55 293 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(implies(not(D),D),D),B),C))) = true. [para(205(a,1),13(a,1,1)),rewrite([1(13)])].
% 232.25/232.55 299 ifeq(is_a_theorem(implies(implies(implies(A,B),implies(C,B)),D)),true,is_a_theorem(implies(implies(C,A),D)),true) = true. [para(50(a,1),5(a,1,1)),rewrite([1(15)])].
% 232.25/232.55 309 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))) = true. [para(50(a,1),43(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 321 is_a_theorem(implies(A,implies(B,implies(not(A),C)))) = true. [para(309(a,1),42(a,1,1)),rewrite([1(9)])].
% 232.25/232.55 326 is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))) = true. [para(321(a,1),13(a,1,1)),rewrite([1(11)])].
% 232.25/232.55 475 ifeq(is_a_theorem(implies(implies(A,implies(not(B),C)),D)),true,is_a_theorem(implies(B,D)),true) = true. [para(326(a,1),5(a,1,1)),rewrite([1(14)])].
% 232.25/232.55 7560 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))) = true. [para(50(a,1),290(a,1,1)),rewrite([1(11)])].
% 232.25/232.55 7589 is_a_theorem(implies(A,implies(B,implies(C,A)))) = true. [para(7560(a,1),475(a,1,1)),rewrite([1(8)])].
% 232.25/232.55 7597 is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(C,D))) = true. [para(7589(a,1),13(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 7883 is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),B)) = true. [para(293(a,1),8(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 7945 is_a_theorem(implies(A,implies(B,A))) = true. [para(7597(a,1),8(a,1,1)),rewrite([1(7)])].
% 232.25/232.55 7974 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))) = true. [para(7945(a,1),13(a,1,1)),rewrite([1(9)])].
% 232.25/232.55 8043 ifeq(is_a_theorem(implies(implies(A,B),C)),true,is_a_theorem(implies(B,C)),true) = true. [para(7974(a,1),5(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 8125 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))) = true. [para(7883(a,1),299(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 8259 is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))) = true. [para(8125(a,1),299(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 8262 ifeq(is_a_theorem(implies(implies(implies(not(A),B),implies(implies(B,A),A)),C)),true,is_a_theorem(C),true) = true. [para(8259(a,1),5(a,1,3,1)),rewrite([1(13)])].
% 232.25/232.55 9381 is_a_theorem(implies(A,implies(implies(A,B),B))) = true. [para(8259(a,1),8043(a,1,1)),rewrite([1(8)])].
% 232.25/232.55 9391 is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))) = true. [para(9381(a,1),13(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 10242 ifeq(is_a_theorem(implies(implies(implies(A,B),B),C)),true,is_a_theorem(implies(A,C)),true) = true. [para(9391(a,1),5(a,1,1)),rewrite([1(13)])].
% 232.25/232.55 10250 is_a_theorem(implies(not(A),implies(A,B))) = true. [para(9391(a,1),43(a,1,1)),rewrite([1(8)])].
% 232.25/232.55 10264 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))) = true. [para(9391(a,1),299(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 10273 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))) = true. [para(10250(a,1),13(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 10505 ifeq(is_a_theorem(implies(implies(A,B),C)),true,is_a_theorem(implies(not(A),C)),true) = true. [para(10273(a,1),5(a,1,1)),rewrite([1(13)])].
% 232.25/232.55 10508 is_a_theorem(implies(not(not(A)),A)) = true. [para(10273(a,1),8(a,1,1)),rewrite([1(8)])].
% 232.25/232.55 10541 ifeq(is_a_theorem(implies(implies(not(not(A)),A),B)),true,is_a_theorem(B),true) = true. [para(10508(a,1),5(a,1,3,1)),rewrite([1(11)])].
% 232.25/232.55 35310 is_a_theorem(implies(implies(A,B),implies(implies(not(B),A),B))) = true. [para(10264(a,1),8262(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 35345 is_a_theorem(implies(not(A),implies(implies(not(B),A),B))) = true. [para(35310(a,1),10505(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 35373 is_a_theorem(implies(implies(implies(implies(not(A),B),A),C),implies(not(B),C))) = true. [para(35345(a,1),13(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 36436 is_a_theorem(implies(implies(A,implies(not(B),C)),implies(not(C),implies(A,B)))) = true. [para(35373(a,1),299(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 37104 is_a_theorem(implies(implies(not(A),B),implies(not(C),implies(implies(B,C),A)))) = true. [para(36436(a,1),299(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 37513 is_a_theorem(implies(not(A),implies(implies(B,A),not(B)))) = true. [para(37104(a,1),10541(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 37522 is_a_theorem(implies(implies(implies(implies(A,B),not(A)),C),implies(not(B),C))) = true. [para(37513(a,1),13(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 38247 is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))) = true. [para(37522(a,1),10242(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 38319 is_a_theorem(implies(implies(implies(not(A),not(B)),C),implies(implies(B,A),C))) = true. [para(38247(a,1),13(a,1,1)),rewrite([1(12)])].
% 232.25/232.55 39523 is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))) = true. [para(38319(a,1),8262(a,1,1)),rewrite([1(10)])].
% 232.25/232.55 39524 $F # answer(prove_cn_54). [resolve(39523,a,6,a)].
% 232.25/232.55
% 232.25/232.55 % SZS output end Refutation
% 232.25/232.55 ============================== end of proof ==========================
% 232.25/232.55
% 232.25/232.55 ============================== STATISTICS ============================
% 232.25/232.55
% 232.25/232.55 Given=12021. Generated=23480711. Kept=39523. proofs=1.
% 232.25/232.55 Usable=11842. Sos=8613. Demods=20458. Limbo=4, Disabled=19069. Hints=0.
% 232.25/232.55 Megabytes=31.20.
% 232.25/232.55 User_CPU=219.17, System_CPU=12.32, Wall_clock=231.
% 232.25/232.55
% 232.25/232.55 ============================== end of statistics =====================
% 232.25/232.55
% 232.25/232.55 ============================== end of search =========================
% 232.25/232.55
% 232.25/232.55 THEOREM PROVED
% 232.25/232.55 % SZS status Unsatisfiable
% 232.25/232.55
% 232.25/232.55 Exiting with 1 proof.
% 232.25/232.55
% 232.25/232.55 Process 13847 exit (max_proofs) Sun Jul 3 03:08:17 2022
% 232.25/232.55 Prover9 interrupted
%------------------------------------------------------------------------------