TSTP Solution File: LCL123-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.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:44:13 EDT 2022
% Result : Unsatisfiable 5.34s 5.62s
% Output : Refutation 5.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.04/0.13 % 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 : Sat Jul 2 13:58:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 5.34/5.62 ============================== Prover9 ===============================
% 5.34/5.62 Prover9 (32) version 2009-11A, November 2009.
% 5.34/5.62 Process 28860 was started by sandbox on n010.cluster.edu,
% 5.34/5.62 Sat Jul 2 13:58:49 2022
% 5.34/5.62 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28707_n010.cluster.edu".
% 5.34/5.62 ============================== end of head ===========================
% 5.34/5.62
% 5.34/5.62 ============================== INPUT =================================
% 5.34/5.62
% 5.34/5.62 % Reading from file /tmp/Prover9_28707_n010.cluster.edu
% 5.34/5.62
% 5.34/5.62 set(prolog_style_variables).
% 5.34/5.62 set(auto2).
% 5.34/5.62 % set(auto2) -> set(auto).
% 5.34/5.62 % set(auto) -> set(auto_inference).
% 5.34/5.62 % set(auto) -> set(auto_setup).
% 5.34/5.62 % set(auto_setup) -> set(predicate_elim).
% 5.34/5.62 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.34/5.62 % set(auto) -> set(auto_limits).
% 5.34/5.62 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.34/5.62 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.34/5.62 % set(auto) -> set(auto_denials).
% 5.34/5.62 % set(auto) -> set(auto_process).
% 5.34/5.62 % set(auto2) -> assign(new_constants, 1).
% 5.34/5.62 % set(auto2) -> assign(fold_denial_max, 3).
% 5.34/5.62 % set(auto2) -> assign(max_weight, "200.000").
% 5.34/5.62 % set(auto2) -> assign(max_hours, 1).
% 5.34/5.62 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.34/5.62 % set(auto2) -> assign(max_seconds, 0).
% 5.34/5.62 % set(auto2) -> assign(max_minutes, 5).
% 5.34/5.62 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.34/5.62 % set(auto2) -> set(sort_initial_sos).
% 5.34/5.62 % set(auto2) -> assign(sos_limit, -1).
% 5.34/5.62 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.34/5.62 % set(auto2) -> assign(max_megs, 400).
% 5.34/5.62 % set(auto2) -> assign(stats, some).
% 5.34/5.62 % set(auto2) -> clear(echo_input).
% 5.34/5.62 % set(auto2) -> set(quiet).
% 5.34/5.62 % set(auto2) -> clear(print_initial_clauses).
% 5.34/5.62 % set(auto2) -> clear(print_given).
% 5.34/5.62 assign(lrs_ticks,-1).
% 5.34/5.62 assign(sos_limit,10000).
% 5.34/5.62 assign(order,kbo).
% 5.34/5.62 set(lex_order_vars).
% 5.34/5.62 clear(print_given).
% 5.34/5.62
% 5.34/5.62 % formulas(sos). % not echoed (3 formulas)
% 5.34/5.62
% 5.34/5.62 ============================== end of input ==========================
% 5.34/5.62
% 5.34/5.62 % From the command line: assign(max_seconds, 300).
% 5.34/5.62
% 5.34/5.62 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.34/5.62
% 5.34/5.62 % Formulas that are not ordinary clauses:
% 5.34/5.62
% 5.34/5.62 ============================== end of process non-clausal formulas ===
% 5.34/5.62
% 5.34/5.62 ============================== PROCESS INITIAL CLAUSES ===============
% 5.34/5.62
% 5.34/5.62 ============================== PREDICATE ELIMINATION =================
% 5.34/5.62
% 5.34/5.62 ============================== end predicate elimination =============
% 5.34/5.62
% 5.34/5.62 Auto_denials:
% 5.34/5.62 % copying label prove_lg_4 to answer in negative clause
% 5.34/5.62
% 5.34/5.62 Term ordering decisions:
% 5.34/5.62 Function symbol KB weights: a=1. b=1. c=1. e=1. f=1. equivalent=1.
% 5.34/5.62
% 5.34/5.62 ============================== end of process initial clauses ========
% 5.34/5.62
% 5.34/5.62 ============================== CLAUSES FOR SEARCH ====================
% 5.34/5.62
% 5.34/5.62 ============================== end of clauses for search =============
% 5.34/5.62
% 5.34/5.62 ============================== SEARCH ================================
% 5.34/5.62
% 5.34/5.62 % Starting search at 0.01 seconds.
% 5.34/5.62
% 5.34/5.62 Low Water (keep): wt=44.000, iters=3355
% 5.34/5.62
% 5.34/5.62 Low Water (keep): wt=40.000, iters=3334
% 5.34/5.62
% 5.34/5.62 Low Water (keep): wt=36.000, iters=3429
% 5.34/5.62
% 5.34/5.62 Low Water (keep): wt=32.000, iters=3351
% 5.34/5.62
% 5.34/5.62 Low Water (keep): wt=28.000, iters=3347
% 5.34/5.62
% 5.34/5.62 Low Water (keep): wt=24.000, iters=3335
% 5.34/5.62
% 5.34/5.62 Low Water (displace): id=5575, wt=76.000
% 5.34/5.62
% 5.34/5.62 Low Water (displace): id=5577, wt=68.000
% 5.34/5.62
% 5.34/5.62 Low Water (displace): id=5455, wt=64.000
% 5.34/5.62
% 5.34/5.62 Low Water (displace): id=5572, wt=60.000
% 5.34/5.62
% 5.34/5.62 Low Water (displace): id=5588, wt=56.000
% 5.34/5.62
% 5.34/5.62 Low Water (displace): id=10531, wt=20.000
% 5.34/5.62
% 5.34/5.62 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 988 (0.00 of 1.99 sec).
% 5.34/5.62
% 5.34/5.62 ============================== PROOF =================================
% 5.34/5.62 % SZS status Unsatisfiable
% 5.34/5.62 % SZS output start Refutation
% 5.34/5.62
% 5.34/5.62 % Proof 1 at 4.33 (+ 0.33) seconds: prove_lg_4.
% 5.34/5.62 % Length of proof is 26.
% 5.34/5.62 % Level of proof is 18.
% 5.34/5.62 % Maximum clause weight is 28.000.
% 5.34/5.62 % Given clauses 1131.
% 5.34/5.62
% 5.34/5.62 1 is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))) # label(lg_2) # label(axiom). [assumption].
% 5.34/5.62 2 -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(e,equivalent(b,f))),equivalent(a,equivalent(e,equivalent(c,f))))) # label(prove_lg_4) # label(negated_conjecture) # answer(prove_lg_4). [assumption].
% 5.34/5.62 3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 5.34/5.62 4 is_a_theorem(equivalent(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D))))),equivalent(equivalent(E,F),equivalent(equivalent(E,V6),equivalent(F,V6))))). [hyper(3,a,1,a,b,1,a)].
% 5.34/5.62 6 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))). [hyper(3,a,4,a,b,1,a)].
% 5.34/5.62 7 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))). [hyper(3,a,6,a,b,6,a)].
% 5.34/5.62 14 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))). [hyper(3,a,7,a,b,6,a)].
% 5.34/5.62 17 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,B),C))). [hyper(3,a,14,a,b,14,a)].
% 5.34/5.62 21 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),E),equivalent(equivalent(A,equivalent(B,D)),E))). [hyper(3,a,14,a,b,4,a)].
% 5.34/5.62 22 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(D,C)),equivalent(equivalent(A,B),D))). [hyper(3,a,7,a,b,17,a)].
% 5.34/5.62 30 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))). [hyper(3,a,22,a,b,17,a)].
% 5.34/5.62 31 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(A,equivalent(B,D)))). [hyper(3,a,22,a,b,4,a)].
% 5.34/5.62 32 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))). [hyper(3,a,7,a,b,30,a)].
% 5.34/5.62 35 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))). [hyper(3,a,6,a,b,32,a)].
% 5.34/5.62 37 is_a_theorem(equivalent(A,A)). [hyper(3,a,32,a,b,30,a)].
% 5.34/5.62 49 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(D,C)),equivalent(A,D))). [hyper(3,a,31,a,b,35,a)].
% 5.34/5.62 53 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))). [hyper(3,a,35,a,b,31,a)].
% 5.34/5.62 102 is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))). [hyper(3,a,49,a,b,31,a)].
% 5.34/5.62 127 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(C,C)),B))). [hyper(3,a,14,a,b,102,a)].
% 5.34/5.62 216 is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)). [hyper(3,a,127,a,b,37,a)].
% 5.34/5.62 237 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,B)),C),equivalent(A,C))). [hyper(3,a,14,a,b,216,a)].
% 5.34/5.62 794 is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))). [hyper(3,a,237,a,b,53,a)].
% 5.34/5.62 885 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,equivalent(D,C)),B))). [hyper(3,a,53,a,b,794,a)].
% 5.34/5.62 1392 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,equivalent(C,E))),equivalent(equivalent(B,E),D)))). [hyper(3,a,21,a,b,53,a)].
% 5.34/5.62 12679 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(B,E))),equivalent(A,equivalent(D,equivalent(C,E))))). [hyper(3,a,885,a,b,1392,a)].
% 5.34/5.62 12680 $F # answer(prove_lg_4). [resolve(12679,a,2,a)].
% 5.34/5.62
% 5.34/5.62 % SZS output end Refutation
% 5.34/5.62 ============================== end of proof ==========================
% 5.34/5.62
% 5.34/5.62 ============================== STATISTICS ============================
% 5.34/5.62
% 5.34/5.62 Given=1131. Generated=750980. Kept=12679. proofs=1.
% 5.34/5.62 Usable=1128. Sos=9934. Demods=0. Limbo=5, Disabled=1614. Hints=0.
% 5.34/5.62 Megabytes=10.70.
% 5.34/5.62 User_CPU=4.33, System_CPU=0.33, Wall_clock=4.
% 5.34/5.62
% 5.34/5.62 ============================== end of statistics =====================
% 5.34/5.62
% 5.34/5.62 ============================== end of search =========================
% 5.34/5.62
% 5.34/5.62 THEOREM PROVED
% 5.34/5.62 % SZS status Unsatisfiable
% 5.34/5.62
% 5.34/5.62 Exiting with 1 proof.
% 5.34/5.62
% 5.34/5.62 Process 28860 exit (max_proofs) Sat Jul 2 13:58:53 2022
% 5.34/5.62 Prover9 interrupted
%------------------------------------------------------------------------------