TSTP Solution File: LCL113-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL113-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:44:08 EDT 2022
% Result : Unsatisfiable 22.78s 23.04s
% Output : Refutation 22.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL113-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n015.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 : Mon Jul 4 11:03:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 22.78/23.04 ============================== Prover9 ===============================
% 22.78/23.04 Prover9 (32) version 2009-11A, November 2009.
% 22.78/23.04 Process 18447 was started by sandbox2 on n015.cluster.edu,
% 22.78/23.04 Mon Jul 4 11:03:02 2022
% 22.78/23.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18291_n015.cluster.edu".
% 22.78/23.04 ============================== end of head ===========================
% 22.78/23.04
% 22.78/23.04 ============================== INPUT =================================
% 22.78/23.04
% 22.78/23.04 % Reading from file /tmp/Prover9_18291_n015.cluster.edu
% 22.78/23.04
% 22.78/23.04 set(prolog_style_variables).
% 22.78/23.04 set(auto2).
% 22.78/23.04 % set(auto2) -> set(auto).
% 22.78/23.04 % set(auto) -> set(auto_inference).
% 22.78/23.04 % set(auto) -> set(auto_setup).
% 22.78/23.04 % set(auto_setup) -> set(predicate_elim).
% 22.78/23.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 22.78/23.04 % set(auto) -> set(auto_limits).
% 22.78/23.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 22.78/23.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 22.78/23.04 % set(auto) -> set(auto_denials).
% 22.78/23.04 % set(auto) -> set(auto_process).
% 22.78/23.04 % set(auto2) -> assign(new_constants, 1).
% 22.78/23.04 % set(auto2) -> assign(fold_denial_max, 3).
% 22.78/23.04 % set(auto2) -> assign(max_weight, "200.000").
% 22.78/23.04 % set(auto2) -> assign(max_hours, 1).
% 22.78/23.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 22.78/23.04 % set(auto2) -> assign(max_seconds, 0).
% 22.78/23.04 % set(auto2) -> assign(max_minutes, 5).
% 22.78/23.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 22.78/23.04 % set(auto2) -> set(sort_initial_sos).
% 22.78/23.04 % set(auto2) -> assign(sos_limit, -1).
% 22.78/23.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 22.78/23.04 % set(auto2) -> assign(max_megs, 400).
% 22.78/23.04 % set(auto2) -> assign(stats, some).
% 22.78/23.04 % set(auto2) -> clear(echo_input).
% 22.78/23.04 % set(auto2) -> set(quiet).
% 22.78/23.04 % set(auto2) -> clear(print_initial_clauses).
% 22.78/23.04 % set(auto2) -> clear(print_given).
% 22.78/23.04 assign(lrs_ticks,-1).
% 22.78/23.04 assign(sos_limit,10000).
% 22.78/23.04 assign(order,kbo).
% 22.78/23.04 set(lex_order_vars).
% 22.78/23.04 clear(print_given).
% 22.78/23.04
% 22.78/23.04 % formulas(sos). % not echoed (7 formulas)
% 22.78/23.04
% 22.78/23.04 ============================== end of input ==========================
% 22.78/23.04
% 22.78/23.04 % From the command line: assign(max_seconds, 300).
% 22.78/23.04
% 22.78/23.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 22.78/23.04
% 22.78/23.04 % Formulas that are not ordinary clauses:
% 22.78/23.04
% 22.78/23.04 ============================== end of process non-clausal formulas ===
% 22.78/23.04
% 22.78/23.04 ============================== PROCESS INITIAL CLAUSES ===============
% 22.78/23.04
% 22.78/23.04 ============================== PREDICATE ELIMINATION =================
% 22.78/23.04
% 22.78/23.04 ============================== end predicate elimination =============
% 22.78/23.04
% 22.78/23.04 Auto_denials:
% 22.78/23.04 % copying label prove_mv_33 to answer in negative clause
% 22.78/23.04
% 22.78/23.04 Term ordering decisions:
% 22.78/23.04 Function symbol KB weights: true=1. a=1. b=1. implies=1. is_a_theorem=1. not=1. ifeq=1.
% 22.78/23.04
% 22.78/23.04 ============================== end of process initial clauses ========
% 22.78/23.04
% 22.78/23.04 ============================== CLAUSES FOR SEARCH ====================
% 22.78/23.04
% 22.78/23.04 ============================== end of clauses for search =============
% 22.78/23.04
% 22.78/23.04 ============================== SEARCH ================================
% 22.78/23.04
% 22.78/23.04 % Starting search at 0.01 seconds.
% 22.78/23.04
% 22.78/23.04 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 227 (0.00 of 0.73 sec).
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=26.000, iters=3357
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=25.000, iters=3342
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=23.000, iters=3388
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=22.000, iters=3485
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=21.000, iters=3338
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=20.000, iters=3375
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=19.000, iters=3340
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=18.000, iters=3336
% 22.78/23.04
% 22.78/23.04 Low Water (displace): id=2452, wt=27.000
% 22.78/23.04
% 22.78/23.04 Low Water (displace): id=2459, wt=26.000
% 22.78/23.04
% 22.78/23.04 Low Water (displace): id=5835, wt=25.000
% 22.78/23.04
% 22.78/23.04 Low Water (displace): id=11084, wt=17.000
% 22.78/23.04
% 22.78/23.04 Low Water (displace): id=11096, wt=16.000
% 22.78/23.04
% 22.78/23.04 Low Water (displace): id=11106, wt=15.000
% 22.78/23.04
% 22.78/23.04 Low Water (keep): wt=17.000, iters=3348
% 22.78/23.04
% 22.78/23.04 ============================== PROOF =================================
% 22.78/23.04 % SZS status Unsatisfiable
% 22.78/23.04 % SZS output start Refutation
% 22.78/23.04
% 22.78/23.04 % Proof 1 at 20.39 (+ 1.60) seconds: prove_mv_33.
% 22.78/23.04 % Length of proof is 31.
% 22.78/23.04 % Level of proof is 14.
% 22.78/23.04 % Maximum clause weight is 19.000.
% 22.78/23.04 % Given clauses 3964.
% 22.78/23.04
% 22.78/23.04 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 22.78/23.04 2 is_a_theorem(implies(A,implies(B,A))) = true # label(mv_1) # label(axiom). [assumption].
% 22.78/23.04 3 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) = true # label(mv_5) # label(axiom). [assumption].
% 22.78/23.04 4 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) = true # label(mv_2) # label(axiom). [assumption].
% 22.78/23.04 5 is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))) = true # label(mv_3) # label(axiom). [assumption].
% 22.78/23.04 6 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].
% 22.78/23.04 7 is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true # label(prove_mv_33) # label(negated_conjecture) # answer(prove_mv_33). [assumption].
% 22.78/23.04 9 ifeq(is_a_theorem(implies(implies(A,implies(B,A)),C)),true,is_a_theorem(C),true) = true. [para(2(a,1),6(a,1,3,1)),rewrite([1(10)])].
% 22.78/23.04 11 ifeq(is_a_theorem(implies(not(A),not(B))),true,is_a_theorem(implies(B,A)),true) = true. [para(3(a,1),6(a,1,1)),rewrite([1(13)])].
% 22.78/23.04 12 ifeq(is_a_theorem(implies(implies(implies(not(A),not(B)),implies(B,A)),C)),true,is_a_theorem(C),true) = true. [para(3(a,1),6(a,1,3,1)),rewrite([1(13)])].
% 22.78/23.04 14 ifeq(is_a_theorem(implies(A,B)),true,is_a_theorem(implies(implies(B,C),implies(A,C))),true) = true. [para(4(a,1),6(a,1,1)),rewrite([1(13)])].
% 22.78/23.04 32 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))) = true. [para(4(a,1),9(a,1,1)),rewrite([1(9)])].
% 22.78/23.04 33 ifeq(is_a_theorem(implies(implies(A,B),C)),true,is_a_theorem(implies(B,C)),true) = true. [para(32(a,1),6(a,1,1)),rewrite([1(12)])].
% 22.78/23.04 54 is_a_theorem(implies(not(A),implies(A,B))) = true. [para(3(a,1),33(a,1,1)),rewrite([1(8)])].
% 22.78/23.04 56 is_a_theorem(implies(A,implies(implies(A,B),B))) = true. [para(5(a,1),33(a,1,1)),rewrite([1(8)])].
% 22.78/23.04 66 is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)) = true. [para(56(a,1),9(a,1,1)),rewrite([1(9)])].
% 22.78/23.04 79 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))) = true. [para(4(a,1),14(a,1,1)),rewrite([1(12)])].
% 22.78/23.04 88 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))) = true. [para(54(a,1),14(a,1,1)),rewrite([1(10)])].
% 22.78/23.04 89 is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))) = true. [para(56(a,1),14(a,1,1)),rewrite([1(10)])].
% 22.78/23.04 101 ifeq(is_a_theorem(implies(implies(implies(implies(A,implies(B,A)),C),C),D)),true,is_a_theorem(D),true) = true. [para(66(a,1),6(a,1,3,1)),rewrite([1(12)])].
% 22.78/23.04 184 is_a_theorem(implies(not(not(A)),implies(B,A))) = true. [para(88(a,1),12(a,1,1)),rewrite([1(9)])].
% 22.78/23.04 192 is_a_theorem(implies(implies(implies(A,B),C),implies(not(not(B)),C))) = true. [para(184(a,1),14(a,1,1)),rewrite([1(11)])].
% 22.78/23.04 251 ifeq(is_a_theorem(implies(implies(implies(A,B),B),C)),true,is_a_theorem(implies(A,C)),true) = true. [para(89(a,1),6(a,1,1)),rewrite([1(13)])].
% 22.78/23.04 1586 is_a_theorem(implies(not(not(A)),A)) = true. [para(192(a,1),101(a,1,1)),rewrite([1(8)])].
% 22.78/23.04 1598 is_a_theorem(implies(A,not(not(A)))) = true. [para(1586(a,1),11(a,1,1)),rewrite([1(8)])].
% 22.78/23.04 1606 ifeq(is_a_theorem(implies(implies(A,not(not(A))),B)),true,is_a_theorem(B),true) = true. [para(1598(a,1),6(a,1,3,1)),rewrite([1(11)])].
% 22.78/23.04 7375 is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))) = true. [para(79(a,1),251(a,1,1)),rewrite([1(10)])].
% 22.78/23.04 10531 is_a_theorem(implies(implies(A,B),implies(A,not(not(B))))) = true. [para(7375(a,1),1606(a,1,1)),rewrite([1(10)])].
% 22.78/23.04 10621 is_a_theorem(implies(implies(implies(A,not(not(B))),C),implies(implies(A,B),C))) = true. [para(10531(a,1),14(a,1,1)),rewrite([1(12)])].
% 22.78/23.04 17307 is_a_theorem(implies(implies(not(A),B),implies(not(B),A))) = true. [para(10621(a,1),12(a,1,1)),rewrite([1(10)])].
% 22.78/23.04 17308 $F # answer(prove_mv_33). [resolve(17307,a,7,a)].
% 22.78/23.04
% 22.78/23.04 % SZS output end Refutation
% 22.78/23.04 ============================== end of proof ==========================
% 22.78/23.04
% 22.78/23.04 ============================== STATISTICS ============================
% 22.78/23.04
% 22.78/23.04 Given=3964. Generated=3127513. Kept=17307. proofs=1.
% 22.78/23.04 Usable=3958. Sos=9555. Demods=13512. Limbo=0, Disabled=3800. Hints=0.
% 22.78/23.04 Megabytes=15.87.
% 22.78/23.04 User_CPU=20.39, System_CPU=1.60, Wall_clock=22.
% 22.78/23.04
% 22.78/23.04 ============================== end of statistics =====================
% 22.78/23.04
% 22.78/23.04 ============================== end of search =========================
% 22.78/23.04
% 22.78/23.04 THEOREM PROVED
% 22.78/23.04 % SZS status Unsatisfiable
% 22.78/23.04
% 22.78/23.04 Exiting with 1 proof.
% 22.78/23.04
% 22.78/23.04 Process 18447 exit (max_proofs) Mon Jul 4 11:03:24 2022
% 22.78/23.04 Prover9 interrupted
%------------------------------------------------------------------------------