TSTP Solution File: LCL125-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL125-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:13 EDT 2022
% Result : Unsatisfiable 26.04s 26.29s
% Output : Refutation 26.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL125-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 08:23:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 26.04/26.29 ============================== Prover9 ===============================
% 26.04/26.29 Prover9 (32) version 2009-11A, November 2009.
% 26.04/26.29 Process 32596 was started by sandbox on n029.cluster.edu,
% 26.04/26.29 Mon Jul 4 08:23:57 2022
% 26.04/26.29 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32443_n029.cluster.edu".
% 26.04/26.29 ============================== end of head ===========================
% 26.04/26.29
% 26.04/26.29 ============================== INPUT =================================
% 26.04/26.29
% 26.04/26.29 % Reading from file /tmp/Prover9_32443_n029.cluster.edu
% 26.04/26.29
% 26.04/26.29 set(prolog_style_variables).
% 26.04/26.29 set(auto2).
% 26.04/26.29 % set(auto2) -> set(auto).
% 26.04/26.29 % set(auto) -> set(auto_inference).
% 26.04/26.29 % set(auto) -> set(auto_setup).
% 26.04/26.29 % set(auto_setup) -> set(predicate_elim).
% 26.04/26.29 % set(auto_setup) -> assign(eq_defs, unfold).
% 26.04/26.29 % set(auto) -> set(auto_limits).
% 26.04/26.29 % set(auto_limits) -> assign(max_weight, "100.000").
% 26.04/26.29 % set(auto_limits) -> assign(sos_limit, 20000).
% 26.04/26.29 % set(auto) -> set(auto_denials).
% 26.04/26.29 % set(auto) -> set(auto_process).
% 26.04/26.29 % set(auto2) -> assign(new_constants, 1).
% 26.04/26.29 % set(auto2) -> assign(fold_denial_max, 3).
% 26.04/26.29 % set(auto2) -> assign(max_weight, "200.000").
% 26.04/26.29 % set(auto2) -> assign(max_hours, 1).
% 26.04/26.29 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 26.04/26.29 % set(auto2) -> assign(max_seconds, 0).
% 26.04/26.29 % set(auto2) -> assign(max_minutes, 5).
% 26.04/26.29 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 26.04/26.29 % set(auto2) -> set(sort_initial_sos).
% 26.04/26.29 % set(auto2) -> assign(sos_limit, -1).
% 26.04/26.29 % set(auto2) -> assign(lrs_ticks, 3000).
% 26.04/26.29 % set(auto2) -> assign(max_megs, 400).
% 26.04/26.29 % set(auto2) -> assign(stats, some).
% 26.04/26.29 % set(auto2) -> clear(echo_input).
% 26.04/26.29 % set(auto2) -> set(quiet).
% 26.04/26.29 % set(auto2) -> clear(print_initial_clauses).
% 26.04/26.29 % set(auto2) -> clear(print_given).
% 26.04/26.29 assign(lrs_ticks,-1).
% 26.04/26.29 assign(sos_limit,10000).
% 26.04/26.29 assign(order,kbo).
% 26.04/26.29 set(lex_order_vars).
% 26.04/26.29 clear(print_given).
% 26.04/26.29
% 26.04/26.29 % formulas(sos). % not echoed (4 formulas)
% 26.04/26.29
% 26.04/26.29 ============================== end of input ==========================
% 26.04/26.29
% 26.04/26.29 % From the command line: assign(max_seconds, 300).
% 26.04/26.29
% 26.04/26.29 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 26.04/26.29
% 26.04/26.29 % Formulas that are not ordinary clauses:
% 26.04/26.29
% 26.04/26.29 ============================== end of process non-clausal formulas ===
% 26.04/26.29
% 26.04/26.29 ============================== PROCESS INITIAL CLAUSES ===============
% 26.04/26.29
% 26.04/26.29 ============================== PREDICATE ELIMINATION =================
% 26.04/26.29
% 26.04/26.29 ============================== end predicate elimination =============
% 26.04/26.29
% 26.04/26.29 Auto_denials:
% 26.04/26.29 % copying label prove_lg_2 to answer in negative clause
% 26.04/26.29
% 26.04/26.29 Term ordering decisions:
% 26.04/26.29 Function symbol KB weights: a=1. b=1. c=1. e=1. equivalent=1.
% 26.04/26.29
% 26.04/26.29 ============================== end of process initial clauses ========
% 26.04/26.29
% 26.04/26.29 ============================== CLAUSES FOR SEARCH ====================
% 26.04/26.29
% 26.04/26.29 ============================== end of clauses for search =============
% 26.04/26.29
% 26.04/26.29 ============================== SEARCH ================================
% 26.04/26.29
% 26.04/26.29 % Starting search at 0.01 seconds.
% 26.04/26.29
% 26.04/26.29 Low Water (keep): wt=44.000, iters=3354
% 26.04/26.29
% 26.04/26.29 Low Water (keep): wt=40.000, iters=3355
% 26.04/26.29
% 26.04/26.29 Low Water (keep): wt=36.000, iters=3343
% 26.04/26.29
% 26.04/26.29 Low Water (keep): wt=32.000, iters=3357
% 26.04/26.29
% 26.04/26.29 Low Water (keep): wt=28.000, iters=3370
% 26.04/26.29
% 26.04/26.29 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 44 (0.00 of 2.01 sec).
% 26.04/26.29
% 26.04/26.29 Low Water (keep): wt=24.000, iters=3354
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=3168, wt=56.000
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=3170, wt=52.000
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=5305, wt=48.000
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=5386, wt=44.000
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=5631, wt=40.000
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=11029, wt=20.000
% 26.04/26.29
% 26.04/26.29 Low Water (displace): id=11456, wt=16.000
% 26.04/26.29
% 26.04/26.29 ============================== PROOF =================================
% 26.04/26.29 % SZS status Unsatisfiable
% 26.04/26.29 % SZS output start Refutation
% 26.04/26.29
% 26.04/26.29 % Proof 1 at 22.70 (+ 2.63) seconds: prove_lg_2.
% 26.04/26.29 % Length of proof is 37.
% 26.04/26.29 % Level of proof is 17.
% 26.04/26.29 % Maximum clause weight is 20.000.
% 26.04/26.29 % Given clauses 3054.
% 26.04/26.29
% 26.04/26.29 1 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))) # label(q_2) # label(axiom). [assumption].
% 26.04/26.29 2 is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))) # label(q_3) # label(axiom). [assumption].
% 26.04/26.29 3 -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].
% 26.04/26.29 4 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 26.04/26.29 5 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B))),equivalent(D,E)),equivalent(E,D))). [hyper(4,a,2,a,b,2,a)].
% 26.04/26.29 6 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C)),equivalent(D,E)),equivalent(E,D))). [hyper(4,a,2,a,b,1,a)].
% 26.04/26.29 9 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)). [hyper(4,a,5,a,b,1,a)].
% 26.04/26.29 11 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A),equivalent(D,E)),equivalent(E,D))). [hyper(4,a,2,a,b,9,a)].
% 26.04/26.29 12 is_a_theorem(equivalent(A,A)). [hyper(4,a,9,a,b,1,a)].
% 26.04/26.29 28 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))). [hyper(4,a,6,a,b,12,a)].
% 26.04/26.29 32 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))). [hyper(4,a,28,a,b,28,a)].
% 26.04/26.29 34 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),D),equivalent(A,D))). [hyper(4,a,5,a,b,28,a)].
% 26.04/26.29 42 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))). [hyper(4,a,28,a,b,1,a)].
% 26.04/26.29 131 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))). [hyper(4,a,32,a,b,28,a)].
% 26.04/26.29 137 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),equivalent(equivalent(C,B),D)),A)). [hyper(4,a,32,a,b,9,a)].
% 26.04/26.29 244 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,D),equivalent(C,equivalent(D,B))))). [hyper(4,a,42,a,b,42,a)].
% 26.04/26.29 630 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),E),equivalent(A,E))). [hyper(4,a,131,a,b,137,a)].
% 26.04/26.29 642 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),A)). [hyper(4,a,1,a,b,137,a)].
% 26.04/26.29 1352 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(equivalent(B,D),equivalent(C,D))))). [hyper(4,a,42,a,b,244,a)].
% 26.04/26.29 1359 is_a_theorem(equivalent(A,equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,equivalent(D,C)))))). [hyper(4,a,34,a,b,244,a)].
% 26.04/26.29 1360 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(D,C)),equivalent(equivalent(A,E),equivalent(D,equivalent(E,B))))). [hyper(4,a,32,a,b,244,a)].
% 26.04/26.29 1367 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,equivalent(D,C)),B))). [hyper(4,a,11,a,b,244,a)].
% 26.04/26.29 1385 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),E),equivalent(A,equivalent(E,equivalent(equivalent(C,B),D))))). [hyper(4,a,244,a,b,137,a)].
% 26.04/26.29 2004 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),E),equivalent(A,equivalent(E,D)))). [hyper(4,a,244,a,b,642,a)].
% 26.04/26.29 2727 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(D,C))),equivalent(A,B))). [hyper(4,a,1367,a,b,1359,a)].
% 26.04/26.29 2729 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,D))),equivalent(A,C))). [hyper(4,a,1367,a,b,1352,a)].
% 26.04/26.29 10357 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),E)),equivalent(equivalent(A,equivalent(equivalent(D,C),E)),B))). [hyper(4,a,2004,a,b,2004,a)].
% 26.04/26.29 10367 is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))). [hyper(4,a,630,a,b,2004,a)].
% 26.04/26.29 10411 is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)). [hyper(4,a,2727,a,b,10367,a)].
% 26.04/26.29 10583 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,C),B)),A)). [hyper(4,a,2729,a,b,10411,a)].
% 26.04/26.29 11003 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),D),equivalent(A,equivalent(D,C)))). [hyper(4,a,1360,a,b,10583,a)].
% 26.04/26.29 13892 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),D),equivalent(equivalent(A,equivalent(E,C)),equivalent(D,E)))). [hyper(4,a,244,a,b,11003,a)].
% 26.04/26.29 13896 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),D),E),equivalent(equivalent(A,equivalent(D,C)),E))). [hyper(4,a,28,a,b,11003,a)].
% 26.04/26.29 24754 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))). [hyper(4,a,13896,a,b,13892,a)].
% 26.04/26.29 24783 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,D),equivalent(B,D))),A)). [hyper(4,a,10357,a,b,24754,a)].
% 26.04/26.29 24845 is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))). [hyper(4,a,1385,a,b,24783,a)].
% 26.04/26.29 24846 $F # answer(prove_lg_2). [resolve(24845,a,3,a)].
% 26.04/26.29
% 26.04/26.29 % SZS output end Refutation
% 26.04/26.29 ============================== end of proof ==========================
% 26.04/26.29
% 26.04/26.29 ============================== STATISTICS ============================
% 26.04/26.29
% 26.04/26.29 Given=3054. Generated=5337681. Kept=24845. proofs=1.
% 26.04/26.29 Usable=3054. Sos=9318. Demods=0. Limbo=35, Disabled=12441. Hints=0.
% 26.04/26.29 Megabytes=16.80.
% 26.04/26.29 User_CPU=22.70, System_CPU=2.63, Wall_clock=25.
% 26.04/26.29
% 26.04/26.29 ============================== end of statistics =====================
% 26.04/26.29
% 26.04/26.29 ============================== end of search =========================
% 26.04/26.29
% 26.04/26.29 THEOREM PROVED
% 26.04/26.29 % SZS status Unsatisfiable
% 26.04/26.29
% 26.04/26.29 Exiting with 1 proof.
% 26.04/26.29
% 26.04/26.29 Process 32596 exit (max_proofs) Mon Jul 4 08:24:22 2022
% 26.04/26.29 Prover9 interrupted
%------------------------------------------------------------------------------