TSTP Solution File: LCL004-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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 1.06s 1.34s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n005.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 : Sun Jul 3 11:11:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.06/1.34 ============================== Prover9 ===============================
% 1.06/1.34 Prover9 (32) version 2009-11A, November 2009.
% 1.06/1.34 Process 6752 was started by sandbox on n005.cluster.edu,
% 1.06/1.34 Sun Jul 3 11:11:38 2022
% 1.06/1.34 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6599_n005.cluster.edu".
% 1.06/1.34 ============================== end of head ===========================
% 1.06/1.34
% 1.06/1.34 ============================== INPUT =================================
% 1.06/1.34
% 1.06/1.34 % Reading from file /tmp/Prover9_6599_n005.cluster.edu
% 1.06/1.34
% 1.06/1.34 set(prolog_style_variables).
% 1.06/1.34 set(auto2).
% 1.06/1.34 % set(auto2) -> set(auto).
% 1.06/1.34 % set(auto) -> set(auto_inference).
% 1.06/1.34 % set(auto) -> set(auto_setup).
% 1.06/1.34 % set(auto_setup) -> set(predicate_elim).
% 1.06/1.34 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.06/1.34 % set(auto) -> set(auto_limits).
% 1.06/1.34 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.06/1.34 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.06/1.34 % set(auto) -> set(auto_denials).
% 1.06/1.34 % set(auto) -> set(auto_process).
% 1.06/1.34 % set(auto2) -> assign(new_constants, 1).
% 1.06/1.34 % set(auto2) -> assign(fold_denial_max, 3).
% 1.06/1.34 % set(auto2) -> assign(max_weight, "200.000").
% 1.06/1.34 % set(auto2) -> assign(max_hours, 1).
% 1.06/1.34 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.06/1.34 % set(auto2) -> assign(max_seconds, 0).
% 1.06/1.34 % set(auto2) -> assign(max_minutes, 5).
% 1.06/1.34 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.06/1.34 % set(auto2) -> set(sort_initial_sos).
% 1.06/1.34 % set(auto2) -> assign(sos_limit, -1).
% 1.06/1.34 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.06/1.34 % set(auto2) -> assign(max_megs, 400).
% 1.06/1.34 % set(auto2) -> assign(stats, some).
% 1.06/1.34 % set(auto2) -> clear(echo_input).
% 1.06/1.34 % set(auto2) -> set(quiet).
% 1.06/1.34 % set(auto2) -> clear(print_initial_clauses).
% 1.06/1.34 % set(auto2) -> clear(print_given).
% 1.06/1.34 assign(lrs_ticks,-1).
% 1.06/1.34 assign(sos_limit,10000).
% 1.06/1.34 assign(order,kbo).
% 1.06/1.34 set(lex_order_vars).
% 1.06/1.34 clear(print_given).
% 1.06/1.34
% 1.06/1.34 % formulas(sos). % not echoed (3 formulas)
% 1.06/1.34
% 1.06/1.34 ============================== end of input ==========================
% 1.06/1.34
% 1.06/1.34 % From the command line: assign(max_seconds, 300).
% 1.06/1.34
% 1.06/1.34 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.06/1.34
% 1.06/1.34 % Formulas that are not ordinary clauses:
% 1.06/1.34
% 1.06/1.34 ============================== end of process non-clausal formulas ===
% 1.06/1.34
% 1.06/1.34 ============================== PROCESS INITIAL CLAUSES ===============
% 1.06/1.34
% 1.06/1.34 ============================== PREDICATE ELIMINATION =================
% 1.06/1.34
% 1.06/1.34 ============================== end predicate elimination =============
% 1.06/1.34
% 1.06/1.34 Auto_denials:
% 1.06/1.34 % copying label an_3 to answer in negative clause
% 1.06/1.34
% 1.06/1.34 Term ordering decisions:
% 1.06/1.34
% 1.06/1.34 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 1.06/1.34 Function symbol KB weights: a=1. b=1. or=1. not=0.
% 1.06/1.34
% 1.06/1.34 ============================== end of process initial clauses ========
% 1.06/1.34
% 1.06/1.34 ============================== CLAUSES FOR SEARCH ====================
% 1.06/1.34
% 1.06/1.34 ============================== end of clauses for search =============
% 1.06/1.34
% 1.06/1.34 ============================== SEARCH ================================
% 1.06/1.34
% 1.06/1.34 % Starting search at 0.01 seconds.
% 1.06/1.34
% 1.06/1.34 ============================== PROOF =================================
% 1.06/1.34 % SZS status Unsatisfiable
% 1.06/1.34 % SZS output start Refutation
% 1.06/1.34
% 1.06/1.34 % Proof 1 at 0.37 (+ 0.01) seconds: an_3.
% 1.06/1.34 % Length of proof is 46.
% 1.06/1.34 % Level of proof is 38.
% 1.06/1.34 % Maximum clause weight is 26.000.
% 1.06/1.34 % Given clauses 166.
% 1.06/1.34
% 1.06/1.34 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].
% 1.06/1.34 2 -is_a_theorem(or(not(a),or(b,a))) # label(an_3) # label(negated_conjecture) # answer(an_3). [assumption].
% 1.06/1.34 3 -is_a_theorem(or(not(A),B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 131 is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))). [hyper(3,a,110,a,b,110,a)].
% 1.06/1.34 158 is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))). [hyper(3,a,1,a,b,131,a)].
% 1.06/1.34 170 is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))). [hyper(3,a,1,a,b,158,a)].
% 1.06/1.34 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)].
% 1.06/1.34 247 is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))). [hyper(3,a,185,a,b,185,a)].
% 1.06/1.34 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)].
% 1.06/1.34 260 is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))). [hyper(3,a,1,a,b,247,a)].
% 1.06/1.34 279 is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))). [hyper(3,a,1,a,b,260,a)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 2163 is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))). [hyper(3,a,1958,a,b,1958,a)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 2622 is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))). [hyper(3,a,2240,a,b,2240,a)].
% 1.06/1.34 2676 is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))). [hyper(3,a,1,a,b,2622,a)].
% 1.06/1.34 2724 is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))). [hyper(3,a,259,a,b,2676,a)].
% 1.06/1.34 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)].
% 1.06/1.34 2832 is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))). [hyper(3,a,2724,a,b,2724,a)].
% 1.06/1.34 2842 is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))). [hyper(3,a,279,a,b,2832,a)].
% 1.06/1.34 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)].
% 1.06/1.34 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)].
% 1.06/1.34 3192 is_a_theorem(or(A,or(B,or(C,or(D,not(D)))))). [hyper(3,a,3166,a,b,2730,a)].
% 1.06/1.34 3203 is_a_theorem(or(A,or(B,or(not(C),or(C,D))))). [hyper(3,a,3166,a,b,260,a)].
% 1.06/1.34 3291 is_a_theorem(or(A,or(B,or(C,not(C))))). [hyper(3,a,3192,a,b,3192,a)].
% 1.06/1.34 3310 is_a_theorem(or(A,or(B,not(B)))). [hyper(3,a,3291,a,b,3291,a)].
% 1.06/1.34 3315 is_a_theorem(or(A,not(A))). [hyper(3,a,3310,a,b,3310,a)].
% 1.06/1.34 3320 is_a_theorem(not(not(or(A,not(A))))). [hyper(3,a,3315,a,b,3315,a)].
% 1.06/1.34 3754 is_a_theorem(or(A,or(not(B),or(B,C)))). [hyper(3,a,3203,a,b,3203,a)].
% 1.06/1.34 3758 is_a_theorem(or(not(A),or(A,B))). [hyper(3,a,3754,a,b,3754,a)].
% 1.06/1.34 3801 is_a_theorem(or(not(not(or(A,not(A)))),B)). [hyper(3,a,3758,a,b,3320,a)].
% 1.06/1.34 3981 is_a_theorem(or(not(A),or(B,A))). [hyper(3,a,247,a,b,3801,a)].
% 1.06/1.34 3982 $F # answer(an_3). [resolve(3981,a,2,a)].
% 1.06/1.34
% 1.06/1.34 % SZS output end Refutation
% 1.06/1.34 ============================== end of proof ==========================
% 1.06/1.34
% 1.06/1.34 ============================== STATISTICS ============================
% 1.06/1.34
% 1.06/1.34 Given=166. Generated=8941. Kept=3981. proofs=1.
% 1.06/1.34 Usable=71. Sos=906. Demods=0. Limbo=8, Disabled=2998. Hints=0.
% 1.06/1.34 Megabytes=3.54.
% 1.06/1.34 User_CPU=0.37, System_CPU=0.01, Wall_clock=0.
% 1.06/1.34
% 1.06/1.34 ============================== end of statistics =====================
% 1.06/1.34
% 1.06/1.34 ============================== end of search =========================
% 1.06/1.34
% 1.06/1.34 THEOREM PROVED
% 1.06/1.34 % SZS status Unsatisfiable
% 1.06/1.34
% 1.06/1.34 Exiting with 1 proof.
% 1.06/1.34
% 1.06/1.34 Process 6752 exit (max_proofs) Sun Jul 3 11:11:38 2022
% 1.06/1.34 Prover9 interrupted
%------------------------------------------------------------------------------