TSTP Solution File: LCL024-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LCL024-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n017.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:28 EDT 2022

% Result   : Unsatisfiable 5.80s 6.10s
% Output   : Refutation 5.80s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL024-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 11:58:42 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 5.80/6.10  ============================== Prover9 ===============================
% 5.80/6.10  Prover9 (32) version 2009-11A, November 2009.
% 5.80/6.10  Process 12279 was started by sandbox on n017.cluster.edu,
% 5.80/6.10  Mon Jul  4 11:58:43 2022
% 5.80/6.10  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12126_n017.cluster.edu".
% 5.80/6.10  ============================== end of head ===========================
% 5.80/6.10  
% 5.80/6.10  ============================== INPUT =================================
% 5.80/6.10  
% 5.80/6.10  % Reading from file /tmp/Prover9_12126_n017.cluster.edu
% 5.80/6.10  
% 5.80/6.10  set(prolog_style_variables).
% 5.80/6.10  set(auto2).
% 5.80/6.10      % set(auto2) -> set(auto).
% 5.80/6.10      % set(auto) -> set(auto_inference).
% 5.80/6.10      % set(auto) -> set(auto_setup).
% 5.80/6.10      % set(auto_setup) -> set(predicate_elim).
% 5.80/6.10      % set(auto_setup) -> assign(eq_defs, unfold).
% 5.80/6.10      % set(auto) -> set(auto_limits).
% 5.80/6.10      % set(auto_limits) -> assign(max_weight, "100.000").
% 5.80/6.10      % set(auto_limits) -> assign(sos_limit, 20000).
% 5.80/6.10      % set(auto) -> set(auto_denials).
% 5.80/6.10      % set(auto) -> set(auto_process).
% 5.80/6.10      % set(auto2) -> assign(new_constants, 1).
% 5.80/6.10      % set(auto2) -> assign(fold_denial_max, 3).
% 5.80/6.10      % set(auto2) -> assign(max_weight, "200.000").
% 5.80/6.10      % set(auto2) -> assign(max_hours, 1).
% 5.80/6.10      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.80/6.10      % set(auto2) -> assign(max_seconds, 0).
% 5.80/6.10      % set(auto2) -> assign(max_minutes, 5).
% 5.80/6.10      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.80/6.10      % set(auto2) -> set(sort_initial_sos).
% 5.80/6.10      % set(auto2) -> assign(sos_limit, -1).
% 5.80/6.10      % set(auto2) -> assign(lrs_ticks, 3000).
% 5.80/6.10      % set(auto2) -> assign(max_megs, 400).
% 5.80/6.10      % set(auto2) -> assign(stats, some).
% 5.80/6.10      % set(auto2) -> clear(echo_input).
% 5.80/6.10      % set(auto2) -> set(quiet).
% 5.80/6.10      % set(auto2) -> clear(print_initial_clauses).
% 5.80/6.10      % set(auto2) -> clear(print_given).
% 5.80/6.10  assign(lrs_ticks,-1).
% 5.80/6.10  assign(sos_limit,10000).
% 5.80/6.10  assign(order,kbo).
% 5.80/6.10  set(lex_order_vars).
% 5.80/6.10  clear(print_given).
% 5.80/6.10  
% 5.80/6.10  % formulas(sos).  % not echoed (3 formulas)
% 5.80/6.10  
% 5.80/6.10  ============================== end of input ==========================
% 5.80/6.10  
% 5.80/6.10  % From the command line: assign(max_seconds, 300).
% 5.80/6.10  
% 5.80/6.10  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.80/6.10  
% 5.80/6.10  % Formulas that are not ordinary clauses:
% 5.80/6.10  
% 5.80/6.10  ============================== end of process non-clausal formulas ===
% 5.80/6.10  
% 5.80/6.10  ============================== PROCESS INITIAL CLAUSES ===============
% 5.80/6.10  
% 5.80/6.10  ============================== PREDICATE ELIMINATION =================
% 5.80/6.10  
% 5.80/6.10  ============================== end predicate elimination =============
% 5.80/6.10  
% 5.80/6.10  Auto_denials:
% 5.80/6.10    % copying label prove_pyo to answer in negative clause
% 5.80/6.10  
% 5.80/6.10  Term ordering decisions:
% 5.80/6.10  Function symbol KB weights:  a=1. b=1. c=1. equivalent=1.
% 5.80/6.10  
% 5.80/6.10  ============================== end of process initial clauses ========
% 5.80/6.10  
% 5.80/6.10  ============================== CLAUSES FOR SEARCH ====================
% 5.80/6.10  
% 5.80/6.10  ============================== end of clauses for search =============
% 5.80/6.10  
% 5.80/6.10  ============================== SEARCH ================================
% 5.80/6.10  
% 5.80/6.10  % Starting search at 0.01 seconds.
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=48.000, iters=3336
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=44.000, iters=3410
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=40.000, iters=3401
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=36.000, iters=3369
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=32.000, iters=3428
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=28.000, iters=3346
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=24.000, iters=3394
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=1700, wt=76.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=5133, wt=68.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=5563, wt=64.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=5127, wt=60.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=5557, wt=56.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=5558, wt=52.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=10401, wt=20.000
% 5.80/6.10  
% 5.80/6.10  Low Water (displace): id=10563, wt=16.000
% 5.80/6.10  
% 5.80/6.10  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 2.10 sec).
% 5.80/6.10  
% 5.80/6.10  Low Water (keep): wt=20.000, iters=3365
% 5.80/6.10  
% 5.80/6.10  ============================== PROOF =================================
% 5.80/6.10  % SZS status Unsatisfiable
% 5.80/6.10  % SZS output start Refutation
% 5.80/6.10  
% 5.80/6.10  % Proof 1 at 4.72 (+ 0.40) seconds: prove_pyo.
% 5.80/6.10  % Length of proof is 29.
% 5.80/6.10  % Level of proof is 19.
% 5.80/6.10  % Maximum clause weight is 28.000.
% 5.80/6.10  % Given clauses 1258.
% 5.80/6.10  
% 5.80/6.10  1 is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,A)),equivalent(C,B)))) # label(xgk) # label(axiom).  [assumption].
% 5.80/6.10  2 -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))) # label(prove_pyo) # label(negated_conjecture) # answer(prove_pyo).  [assumption].
% 5.80/6.10  3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 5.80/6.10  4 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(D,equivalent(E,C)),equivalent(E,D))))),equivalent(B,A))).  [hyper(3,a,1,a,b,1,a)].
% 5.80/6.10  7 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(C,D)),D)).  [hyper(3,a,4,a,b,1,a)].
% 5.80/6.10  8 is_a_theorem(equivalent(A,A)).  [hyper(3,a,7,a,b,7,a)].
% 5.80/6.10  9 is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(C,B)),equivalent(D,equivalent(A,equivalent(E,equivalent(equivalent(F,equivalent(V6,E)),equivalent(V6,F)))))))).  [hyper(3,a,4,a,b,7,a)].
% 5.80/6.10  13 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(B,A))).  [hyper(3,a,1,a,b,8,a)].
% 5.80/6.10  17 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,equivalent(E,E))),equivalent(D,C)))),equivalent(B,A))).  [hyper(3,a,1,a,b,13,a)].
% 5.80/6.10  21 is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).  [hyper(3,a,13,a,b,1,a)].
% 5.80/6.10  42 is_a_theorem(equivalent(A,equivalent(B,equivalent(B,equivalent(A,equivalent(C,C)))))).  [hyper(3,a,13,a,b,21,a)].
% 5.80/6.10  45 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(C,D)),D))),equivalent(B,A))).  [hyper(3,a,1,a,b,21,a)].
% 5.80/6.10  101 is_a_theorem(equivalent(A,equivalent(B,equivalent(B,A)))).  [hyper(3,a,4,a,b,42,a)].
% 5.80/6.10  135 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(equivalent(equivalent(D,equivalent(E,F)),equivalent(E,D)),equivalent(F,C)))).  [hyper(3,a,4,a,b,9,a)].
% 5.80/6.10  159 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(D,equivalent(D,C))))),equivalent(B,A))).  [hyper(3,a,1,a,b,101,a)].
% 5.80/6.10  741 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(A,equivalent(C,C))),D)),D)).  [hyper(3,a,17,a,b,1,a)].
% 5.80/6.10  796 is_a_theorem(equivalent(A,equivalent(B,equivalent(B,equivalent(A,equivalent(equivalent(C,equivalent(C,D)),D)))))).  [hyper(3,a,45,a,b,21,a)].
% 5.80/6.10  2102 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(A,B)),equivalent(B,C)),C)).  [hyper(3,a,159,a,b,1,a)].
% 5.80/6.10  9314 is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(C,B)),A)))).  [hyper(3,a,4,a,b,796,a)].
% 5.80/6.10  9372 is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(C,equivalent(C,B)))).  [hyper(3,a,2102,a,b,9314,a)].
% 5.80/6.10  9590 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,equivalent(C,C))),B)).  [hyper(3,a,741,a,b,9372,a)].
% 5.80/6.10  11843 is_a_theorem(equivalent(A,equivalent(B,equivalent(A,B)))).  [hyper(3,a,9590,a,b,135,a)].
% 5.80/6.10  11965 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(D,equivalent(C,D))))),equivalent(B,A))).  [hyper(3,a,1,a,b,11843,a)].
% 5.80/6.10  15105 is_a_theorem(equivalent(A,equivalent(B,equivalent(B,equivalent(C,equivalent(A,C)))))).  [hyper(3,a,11965,a,b,9372,a)].
% 5.80/6.10  16191 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,equivalent(C,C))),A)).  [hyper(3,a,17,a,b,15105,a)].
% 5.80/6.10  17693 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(A,C)),C))).  [hyper(3,a,16191,a,b,135,a)].
% 5.80/6.10  17712 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(equivalent(B,A),D)),D)).  [hyper(3,a,17693,a,b,17693,a)].
% 5.80/6.10  18136 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(B,A))).  [hyper(3,a,17712,a,b,11843,a)].
% 5.80/6.10  18137 $F # answer(prove_pyo).  [resolve(18136,a,2,a)].
% 5.80/6.10  
% 5.80/6.10  % SZS output end Refutation
% 5.80/6.10  ============================== end of proof ==========================
% 5.80/6.10  
% 5.80/6.10  ============================== STATISTICS ============================
% 5.80/6.10  
% 5.80/6.10  Given=1258. Generated=845964. Kept=18136. proofs=1.
% 5.80/6.10  Usable=1258. Sos=9762. Demods=0. Limbo=18, Disabled=7100. Hints=0.
% 5.80/6.10  Megabytes=13.49.
% 5.80/6.10  User_CPU=4.72, System_CPU=0.40, Wall_clock=5.
% 5.80/6.10  
% 5.80/6.10  ============================== end of statistics =====================
% 5.80/6.10  
% 5.80/6.10  ============================== end of search =========================
% 5.80/6.10  
% 5.80/6.10  THEOREM PROVED
% 5.80/6.10  % SZS status Unsatisfiable
% 5.80/6.10  
% 5.80/6.10  Exiting with 1 proof.
% 5.80/6.10  
% 5.80/6.10  Process 12279 exit (max_proofs) Mon Jul  4 11:58:48 2022
% 5.80/6.10  Prover9 interrupted
%------------------------------------------------------------------------------