TSTP Solution File: LCL129-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL129-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:15 EDT 2022
% Result : Unsatisfiable 61.13s 61.54s
% Output : Refutation 61.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL129-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.07 % Command : tptp2X_and_run_prover9 %d %s
% 0.06/0.26 % Computer : n007.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Sat Jul 2 15:23:40 EDT 2022
% 0.06/0.26 % CPUTime :
% 61.13/61.54 ============================== Prover9 ===============================
% 61.13/61.54 Prover9 (32) version 2009-11A, November 2009.
% 61.13/61.54 Process 8241 was started by sandbox on n007.cluster.edu,
% 61.13/61.54 Sat Jul 2 15:23:40 2022
% 61.13/61.54 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8076_n007.cluster.edu".
% 61.13/61.54 ============================== end of head ===========================
% 61.13/61.54
% 61.13/61.54 ============================== INPUT =================================
% 61.13/61.54
% 61.13/61.54 % Reading from file /tmp/Prover9_8076_n007.cluster.edu
% 61.13/61.54
% 61.13/61.54 set(prolog_style_variables).
% 61.13/61.54 set(auto2).
% 61.13/61.54 % set(auto2) -> set(auto).
% 61.13/61.54 % set(auto) -> set(auto_inference).
% 61.13/61.54 % set(auto) -> set(auto_setup).
% 61.13/61.54 % set(auto_setup) -> set(predicate_elim).
% 61.13/61.54 % set(auto_setup) -> assign(eq_defs, unfold).
% 61.13/61.54 % set(auto) -> set(auto_limits).
% 61.13/61.54 % set(auto_limits) -> assign(max_weight, "100.000").
% 61.13/61.54 % set(auto_limits) -> assign(sos_limit, 20000).
% 61.13/61.54 % set(auto) -> set(auto_denials).
% 61.13/61.54 % set(auto) -> set(auto_process).
% 61.13/61.54 % set(auto2) -> assign(new_constants, 1).
% 61.13/61.54 % set(auto2) -> assign(fold_denial_max, 3).
% 61.13/61.54 % set(auto2) -> assign(max_weight, "200.000").
% 61.13/61.54 % set(auto2) -> assign(max_hours, 1).
% 61.13/61.54 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 61.13/61.54 % set(auto2) -> assign(max_seconds, 0).
% 61.13/61.54 % set(auto2) -> assign(max_minutes, 5).
% 61.13/61.54 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 61.13/61.54 % set(auto2) -> set(sort_initial_sos).
% 61.13/61.54 % set(auto2) -> assign(sos_limit, -1).
% 61.13/61.54 % set(auto2) -> assign(lrs_ticks, 3000).
% 61.13/61.54 % set(auto2) -> assign(max_megs, 400).
% 61.13/61.54 % set(auto2) -> assign(stats, some).
% 61.13/61.54 % set(auto2) -> clear(echo_input).
% 61.13/61.54 % set(auto2) -> set(quiet).
% 61.13/61.54 % set(auto2) -> clear(print_initial_clauses).
% 61.13/61.54 % set(auto2) -> clear(print_given).
% 61.13/61.54 assign(lrs_ticks,-1).
% 61.13/61.54 assign(sos_limit,10000).
% 61.13/61.54 assign(order,kbo).
% 61.13/61.54 set(lex_order_vars).
% 61.13/61.54 clear(print_given).
% 61.13/61.54
% 61.13/61.54 % formulas(sos). % not echoed (3 formulas)
% 61.13/61.54
% 61.13/61.54 ============================== end of input ==========================
% 61.13/61.54
% 61.13/61.54 % From the command line: assign(max_seconds, 300).
% 61.13/61.54
% 61.13/61.54 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 61.13/61.54
% 61.13/61.54 % Formulas that are not ordinary clauses:
% 61.13/61.54
% 61.13/61.54 ============================== end of process non-clausal formulas ===
% 61.13/61.54
% 61.13/61.54 ============================== PROCESS INITIAL CLAUSES ===============
% 61.13/61.54
% 61.13/61.54 ============================== PREDICATE ELIMINATION =================
% 61.13/61.54
% 61.13/61.54 ============================== end predicate elimination =============
% 61.13/61.54
% 61.13/61.54 Auto_denials:
% 61.13/61.54 % copying label prove_lg_2 to answer in negative clause
% 61.13/61.54
% 61.13/61.54 Term ordering decisions:
% 61.13/61.54 Function symbol KB weights: a=1. b=1. c=1. e=1. equivalent=1.
% 61.13/61.54
% 61.13/61.54 ============================== end of process initial clauses ========
% 61.13/61.54
% 61.13/61.54 ============================== CLAUSES FOR SEARCH ====================
% 61.13/61.54
% 61.13/61.54 ============================== end of clauses for search =============
% 61.13/61.54
% 61.13/61.54 ============================== SEARCH ================================
% 61.13/61.54
% 61.13/61.54 % Starting search at 0.01 seconds.
% 61.13/61.54
% 61.13/61.54 Low Water (keep): wt=40.000, iters=3336
% 61.13/61.54
% 61.13/61.54 Low Water (keep): wt=36.000, iters=3393
% 61.13/61.54
% 61.13/61.54 Low Water (keep): wt=32.000, iters=3389
% 61.13/61.54
% 61.13/61.54 Low Water (keep): wt=28.000, iters=3348
% 61.13/61.54
% 61.13/61.54 Low Water (keep): wt=24.000, iters=3360
% 61.13/61.54
% 61.13/61.54 Low Water (displace): id=4261, wt=48.000
% 61.13/61.54
% 61.13/61.54 Low Water (displace): id=5374, wt=44.000
% 61.13/61.54
% 61.13/61.54 Low Water (displace): id=5391, wt=40.000
% 61.13/61.54
% 61.13/61.54 Low Water (displace): id=10683, wt=20.000
% 61.13/61.54
% 61.13/61.54 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 146 (0.00 of 3.30 sec).
% 61.13/61.54
% 61.13/61.54 ============================== PROOF =================================
% 61.13/61.54 % SZS status Unsatisfiable
% 61.13/61.54 % SZS output start Refutation
% 61.13/61.54
% 61.13/61.54 % Proof 1 at 54.27 (+ 6.29) seconds: prove_lg_2.
% 61.13/61.54 % Length of proof is 26.
% 61.13/61.54 % Level of proof is 13.
% 61.13/61.54 % Maximum clause weight is 24.000.
% 61.13/61.54 % Given clauses 4068.
% 61.13/61.54
% 61.13/61.54 1 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))) # label(s_4) # label(axiom). [assumption].
% 61.13/61.54 2 -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))) # label(prove_lg_2) # label(negated_conjecture) # answer(prove_lg_2). [assumption].
% 61.13/61.54 3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 61.13/61.54 4 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(B,E))),equivalent(equivalent(A,equivalent(E,C)),D))). [hyper(3,a,1,a,b,1,a)].
% 61.13/61.54 5 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(B,E))),equivalent(F,D)),equivalent(equivalent(A,equivalent(E,C)),F))). [hyper(3,a,1,a,b,4,a)].
% 61.13/61.54 6 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,C)))). [hyper(3,a,4,a,b,1,a)].
% 61.13/61.54 7 is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)). [hyper(3,a,4,a,b,6,a)].
% 61.13/61.54 9 is_a_theorem(equivalent(equivalent(A,A),equivalent(B,B))). [hyper(3,a,7,a,b,7,a)].
% 61.13/61.54 10 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)). [hyper(3,a,4,a,b,7,a)].
% 61.13/61.54 11 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,C)),equivalent(D,B)),equivalent(A,D))). [hyper(3,a,1,a,b,7,a)].
% 61.13/61.54 14 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))). [hyper(3,a,4,a,b,9,a)].
% 61.13/61.54 15 is_a_theorem(equivalent(equivalent(equivalent(A,A),equivalent(B,C)),equivalent(C,B))). [hyper(3,a,1,a,b,9,a)].
% 61.13/61.54 33 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))). [hyper(3,a,15,a,b,1,a)].
% 61.13/61.54 37 is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))). [hyper(3,a,11,a,b,1,a)].
% 61.13/61.54 58 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))). [hyper(3,a,33,a,b,33,a)].
% 61.13/61.54 105 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(equivalent(A,equivalent(D,C)),equivalent(equivalent(E,F),equivalent(D,B))),equivalent(F,E)))). [hyper(3,a,5,a,b,37,a)].
% 61.13/61.54 106 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,equivalent(D,C)),B))). [hyper(3,a,1,a,b,37,a)].
% 61.13/61.54 866 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))). [hyper(3,a,58,a,b,33,a)].
% 61.13/61.54 881 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),C)),equivalent(A,D))). [hyper(3,a,58,a,b,14,a)].
% 61.13/61.54 883 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),equivalent(equivalent(C,B),D)),A)). [hyper(3,a,58,a,b,10,a)].
% 61.13/61.54 9136 is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(D,B)))). [hyper(3,a,881,a,b,105,a)].
% 61.13/61.54 9141 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),E),equivalent(A,E))). [hyper(3,a,866,a,b,883,a)].
% 61.13/61.54 10864 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(B,D),equivalent(C,D))))). [hyper(3,a,106,a,b,9136,a)].
% 61.13/61.54 11889 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,D),equivalent(B,D))),A)). [hyper(3,a,106,a,b,10864,a)].
% 61.13/61.54 14051 is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))). [hyper(3,a,9141,a,b,11889,a)].
% 61.13/61.54 14052 $F # answer(prove_lg_2). [resolve(14051,a,2,a)].
% 61.13/61.54
% 61.13/61.54 % SZS output end Refutation
% 61.13/61.54 ============================== end of proof ==========================
% 61.13/61.54
% 61.13/61.54 ============================== STATISTICS ============================
% 61.13/61.54
% 61.13/61.54 Given=4068. Generated=9288846. Kept=14051. proofs=1.
% 61.13/61.54 Usable=4067. Sos=8176. Demods=0. Limbo=1, Disabled=1809. Hints=0.
% 61.13/61.54 Megabytes=11.70.
% 61.13/61.54 User_CPU=54.27, System_CPU=6.29, Wall_clock=61.
% 61.13/61.54
% 61.13/61.54 ============================== end of statistics =====================
% 61.13/61.54
% 61.13/61.54 ============================== end of search =========================
% 61.13/61.54
% 61.13/61.54 THEOREM PROVED
% 61.13/61.54 % SZS status Unsatisfiable
% 61.13/61.54
% 61.13/61.54 Exiting with 1 proof.
% 61.13/61.54
% 61.13/61.54 Process 8241 exit (max_proofs) Sat Jul 2 15:24:41 2022
% 61.13/61.54 Prover9 interrupted
%------------------------------------------------------------------------------