TSTP Solution File: LCL121-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL121-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:12 EDT 2022
% Result : Unsatisfiable 2.13s 2.43s
% Output : Refutation 2.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL121-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n023.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 : Sat Jul 2 17:18:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.13/2.43 ============================== Prover9 ===============================
% 2.13/2.43 Prover9 (32) version 2009-11A, November 2009.
% 2.13/2.43 Process 17321 was started by sandbox on n023.cluster.edu,
% 2.13/2.43 Sat Jul 2 17:18:14 2022
% 2.13/2.43 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17168_n023.cluster.edu".
% 2.13/2.43 ============================== end of head ===========================
% 2.13/2.43
% 2.13/2.43 ============================== INPUT =================================
% 2.13/2.43
% 2.13/2.43 % Reading from file /tmp/Prover9_17168_n023.cluster.edu
% 2.13/2.43
% 2.13/2.43 set(prolog_style_variables).
% 2.13/2.43 set(auto2).
% 2.13/2.43 % set(auto2) -> set(auto).
% 2.13/2.43 % set(auto) -> set(auto_inference).
% 2.13/2.43 % set(auto) -> set(auto_setup).
% 2.13/2.43 % set(auto_setup) -> set(predicate_elim).
% 2.13/2.43 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.13/2.43 % set(auto) -> set(auto_limits).
% 2.13/2.43 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.13/2.43 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.13/2.43 % set(auto) -> set(auto_denials).
% 2.13/2.43 % set(auto) -> set(auto_process).
% 2.13/2.43 % set(auto2) -> assign(new_constants, 1).
% 2.13/2.43 % set(auto2) -> assign(fold_denial_max, 3).
% 2.13/2.43 % set(auto2) -> assign(max_weight, "200.000").
% 2.13/2.43 % set(auto2) -> assign(max_hours, 1).
% 2.13/2.43 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.13/2.43 % set(auto2) -> assign(max_seconds, 0).
% 2.13/2.43 % set(auto2) -> assign(max_minutes, 5).
% 2.13/2.43 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.13/2.43 % set(auto2) -> set(sort_initial_sos).
% 2.13/2.43 % set(auto2) -> assign(sos_limit, -1).
% 2.13/2.43 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.13/2.43 % set(auto2) -> assign(max_megs, 400).
% 2.13/2.43 % set(auto2) -> assign(stats, some).
% 2.13/2.43 % set(auto2) -> clear(echo_input).
% 2.13/2.43 % set(auto2) -> set(quiet).
% 2.13/2.43 % set(auto2) -> clear(print_initial_clauses).
% 2.13/2.43 % set(auto2) -> clear(print_given).
% 2.13/2.43 assign(lrs_ticks,-1).
% 2.13/2.43 assign(sos_limit,10000).
% 2.13/2.43 assign(order,kbo).
% 2.13/2.43 set(lex_order_vars).
% 2.13/2.43 clear(print_given).
% 2.13/2.43
% 2.13/2.43 % formulas(sos). % not echoed (3 formulas)
% 2.13/2.43
% 2.13/2.43 ============================== end of input ==========================
% 2.13/2.43
% 2.13/2.43 % From the command line: assign(max_seconds, 300).
% 2.13/2.43
% 2.13/2.43 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.13/2.43
% 2.13/2.43 % Formulas that are not ordinary clauses:
% 2.13/2.43
% 2.13/2.43 ============================== end of process non-clausal formulas ===
% 2.13/2.43
% 2.13/2.43 ============================== PROCESS INITIAL CLAUSES ===============
% 2.13/2.43
% 2.13/2.43 ============================== PREDICATE ELIMINATION =================
% 2.13/2.43
% 2.13/2.43 ============================== end predicate elimination =============
% 2.13/2.43
% 2.13/2.43 Auto_denials:
% 2.13/2.43 % copying label prove_lg_1 to answer in negative clause
% 2.13/2.43
% 2.13/2.43 Term ordering decisions:
% 2.13/2.43 Function symbol KB weights: a=1. b=1. c=1. equivalent=1.
% 2.13/2.43
% 2.13/2.43 ============================== end of process initial clauses ========
% 2.13/2.43
% 2.13/2.43 ============================== CLAUSES FOR SEARCH ====================
% 2.13/2.43
% 2.13/2.43 ============================== end of clauses for search =============
% 2.13/2.43
% 2.13/2.43 ============================== SEARCH ================================
% 2.13/2.43
% 2.13/2.43 % Starting search at 0.01 seconds.
% 2.13/2.43
% 2.13/2.43 Low Water (keep): wt=44.000, iters=3355
% 2.13/2.43
% 2.13/2.43 Low Water (keep): wt=40.000, iters=3334
% 2.13/2.43
% 2.13/2.43 Low Water (keep): wt=36.000, iters=3429
% 2.13/2.43
% 2.13/2.43 Low Water (keep): wt=32.000, iters=3351
% 2.13/2.43
% 2.13/2.43 Low Water (keep): wt=28.000, iters=3347
% 2.13/2.43
% 2.13/2.43 Low Water (keep): wt=24.000, iters=3335
% 2.13/2.43
% 2.13/2.43 ============================== PROOF =================================
% 2.13/2.43 % SZS status Unsatisfiable
% 2.13/2.43 % SZS output start Refutation
% 2.13/2.43
% 2.13/2.43 % Proof 1 at 1.40 (+ 0.04) seconds: prove_lg_1.
% 2.13/2.43 % Length of proof is 30.
% 2.13/2.43 % Level of proof is 18.
% 2.13/2.43 % Maximum clause weight is 28.000.
% 2.13/2.43 % Given clauses 340.
% 2.13/2.43
% 2.13/2.43 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].
% 2.13/2.43 2 -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)))) # label(prove_lg_1) # label(negated_conjecture) # answer(prove_lg_1). [assumption].
% 2.13/2.43 3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 2.13/2.43 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)].
% 2.13/2.43 6 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))). [hyper(3,a,4,a,b,1,a)].
% 2.13/2.43 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)].
% 2.13/2.43 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)].
% 2.13/2.43 17 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,B),C))). [hyper(3,a,14,a,b,14,a)].
% 2.13/2.43 18 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),C)),equivalent(equivalent(A,E),equivalent(D,E)))). [hyper(3,a,7,a,b,14,a)].
% 2.13/2.43 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)].
% 2.13/2.43 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)].
% 2.13/2.43 30 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))). [hyper(3,a,22,a,b,17,a)].
% 2.13/2.43 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)].
% 2.13/2.43 32 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))). [hyper(3,a,7,a,b,30,a)].
% 2.13/2.43 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)].
% 2.13/2.43 37 is_a_theorem(equivalent(A,A)). [hyper(3,a,32,a,b,30,a)].
% 2.13/2.43 41 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,D))),equivalent(A,C))). [hyper(3,a,31,a,b,31,a)].
% 2.13/2.43 44 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(B,D))),equivalent(equivalent(A,D),C))). [hyper(3,a,31,a,b,7,a)].
% 2.13/2.43 48 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,D),equivalent(C,equivalent(D,B))))). [hyper(3,a,35,a,b,35,a)].
% 2.13/2.43 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)].
% 2.13/2.43 102 is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))). [hyper(3,a,49,a,b,31,a)].
% 2.13/2.43 127 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(C,C)),B))). [hyper(3,a,14,a,b,102,a)].
% 2.13/2.43 216 is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)). [hyper(3,a,127,a,b,37,a)].
% 2.13/2.43 235 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),C),A)). [hyper(3,a,44,a,b,216,a)].
% 2.13/2.43 236 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,C),B)),A)). [hyper(3,a,41,a,b,216,a)].
% 2.13/2.43 474 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),D),equivalent(A,equivalent(D,C)))). [hyper(3,a,48,a,b,235,a)].
% 2.13/2.43 1376 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)). [hyper(3,a,21,a,b,236,a)].
% 2.13/2.43 1429 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),D),equivalent(A,D))). [hyper(3,a,18,a,b,1376,a)].
% 2.13/2.43 9181 is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,equivalent(C,C)),B)))). [hyper(3,a,1429,a,b,474,a)].
% 2.13/2.43 9182 $F # answer(prove_lg_1). [resolve(9181,a,2,a)].
% 2.13/2.43
% 2.13/2.43 % SZS output end Refutation
% 2.13/2.43 ============================== end of proof ==========================
% 2.13/2.43
% 2.13/2.43 ============================== STATISTICS ============================
% 2.13/2.43
% 2.13/2.43 Given=340. Generated=70350. Kept=9181. proofs=1.
% 2.13/2.43 Usable=337. Sos=8824. Demods=0. Limbo=8, Disabled=14. Hints=0.
% 2.13/2.43 Megabytes=8.58.
% 2.13/2.43 User_CPU=1.40, System_CPU=0.04, Wall_clock=1.
% 2.13/2.43
% 2.13/2.43 ============================== end of statistics =====================
% 2.13/2.43
% 2.13/2.43 ============================== end of search =========================
% 2.13/2.43
% 2.13/2.43 THEOREM PROVED
% 2.13/2.43 % SZS status Unsatisfiable
% 2.13/2.43
% 2.13/2.43 Exiting with 1 proof.
% 2.13/2.43
% 2.13/2.43 Process 17321 exit (max_proofs) Sat Jul 2 17:18:15 2022
% 2.13/2.43 Prover9 interrupted
%------------------------------------------------------------------------------