TSTP Solution File: LCL096-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL096-10 : TPTP v8.1.0. Released v7.3.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:43:58 EDT 2022
% Result : Unsatisfiable 6.13s 6.46s
% Output : Refutation 6.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL096-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 05:08:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 6.13/6.46 ============================== Prover9 ===============================
% 6.13/6.46 Prover9 (32) version 2009-11A, November 2009.
% 6.13/6.46 Process 24996 was started by sandbox on n003.cluster.edu,
% 6.13/6.46 Mon Jul 4 05:08:40 2022
% 6.13/6.46 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24843_n003.cluster.edu".
% 6.13/6.46 ============================== end of head ===========================
% 6.13/6.46
% 6.13/6.46 ============================== INPUT =================================
% 6.13/6.46
% 6.13/6.46 % Reading from file /tmp/Prover9_24843_n003.cluster.edu
% 6.13/6.46
% 6.13/6.46 set(prolog_style_variables).
% 6.13/6.46 set(auto2).
% 6.13/6.46 % set(auto2) -> set(auto).
% 6.13/6.46 % set(auto) -> set(auto_inference).
% 6.13/6.46 % set(auto) -> set(auto_setup).
% 6.13/6.46 % set(auto_setup) -> set(predicate_elim).
% 6.13/6.46 % set(auto_setup) -> assign(eq_defs, unfold).
% 6.13/6.46 % set(auto) -> set(auto_limits).
% 6.13/6.46 % set(auto_limits) -> assign(max_weight, "100.000").
% 6.13/6.46 % set(auto_limits) -> assign(sos_limit, 20000).
% 6.13/6.46 % set(auto) -> set(auto_denials).
% 6.13/6.46 % set(auto) -> set(auto_process).
% 6.13/6.46 % set(auto2) -> assign(new_constants, 1).
% 6.13/6.46 % set(auto2) -> assign(fold_denial_max, 3).
% 6.13/6.46 % set(auto2) -> assign(max_weight, "200.000").
% 6.13/6.46 % set(auto2) -> assign(max_hours, 1).
% 6.13/6.46 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 6.13/6.46 % set(auto2) -> assign(max_seconds, 0).
% 6.13/6.46 % set(auto2) -> assign(max_minutes, 5).
% 6.13/6.46 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 6.13/6.46 % set(auto2) -> set(sort_initial_sos).
% 6.13/6.46 % set(auto2) -> assign(sos_limit, -1).
% 6.13/6.46 % set(auto2) -> assign(lrs_ticks, 3000).
% 6.13/6.46 % set(auto2) -> assign(max_megs, 400).
% 6.13/6.46 % set(auto2) -> assign(stats, some).
% 6.13/6.46 % set(auto2) -> clear(echo_input).
% 6.13/6.46 % set(auto2) -> set(quiet).
% 6.13/6.46 % set(auto2) -> clear(print_initial_clauses).
% 6.13/6.46 % set(auto2) -> clear(print_given).
% 6.13/6.46 assign(lrs_ticks,-1).
% 6.13/6.46 assign(sos_limit,10000).
% 6.13/6.46 assign(order,kbo).
% 6.13/6.46 set(lex_order_vars).
% 6.13/6.46 clear(print_given).
% 6.13/6.46
% 6.13/6.46 % formulas(sos). % not echoed (6 formulas)
% 6.13/6.46
% 6.13/6.46 ============================== end of input ==========================
% 6.13/6.46
% 6.13/6.46 % From the command line: assign(max_seconds, 300).
% 6.13/6.46
% 6.13/6.46 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 6.13/6.46
% 6.13/6.46 % Formulas that are not ordinary clauses:
% 6.13/6.46
% 6.13/6.46 ============================== end of process non-clausal formulas ===
% 6.13/6.46
% 6.13/6.46 ============================== PROCESS INITIAL CLAUSES ===============
% 6.13/6.46
% 6.13/6.46 ============================== PREDICATE ELIMINATION =================
% 6.13/6.46
% 6.13/6.46 ============================== end predicate elimination =============
% 6.13/6.46
% 6.13/6.46 Auto_denials:
% 6.13/6.46 % copying label prove_lg_1 to answer in negative clause
% 6.13/6.46
% 6.13/6.46 Term ordering decisions:
% 6.13/6.46
% 6.13/6.46 % Assigning unary symbol is_a_theorem kb_weight 0 and highest precedence (8).
% 6.13/6.46 Function symbol KB weights: true=1. a=1. b=1. c=1. equivalent=1. ifeq=1. is_a_theorem=0.
% 6.13/6.46
% 6.13/6.46 ============================== end of process initial clauses ========
% 6.13/6.46
% 6.13/6.46 ============================== CLAUSES FOR SEARCH ====================
% 6.13/6.46
% 6.13/6.46 ============================== end of clauses for search =============
% 6.13/6.46
% 6.13/6.46 ============================== SEARCH ================================
% 6.13/6.46
% 6.13/6.46 % Starting search at 0.01 seconds.
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=46.000, iters=3369
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=42.000, iters=3335
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=38.000, iters=3342
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=37.000, iters=3344
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=34.000, iters=3341
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=33.000, iters=3335
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=30.000, iters=3340
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=29.000, iters=3336
% 6.13/6.46
% 6.13/6.46 Low Water (keep): wt=26.000, iters=3336
% 6.13/6.46
% 6.13/6.46 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 441 (0.00 of 3.43 sec).
% 6.13/6.46
% 6.13/6.46 Low Water (displace): id=5464, wt=62.000
% 6.13/6.46
% 6.13/6.46 Low Water (displace): id=5610, wt=58.000
% 6.13/6.46
% 6.13/6.46 Low Water (displace): id=12166, wt=22.000
% 6.13/6.46
% 6.13/6.46 ============================== PROOF =================================
% 6.13/6.46 % SZS status Unsatisfiable
% 6.13/6.46 % SZS output start Refutation
% 6.13/6.46
% 6.13/6.46 % Proof 1 at 5.46 (+ 0.12) seconds: prove_lg_1.
% 6.13/6.46 % Length of proof is 40.
% 6.13/6.46 % Level of proof is 14.
% 6.13/6.46 % Maximum clause weight is 29.000.
% 6.13/6.46 % Given clauses 761.
% 6.13/6.46
% 6.13/6.46 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 6.13/6.46 2 ifeq(is_a_theorem(equivalent(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true) = true # label(condensed_detachment) # label(axiom). [assumption].
% 6.13/6.46 3 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)) = true # label(lg_2) # label(axiom). [assumption].
% 6.13/6.46 4 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D)),E),E)) = true # label(lg_3) # label(axiom). [assumption].
% 6.13/6.46 5 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(equivalent(equivalent(A,E),C),equivalent(equivalent(B,E),D)))) = true # label(lg_4) # label(axiom). [assumption].
% 6.13/6.46 6 is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true # label(prove_lg_1) # label(negated_conjecture) # answer(prove_lg_1). [assumption].
% 6.13/6.46 7 ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D)),true,is_a_theorem(D),true) = true. [para(3(a,1),2(a,1,1)),rewrite([1(15)])].
% 6.13/6.46 8 ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D),E)),true,is_a_theorem(E),true) = true. [para(3(a,1),2(a,1,3,1)),rewrite([1(15)])].
% 6.13/6.46 10 ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D)),E)),true,is_a_theorem(E),true) = true. [para(4(a,1),2(a,1,1)),rewrite([1(17)])].
% 6.13/6.46 14 ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(equivalent(equivalent(A,E),C),equivalent(equivalent(B,E),D))),F)),true,is_a_theorem(F),true) = true. [para(5(a,1),2(a,1,3,1)),rewrite([1(17)])].
% 6.13/6.46 18 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(equivalent(D,B),equivalent(D,C)))) = true. [para(5(a,1),7(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 20 ifeq(is_a_theorem(equivalent(equivalent(A,B),equivalent(A,C))),true,is_a_theorem(equivalent(equivalent(D,B),equivalent(D,C))),true) = true. [para(18(a,1),2(a,1,1)),rewrite([1(15)])].
% 6.13/6.46 26 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,equivalent(equivalent(C,C),B)))) = true. [para(5(a,1),20(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 27 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,C)))) = true. [para(18(a,1),20(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 28 ifeq(is_a_theorem(equivalent(A,B)),true,is_a_theorem(equivalent(A,equivalent(equivalent(C,C),B))),true) = true. [para(26(a,1),2(a,1,1)),rewrite([1(13)])].
% 6.13/6.46 36 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C))) = true. [para(27(a,1),7(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 40 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))) = true. [para(4(a,1),8(a,1,1)),rewrite([1(8)])].
% 6.13/6.46 42 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),E),equivalent(equivalent(equivalent(B,C),D),E))) = true. [para(5(a,1),8(a,1,1)),rewrite([1(14)])].
% 6.13/6.46 49 ifeq(is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,B)),C)),true,is_a_theorem(C),true) = true. [para(40(a,1),2(a,1,3,1)),rewrite([1(11)])].
% 6.13/6.46 65 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,C),equivalent(A,B)))) = true. [para(40(a,1),28(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 78 is_a_theorem(equivalent(equivalent(A,A),equivalent(equivalent(equivalent(B,C),equivalent(B,D)),equivalent(C,D)))) = true. [para(65(a,1),7(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 85 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D))) = true. [para(4(a,1),49(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 92 is_a_theorem(equivalent(A,A)) = true. [para(36(a,1),49(a,1,1)),rewrite([1(6)])].
% 6.13/6.46 96 ifeq(is_a_theorem(equivalent(equivalent(A,A),B)),true,is_a_theorem(B),true) = true. [para(92(a,1),2(a,1,3,1)),rewrite([1(9)])].
% 6.13/6.46 377 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D)))) = true. [para(78(a,1),20(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 392 ifeq(is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D)),true,is_a_theorem(equivalent(equivalent(B,C),D)),true) = true. [para(85(a,1),2(a,1,1)),rewrite([1(15)])].
% 6.13/6.46 399 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))) = true. [para(85(a,1),96(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 409 ifeq(is_a_theorem(equivalent(A,B)),true,is_a_theorem(equivalent(equivalent(C,A),equivalent(C,B))),true) = true. [para(399(a,1),2(a,1,1)),rewrite([1(13)])].
% 6.13/6.46 996 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,A),B),C),equivalent(B,C))) = true. [para(377(a,1),14(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 1024 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,B),C),D)),equivalent(A,equivalent(C,D)))) = true. [para(996(a,1),409(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 2118 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,A),D)),equivalent(equivalent(C,B),D))) = true. [para(42(a,1),7(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 2547 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,B)),equivalent(A,C)),D),equivalent(C,D))) = true. [para(1024(a,1),10(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 4173 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),equivalent(A,C))) = true. [para(2118(a,1),20(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 4223 ifeq(is_a_theorem(equivalent(A,equivalent(equivalent(B,B),C))),true,is_a_theorem(equivalent(A,C)),true) = true. [para(4173(a,1),2(a,1,1)),rewrite([1(13)])].
% 6.13/6.46 4684 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)) = true. [para(2118(a,1),4223(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 4694 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),D))),equivalent(A,D))) = true. [para(4684(a,1),20(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 8191 ifeq(is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),D)))),true,is_a_theorem(equivalent(A,D)),true) = true. [para(4694(a,1),2(a,1,1)),rewrite([1(15)])].
% 6.13/6.46 11180 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(equivalent(A,equivalent(D,D)),C)))) = true. [para(2547(a,1),392(a,1,1)),rewrite([1(12)])].
% 6.13/6.46 15169 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),A)),C),C)) = true. [para(11180(a,1),8191(a,1,1)),rewrite([1(10)])].
% 6.13/6.46 15170 $F # answer(prove_lg_1). [resolve(15169,a,6,a)].
% 6.13/6.46
% 6.13/6.46 % SZS output end Refutation
% 6.13/6.46 ============================== end of proof ==========================
% 6.13/6.46
% 6.13/6.46 ============================== STATISTICS ============================
% 6.13/6.46
% 6.13/6.46 Given=761. Generated=183784. Kept=15169. proofs=1.
% 6.13/6.46 Usable=734. Sos=9992. Demods=10745. Limbo=20, Disabled=4428. Hints=0.
% 6.13/6.46 Megabytes=17.30.
% 6.13/6.46 User_CPU=5.46, System_CPU=0.12, Wall_clock=5.
% 6.13/6.46
% 6.13/6.46 ============================== end of statistics =====================
% 6.13/6.46
% 6.13/6.46 ============================== end of search =========================
% 6.13/6.46
% 6.13/6.46 THEOREM PROVED
% 6.13/6.46 % SZS status Unsatisfiable
% 6.13/6.46
% 6.13/6.46 Exiting with 1 proof.
% 6.13/6.46
% 6.13/6.46 Process 24996 exit (max_proofs) Mon Jul 4 05:08:45 2022
% 6.13/6.47 Prover9 interrupted
%------------------------------------------------------------------------------