TSTP Solution File: LCL385-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL385-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:17 EDT 2022
% Result : Unsatisfiable 15.67s 15.95s
% Output : Refutation 15.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL385-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 2 13:41:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.02/4.28 ============================== Prover9 ===============================
% 4.02/4.28 Prover9 (32) version 2009-11A, November 2009.
% 4.02/4.28 Process 14504 was started by sandbox on n003.cluster.edu,
% 4.02/4.28 Sat Jul 2 13:41:54 2022
% 4.02/4.28 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14350_n003.cluster.edu".
% 4.02/4.28 ============================== end of head ===========================
% 4.02/4.28
% 4.02/4.28 ============================== INPUT =================================
% 4.02/4.28
% 4.02/4.28 % Reading from file /tmp/Prover9_14350_n003.cluster.edu
% 4.02/4.28
% 4.02/4.28 set(prolog_style_variables).
% 4.02/4.28 set(auto2).
% 4.02/4.28 % set(auto2) -> set(auto).
% 4.02/4.28 % set(auto) -> set(auto_inference).
% 4.02/4.28 % set(auto) -> set(auto_setup).
% 4.02/4.28 % set(auto_setup) -> set(predicate_elim).
% 4.02/4.28 % set(auto_setup) -> assign(eq_defs, unfold).
% 4.02/4.28 % set(auto) -> set(auto_limits).
% 4.02/4.28 % set(auto_limits) -> assign(max_weight, "100.000").
% 4.02/4.28 % set(auto_limits) -> assign(sos_limit, 20000).
% 4.02/4.28 % set(auto) -> set(auto_denials).
% 4.02/4.28 % set(auto) -> set(auto_process).
% 4.02/4.28 % set(auto2) -> assign(new_constants, 1).
% 4.02/4.28 % set(auto2) -> assign(fold_denial_max, 3).
% 4.02/4.28 % set(auto2) -> assign(max_weight, "200.000").
% 4.02/4.28 % set(auto2) -> assign(max_hours, 1).
% 4.02/4.28 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 4.02/4.28 % set(auto2) -> assign(max_seconds, 0).
% 4.02/4.28 % set(auto2) -> assign(max_minutes, 5).
% 4.02/4.28 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 4.02/4.28 % set(auto2) -> set(sort_initial_sos).
% 4.02/4.28 % set(auto2) -> assign(sos_limit, -1).
% 4.02/4.28 % set(auto2) -> assign(lrs_ticks, 3000).
% 4.02/4.28 % set(auto2) -> assign(max_megs, 400).
% 4.02/4.28 % set(auto2) -> assign(stats, some).
% 4.02/4.28 % set(auto2) -> clear(echo_input).
% 4.02/4.28 % set(auto2) -> set(quiet).
% 4.02/4.28 % set(auto2) -> clear(print_initial_clauses).
% 4.02/4.28 % set(auto2) -> clear(print_given).
% 4.02/4.28 assign(lrs_ticks,-1).
% 4.02/4.28 assign(sos_limit,10000).
% 4.02/4.28 assign(order,kbo).
% 4.02/4.28 set(lex_order_vars).
% 4.02/4.28 clear(print_given).
% 4.02/4.28
% 4.02/4.28 % formulas(sos). % not echoed (6 formulas)
% 4.02/4.28
% 4.02/4.28 ============================== end of input ==========================
% 4.02/4.28
% 4.02/4.28 % From the command line: assign(max_seconds, 300).
% 4.02/4.28
% 4.02/4.28 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 4.02/4.28
% 4.02/4.28 % Formulas that are not ordinary clauses:
% 4.02/4.28
% 4.02/4.28 ============================== end of process non-clausal formulas ===
% 4.02/4.28
% 4.02/4.28 ============================== PROCESS INITIAL CLAUSES ===============
% 4.02/4.28
% 4.02/4.28 ============================== PREDICATE ELIMINATION =================
% 4.02/4.28
% 4.02/4.28 ============================== end predicate elimination =============
% 4.02/4.28
% 4.02/4.28 Auto_denials:
% 4.02/4.28 % copying label prove_cn_47 to answer in negative clause
% 4.02/4.28
% 4.02/4.28 Term ordering decisions:
% 4.02/4.28 Function symbol KB weights: true=1. x=1. y=1. implies=1. is_a_theorem=1. not=1. ifeq=1.
% 4.02/4.28
% 4.02/4.28 ============================== end of process initial clauses ========
% 4.02/4.28
% 4.02/4.28 ============================== CLAUSES FOR SEARCH ====================
% 4.02/4.28
% 4.02/4.28 ============================== end of clauses for search =============
% 4.02/4.28
% 4.02/4.28 ============================== SEARCH ================================
% 4.02/4.28
% 4.02/4.28 % Starting search at 0.01 seconds.
% 4.02/4.28
% 4.02/4.28 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 40 (0.00 of 0.87 sec).
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=41.000, iters=3333
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=40.000, iters=3344
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=39.000, iters=3575
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=33.000, iters=3366
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=32.000, iters=3386
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=31.000, iters=3390
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=30.000, iters=3365
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=29.000, iters=3341
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=28.000, iters=3355
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=27.000, iters=3361
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=26.000, iters=3333
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=25.000, iters=3355
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=24.000, iters=3343
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=23.000, iters=3340
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=4887, wt=69.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=2576, wt=65.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=4885, wt=63.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=3654, wt=61.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=11243, wt=19.000
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=22.000, iters=3338
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=11427, wt=18.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=11454, wt=17.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=11678, wt=16.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=16118, wt=15.000
% 4.02/4.28
% 4.02/4.28 Low Water (displace): id=16133, wt=14.000
% 4.02/4.28
% 4.02/4.28 Low Water (keep): wt=21.000, iters=3543
% 15.67/15.95
% 15.67/15.95 Low Water (keep): wt=20.000, iters=3346
% 15.67/15.95
% 15.67/15.95 Low Water (keep): wt=19.000, iters=3347
% 15.67/15.95
% 15.67/15.95 Low Water (keep): wt=18.000, iters=3336
% 15.67/15.95
% 15.67/15.95 Low Water (keep): wt=17.000, iters=3338
% 15.67/15.95
% 15.67/15.95 ============================== PROOF =================================
% 15.67/15.95 % SZS status Unsatisfiable
% 15.67/15.95 % SZS output start Refutation
% 15.67/15.95
% 15.67/15.95 % Proof 1 at 13.90 (+ 1.05) seconds: prove_cn_47.
% 15.67/15.95 % Length of proof is 55.
% 15.67/15.95 % Level of proof is 29.
% 15.67/15.95 % Maximum clause weight is 22.000.
% 15.67/15.95 % Given clauses 2972.
% 15.67/15.95
% 15.67/15.95 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 15.67/15.95 2 is_a_theorem(implies(implies(not(A),A),A)) = true # label(cn_2) # label(axiom). [assumption].
% 15.67/15.95 3 is_a_theorem(implies(A,implies(not(A),B))) = true # label(cn_3) # label(axiom). [assumption].
% 15.67/15.95 4 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) = true # label(cn_1) # label(axiom). [assumption].
% 15.67/15.95 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].
% 15.67/15.95 6 is_a_theorem(implies(implies(x,not(y)),implies(y,not(x)))) != true # label(prove_cn_47) # label(negated_conjecture) # answer(prove_cn_47). [assumption].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 45 is_a_theorem(implies(A,A)) = true. [para(37(a,1),8(a,1,1)),rewrite([1(6)])].
% 15.67/15.95 49 is_a_theorem(implies(not(implies(A,A)),B)) = true. [para(45(a,1),10(a,1,1)),rewrite([1(8)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 149 is_a_theorem(implies(A,implies(not(implies(B,B)),C))) = true. [para(60(a,1),42(a,1,1)),rewrite([1(9)])].
% 15.67/15.95 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)])].
% 15.67/15.95 177 is_a_theorem(implies(A,implies(B,B))) = true. [para(153(a,1),8(a,1,1)),rewrite([1(7)])].
% 15.67/15.95 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)])].
% 15.67/15.95 199 is_a_theorem(implies(A,implies(implies(not(B),B),B))) = true. [para(186(a,1),31(a,1,1)),rewrite([1(9)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 317 is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))) = true. [para(309(a,1),13(a,1,1)),rewrite([1(12)])].
% 15.67/15.95 321 is_a_theorem(implies(A,implies(B,implies(not(A),C)))) = true. [para(309(a,1),42(a,1,1)),rewrite([1(9)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 1437 ifeq(is_a_theorem(implies(implies(A,implies(B,C)),D)),true,is_a_theorem(implies(implies(B,not(A)),D)),true) = true. [para(317(a,1),5(a,1,1)),rewrite([1(15)])].
% 15.67/15.95 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)])].
% 15.67/15.95 7589 is_a_theorem(implies(A,implies(B,implies(C,A)))) = true. [para(7560(a,1),475(a,1,1)),rewrite([1(8)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 7945 is_a_theorem(implies(A,implies(B,A))) = true. [para(7597(a,1),8(a,1,1)),rewrite([1(7)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 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)])].
% 15.67/15.95 9381 is_a_theorem(implies(A,implies(implies(A,B),B))) = true. [para(8259(a,1),8043(a,1,1)),rewrite([1(8)])].
% 15.67/15.95 9388 ifeq(is_a_theorem(A),true,is_a_theorem(implies(implies(A,B),B)),true) = true. [para(9381(a,1),5(a,1,1)),rewrite([1(11)])].
% 15.67/15.95 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)])].
% 15.67/15.95 10250 is_a_theorem(implies(not(A),implies(A,B))) = true. [para(9391(a,1),43(a,1,1)),rewrite([1(8)])].
% 15.67/15.95 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)])].
% 15.67/15.95 10508 is_a_theorem(implies(not(not(A)),A)) = true. [para(10273(a,1),8(a,1,1)),rewrite([1(8)])].
% 15.67/15.95 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)])].
% 15.67/15.95 15703 is_a_theorem(implies(implies(A,not(A)),not(A))) = true. [para(8259(a,1),10541(a,1,1)),rewrite([1(9)])].
% 15.67/15.95 15758 is_a_theorem(implies(implies(implies(implies(A,not(A)),not(A)),B),B)) = true. [para(15703(a,1),9388(a,1,1)),rewrite([1(11)])].
% 15.67/15.95 19581 is_a_theorem(implies(implies(A,implies(B,not(B))),implies(A,not(B)))) = true. [para(15758(a,1),299(a,1,1)),rewrite([1(11)])].
% 15.67/15.95 30717 is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))) = true. [para(19581(a,1),1437(a,1,1)),rewrite([1(10)])].
% 15.67/15.95 30718 $F # answer(prove_cn_47). [resolve(30717,a,6,a)].
% 15.67/15.95
% 15.67/15.95 % SZS output end Refutation
% 15.67/15.95 ============================== end of proof ==========================
% 15.67/15.95
% 15.67/15.95 ============================== STATISTICS ============================
% 15.67/15.95
% 15.67/15.95 Given=2972. Generated=2051000. Kept=30717. proofs=1.
% 15.67/15.95 Usable=2904. Sos=9999. Demods=12913. Limbo=11, Disabled=17808. Hints=0.
% 15.67/15.95 Megabytes=25.28.
% 15.67/15.95 User_CPU=13.90, System_CPU=1.05, Wall_clock=15.
% 15.67/15.95
% 15.67/15.95 ============================== end of statistics =====================
% 15.67/15.95
% 15.67/15.95 ============================== end of search =========================
% 15.67/15.95
% 15.67/15.95 THEOREM PROVED
% 15.67/15.95 % SZS status Unsatisfiable
% 15.67/15.95
% 15.67/15.95 Exiting with 1 proof.
% 15.67/15.95
% 15.67/15.95 Process 14504 exit (max_proofs) Sat Jul 2 13:42:09 2022
% 15.67/15.95 Prover9 interrupted
%------------------------------------------------------------------------------