TSTP Solution File: LCL002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:20 EDT 2022
% Result : Unsatisfiable 6.65s 6.95s
% Output : Refutation 6.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n010.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 : Sun Jul 3 00:04:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.32/2.59 ============================== Prover9 ===============================
% 2.32/2.59 Prover9 (32) version 2009-11A, November 2009.
% 2.32/2.59 Process 6277 was started by sandbox on n010.cluster.edu,
% 2.32/2.59 Sun Jul 3 00:04:33 2022
% 2.32/2.59 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6124_n010.cluster.edu".
% 2.32/2.59 ============================== end of head ===========================
% 2.32/2.59
% 2.32/2.59 ============================== INPUT =================================
% 2.32/2.59
% 2.32/2.59 % Reading from file /tmp/Prover9_6124_n010.cluster.edu
% 2.32/2.59
% 2.32/2.59 set(prolog_style_variables).
% 2.32/2.59 set(auto2).
% 2.32/2.59 % set(auto2) -> set(auto).
% 2.32/2.59 % set(auto) -> set(auto_inference).
% 2.32/2.59 % set(auto) -> set(auto_setup).
% 2.32/2.59 % set(auto_setup) -> set(predicate_elim).
% 2.32/2.59 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.32/2.59 % set(auto) -> set(auto_limits).
% 2.32/2.59 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.32/2.59 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.32/2.59 % set(auto) -> set(auto_denials).
% 2.32/2.59 % set(auto) -> set(auto_process).
% 2.32/2.59 % set(auto2) -> assign(new_constants, 1).
% 2.32/2.59 % set(auto2) -> assign(fold_denial_max, 3).
% 2.32/2.59 % set(auto2) -> assign(max_weight, "200.000").
% 2.32/2.59 % set(auto2) -> assign(max_hours, 1).
% 2.32/2.59 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.32/2.59 % set(auto2) -> assign(max_seconds, 0).
% 2.32/2.59 % set(auto2) -> assign(max_minutes, 5).
% 2.32/2.59 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.32/2.59 % set(auto2) -> set(sort_initial_sos).
% 2.32/2.59 % set(auto2) -> assign(sos_limit, -1).
% 2.32/2.59 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.32/2.59 % set(auto2) -> assign(max_megs, 400).
% 2.32/2.59 % set(auto2) -> assign(stats, some).
% 2.32/2.59 % set(auto2) -> clear(echo_input).
% 2.32/2.59 % set(auto2) -> set(quiet).
% 2.32/2.59 % set(auto2) -> clear(print_initial_clauses).
% 2.32/2.59 % set(auto2) -> clear(print_given).
% 2.32/2.59 assign(lrs_ticks,-1).
% 2.32/2.59 assign(sos_limit,10000).
% 2.32/2.59 assign(order,kbo).
% 2.32/2.59 set(lex_order_vars).
% 2.32/2.59 clear(print_given).
% 2.32/2.59
% 2.32/2.59 % formulas(sos). % not echoed (3 formulas)
% 2.32/2.59
% 2.32/2.59 ============================== end of input ==========================
% 2.32/2.59
% 2.32/2.59 % From the command line: assign(max_seconds, 300).
% 2.32/2.59
% 2.32/2.59 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.32/2.59
% 2.32/2.59 % Formulas that are not ordinary clauses:
% 2.32/2.59
% 2.32/2.59 ============================== end of process non-clausal formulas ===
% 2.32/2.59
% 2.32/2.59 ============================== PROCESS INITIAL CLAUSES ===============
% 2.32/2.59
% 2.32/2.59 ============================== PREDICATE ELIMINATION =================
% 2.32/2.59
% 2.32/2.59 ============================== end predicate elimination =============
% 2.32/2.59
% 2.32/2.59 Auto_denials:
% 2.32/2.59 % copying label an_1 to answer in negative clause
% 2.32/2.59
% 2.32/2.59 Term ordering decisions:
% 2.32/2.59
% 2.32/2.59 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 2.32/2.59 Function symbol KB weights: a=1. b=1. c=1. or=1. not=0.
% 2.32/2.59
% 2.32/2.59 ============================== end of process initial clauses ========
% 2.32/2.59
% 2.32/2.59 ============================== CLAUSES FOR SEARCH ====================
% 2.32/2.59
% 2.32/2.59 ============================== end of clauses for search =============
% 2.32/2.59
% 2.32/2.59 ============================== SEARCH ================================
% 2.32/2.59
% 2.32/2.59 % Starting search at 0.01 seconds.
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=77.000, iters=3363
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=75.000, iters=3363
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=73.000, iters=3363
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=69.000, iters=3363
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=67.000, iters=3361
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=51.000, iters=3415
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=49.000, iters=3411
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=47.000, iters=3403
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=43.000, iters=3375
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=41.000, iters=3338
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=39.000, iters=3355
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=35.000, iters=3378
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=34.000, iters=3356
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=33.000, iters=3494
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=32.000, iters=3423
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=30.000, iters=3338
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=27.000, iters=3333
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=25.000, iters=3343
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=24.000, iters=3333
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=23.000, iters=3335
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=21.000, iters=3339
% 2.32/2.59
% 2.32/2.59 Low Water (keep): wt=19.000, iters=3333
% 2.32/2.59
% 2.32/2.59 Low Water (displace): id=8895, wt=50.000
% 2.32/2.59
% 2.32/2.59 Low Water (displace): id=7652, wt=49.000
% 2.32/2.59
% 2.32/2.59 Low Water (displace): id=8573, wt=47.000
% 2.32/2.59
% 2.32/2.59 Low Water (displace): id=8879, wt=45.000
% 2.32/2.59
% 2.32/2.59 Low Water (displace): id=15085, wt=17.000
% 2.32/2.59
% 2.32/2.59 Low Water (displace): id=15100, wt=15.000
% 6.65/6.95
% 6.65/6.95 Low Water (displace): id=15350, wt=13.000
% 6.65/6.95
% 6.65/6.95 Low Water (keep): wt=17.000, iters=3345
% 6.65/6.95
% 6.65/6.95 Low Water (displace): id=17834, wt=11.000
% 6.65/6.95
% 6.65/6.95 ============================== PROOF =================================
% 6.65/6.95 % SZS status Unsatisfiable
% 6.65/6.95 % SZS output start Refutation
% 6.65/6.95
% 6.65/6.95 % Proof 1 at 5.24 (+ 0.82) seconds: an_1.
% 6.65/6.95 % Length of proof is 59.
% 6.65/6.95 % Level of proof is 48.
% 6.65/6.95 % Maximum clause weight is 26.000.
% 6.65/6.95 % Given clauses 2062.
% 6.65/6.95
% 6.65/6.95 1 is_a_theorem(or(not(or(not(or(not(A),B)),or(C,or(D,E)))),or(not(or(not(D),A)),or(C,or(E,A))))) # label(an_CAMerideth) # label(axiom). [assumption].
% 6.65/6.95 2 -is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))) # label(an_1) # label(negated_conjecture) # answer(an_1). [assumption].
% 6.65/6.95 3 -is_a_theorem(or(not(A),B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 6.65/6.95 4 is_a_theorem(or(not(or(not(A),or(not(B),C))),or(not(or(not(D),B)),or(or(E,B),or(not(B),C))))). [hyper(3,a,1,a,b,1,a)].
% 6.65/6.95 6 is_a_theorem(or(not(or(not(or(A,B)),C)),or(not(or(not(D),B)),or(or(not(B),E),C)))). [hyper(3,a,1,a,b,4,a)].
% 6.65/6.95 10 is_a_theorem(or(not(or(not(or(not(A),B)),or(C,A))),or(not(or(not(D),A)),or(E,or(C,A))))). [hyper(3,a,1,a,b,6,a)].
% 6.65/6.95 13 is_a_theorem(or(not(or(not(A),or(not(B),or(C,B)))),or(D,or(not(or(not(E),B)),or(not(B),or(C,B)))))). [hyper(3,a,10,a,b,10,a)].
% 6.65/6.95 65 is_a_theorem(or(not(or(not(not(or(not(A),B))),C)),or(D,or(or(not(B),or(E,B)),C)))). [hyper(3,a,1,a,b,13,a)].
% 6.65/6.95 69 is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(or(not(D),or(E,D)),C))))). [hyper(3,a,13,a,b,65,a)].
% 6.65/6.95 86 is_a_theorem(or(not(or(not(A),B)),or(not(B),or(or(not(C),or(D,C)),B)))). [hyper(3,a,69,a,b,69,a)].
% 6.65/6.95 95 is_a_theorem(or(not(or(not(or(not(A),or(B,A))),C)),or(not(D),or(D,C)))). [hyper(3,a,1,a,b,86,a)].
% 6.65/6.95 110 is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(C,C))))). [hyper(3,a,13,a,b,95,a)].
% 6.65/6.95 131 is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))). [hyper(3,a,110,a,b,110,a)].
% 6.65/6.95 158 is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))). [hyper(3,a,1,a,b,131,a)].
% 6.65/6.95 170 is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))). [hyper(3,a,1,a,b,158,a)].
% 6.65/6.95 185 is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(D,C))))). [hyper(3,a,13,a,b,170,a)].
% 6.65/6.95 247 is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))). [hyper(3,a,185,a,b,185,a)].
% 6.65/6.95 259 is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(C),or(B,C))))). [hyper(3,a,10,a,b,247,a)].
% 6.65/6.95 260 is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))). [hyper(3,a,1,a,b,247,a)].
% 6.65/6.95 279 is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))). [hyper(3,a,1,a,b,260,a)].
% 6.65/6.95 395 is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(or(B,C)),or(B,C))))). [hyper(3,a,10,a,b,279,a)].
% 6.65/6.95 405 is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),or(D,B))))). [hyper(3,a,279,a,b,247,a)].
% 6.65/6.95 577 is_a_theorem(or(not(or(not(not(A)),B)),or(C,or(or(D,A),B)))). [hyper(3,a,1,a,b,405,a)].
% 6.65/6.95 674 is_a_theorem(or(not(or(not(or(A,B)),not(B))),or(C,or(D,not(B))))). [hyper(3,a,1,a,b,577,a)].
% 6.65/6.95 1958 is_a_theorem(or(A,or(not(or(B,not(C))),or(D,or(B,not(C)))))). [hyper(3,a,259,a,b,674,a)].
% 6.65/6.95 2163 is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))). [hyper(3,a,1958,a,b,1958,a)].
% 6.65/6.95 2200 is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(not(C),A)))). [hyper(3,a,1,a,b,2163,a)].
% 6.65/6.95 2240 is_a_theorem(or(A,or(not(or(not(B),C)),or(D,or(not(B),C))))). [hyper(3,a,259,a,b,2200,a)].
% 6.65/6.95 2622 is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))). [hyper(3,a,2240,a,b,2240,a)].
% 6.65/6.95 2676 is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))). [hyper(3,a,1,a,b,2622,a)].
% 6.65/6.95 2724 is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))). [hyper(3,a,259,a,b,2676,a)].
% 6.65/6.95 2730 is_a_theorem(or(not(or(not(A),not(B))),or(C,or(B,not(B))))). [hyper(3,a,1,a,b,2676,a)].
% 6.65/6.95 2832 is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))). [hyper(3,a,2724,a,b,2724,a)].
% 6.65/6.95 2842 is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))). [hyper(3,a,279,a,b,2832,a)].
% 6.65/6.95 2916 is_a_theorem(or(not(or(not(A),B)),or(C,or(or(not(B),D),B)))). [hyper(3,a,1,a,b,2842,a)].
% 6.65/6.95 3166 is_a_theorem(or(not(or(not(or(not(A),B)),C)),or(D,or(A,C)))). [hyper(3,a,1,a,b,2916,a)].
% 6.65/6.95 3192 is_a_theorem(or(A,or(B,or(C,or(D,not(D)))))). [hyper(3,a,3166,a,b,2730,a)].
% 6.65/6.95 3203 is_a_theorem(or(A,or(B,or(not(C),or(C,D))))). [hyper(3,a,3166,a,b,260,a)].
% 6.65/6.95 3291 is_a_theorem(or(A,or(B,or(C,not(C))))). [hyper(3,a,3192,a,b,3192,a)].
% 6.65/6.95 3310 is_a_theorem(or(A,or(B,not(B)))). [hyper(3,a,3291,a,b,3291,a)].
% 6.65/6.95 3315 is_a_theorem(or(A,not(A))). [hyper(3,a,3310,a,b,3310,a)].
% 6.65/6.95 3320 is_a_theorem(not(not(or(A,not(A))))). [hyper(3,a,3315,a,b,3315,a)].
% 6.65/6.95 3754 is_a_theorem(or(A,or(not(B),or(B,C)))). [hyper(3,a,3203,a,b,3203,a)].
% 6.65/6.95 3758 is_a_theorem(or(not(A),or(A,B))). [hyper(3,a,3754,a,b,3754,a)].
% 6.65/6.95 3801 is_a_theorem(or(not(not(or(A,not(A)))),B)). [hyper(3,a,3758,a,b,3320,a)].
% 6.65/6.95 3981 is_a_theorem(or(not(A),or(B,A))). [hyper(3,a,247,a,b,3801,a)].
% 6.65/6.95 4262 is_a_theorem(or(A,or(not(or(B,C)),or(B,C)))). [hyper(3,a,395,a,b,3981,a)].
% 6.65/6.95 5842 is_a_theorem(or(not(or(A,B)),or(A,B))). [hyper(3,a,4262,a,b,4262,a)].
% 6.65/6.95 5855 is_a_theorem(or(not(or(not(A),B)),or(not(or(A,C)),or(C,B)))). [hyper(3,a,1,a,b,4262,a)].
% 6.65/6.95 5866 is_a_theorem(or(A,or(B,or(not(B),C)))). [hyper(3,a,3166,a,b,5842,a)].
% 6.65/6.95 5870 is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),B)))). [hyper(3,a,10,a,b,5842,a)].
% 6.65/6.95 5871 is_a_theorem(or(A,or(not(A),B))). [hyper(3,a,5866,a,b,5866,a)].
% 6.65/6.95 5899 is_a_theorem(or(not(not(or(A,or(not(A),B)))),C)). [hyper(3,a,5871,a,b,5871,a)].
% 6.65/6.95 12336 is_a_theorem(or(A,or(not(B),B))). [hyper(3,a,5870,a,b,5899,a)].
% 6.65/6.95 12337 is_a_theorem(or(not(A),A)). [hyper(3,a,12336,a,b,12336,a)].
% 6.65/6.95 17341 is_a_theorem(or(not(or(A,B)),or(B,A))). [hyper(3,a,5855,a,b,12337,a)].
% 6.65/6.95 17381 is_a_theorem(or(A,or(not(or(B,C)),or(C,B)))). [hyper(3,a,3981,a,b,17341,a)].
% 6.65/6.95 18662 is_a_theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [hyper(3,a,1,a,b,17381,a)].
% 6.65/6.95 18663 $F # answer(an_1). [resolve(18662,a,2,a)].
% 6.65/6.95
% 6.65/6.95 % SZS output end Refutation
% 6.65/6.95 ============================== end of proof ==========================
% 6.65/6.95
% 6.65/6.95 ============================== STATISTICS ============================
% 6.65/6.95
% 6.65/6.95 Given=2062. Generated=1657076. Kept=18662. proofs=1.
% 6.65/6.95 Usable=1771. Sos=9999. Demods=0. Limbo=8, Disabled=6886. Hints=0.
% 6.65/6.95 Megabytes=14.92.
% 6.65/6.95 User_CPU=5.24, System_CPU=0.82, Wall_clock=6.
% 6.65/6.95
% 6.65/6.95 ============================== end of statistics =====================
% 6.65/6.95
% 6.65/6.95 ============================== end of search =========================
% 6.65/6.95
% 6.65/6.95 THEOREM PROVED
% 6.65/6.95 % SZS status Unsatisfiable
% 6.65/6.95
% 6.65/6.95 Exiting with 1 proof.
% 6.65/6.95
% 6.65/6.95 Process 6277 exit (max_proofs) Sun Jul 3 00:04:39 2022
% 6.65/6.95 Prover9 interrupted
%------------------------------------------------------------------------------