TSTP Solution File: LCL102-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:01 EDT 2022
% Result : Unsatisfiable 0.98s 1.29s
% Output : Refutation 0.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.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 14:28:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.98/1.29 ============================== Prover9 ===============================
% 0.98/1.29 Prover9 (32) version 2009-11A, November 2009.
% 0.98/1.29 Process 12750 was started by sandbox on n028.cluster.edu,
% 0.98/1.29 Mon Jul 4 14:28:50 2022
% 0.98/1.29 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12597_n028.cluster.edu".
% 0.98/1.29 ============================== end of head ===========================
% 0.98/1.29
% 0.98/1.29 ============================== INPUT =================================
% 0.98/1.29
% 0.98/1.29 % Reading from file /tmp/Prover9_12597_n028.cluster.edu
% 0.98/1.29
% 0.98/1.29 set(prolog_style_variables).
% 0.98/1.29 set(auto2).
% 0.98/1.29 % set(auto2) -> set(auto).
% 0.98/1.29 % set(auto) -> set(auto_inference).
% 0.98/1.29 % set(auto) -> set(auto_setup).
% 0.98/1.29 % set(auto_setup) -> set(predicate_elim).
% 0.98/1.29 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.98/1.29 % set(auto) -> set(auto_limits).
% 0.98/1.29 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.98/1.29 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.98/1.29 % set(auto) -> set(auto_denials).
% 0.98/1.29 % set(auto) -> set(auto_process).
% 0.98/1.29 % set(auto2) -> assign(new_constants, 1).
% 0.98/1.29 % set(auto2) -> assign(fold_denial_max, 3).
% 0.98/1.29 % set(auto2) -> assign(max_weight, "200.000").
% 0.98/1.29 % set(auto2) -> assign(max_hours, 1).
% 0.98/1.29 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.98/1.29 % set(auto2) -> assign(max_seconds, 0).
% 0.98/1.29 % set(auto2) -> assign(max_minutes, 5).
% 0.98/1.29 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.98/1.29 % set(auto2) -> set(sort_initial_sos).
% 0.98/1.29 % set(auto2) -> assign(sos_limit, -1).
% 0.98/1.29 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.98/1.29 % set(auto2) -> assign(max_megs, 400).
% 0.98/1.29 % set(auto2) -> assign(stats, some).
% 0.98/1.29 % set(auto2) -> clear(echo_input).
% 0.98/1.29 % set(auto2) -> set(quiet).
% 0.98/1.29 % set(auto2) -> clear(print_initial_clauses).
% 0.98/1.29 % set(auto2) -> clear(print_given).
% 0.98/1.29 assign(lrs_ticks,-1).
% 0.98/1.29 assign(sos_limit,10000).
% 0.98/1.29 assign(order,kbo).
% 0.98/1.29 set(lex_order_vars).
% 0.98/1.29 clear(print_given).
% 0.98/1.29
% 0.98/1.29 % formulas(sos). % not echoed (5 formulas)
% 0.98/1.29
% 0.98/1.29 ============================== end of input ==========================
% 0.98/1.29
% 0.98/1.29 % From the command line: assign(max_seconds, 300).
% 0.98/1.29
% 0.98/1.29 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.98/1.29
% 0.98/1.29 % Formulas that are not ordinary clauses:
% 0.98/1.29
% 0.98/1.29 ============================== end of process non-clausal formulas ===
% 0.98/1.29
% 0.98/1.29 ============================== PROCESS INITIAL CLAUSES ===============
% 0.98/1.29
% 0.98/1.29 ============================== PREDICATE ELIMINATION =================
% 0.98/1.29
% 0.98/1.29 ============================== end predicate elimination =============
% 0.98/1.29
% 0.98/1.29 Auto_denials:
% 0.98/1.29 % copying label prove_p_1 to answer in negative clause
% 0.98/1.29
% 0.98/1.29 Term ordering decisions:
% 0.98/1.29 Function symbol KB weights: a=1. b=1. c=1. e=1. equivalent=1.
% 0.98/1.29
% 0.98/1.29 ============================== end of process initial clauses ========
% 0.98/1.29
% 0.98/1.29 ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.29
% 0.98/1.29 ============================== end of clauses for search =============
% 0.98/1.29
% 0.98/1.29 ============================== SEARCH ================================
% 0.98/1.29
% 0.98/1.29 % Starting search at 0.01 seconds.
% 0.98/1.29
% 0.98/1.29 ============================== PROOF =================================
% 0.98/1.29 % SZS status Unsatisfiable
% 0.98/1.29 % SZS output start Refutation
% 0.98/1.29
% 0.98/1.29 % Proof 1 at 0.32 (+ 0.01) seconds: prove_p_1.
% 0.98/1.29 % Length of proof is 13.
% 0.98/1.29 % Level of proof is 5.
% 0.98/1.29 % Maximum clause weight is 20.000.
% 0.98/1.29 % Given clauses 105.
% 0.98/1.29
% 0.98/1.29 1 is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),A)))) # label(q_1) # label(axiom). [assumption].
% 0.98/1.29 2 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))) # label(q_2) # label(axiom). [assumption].
% 0.98/1.29 3 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)) # label(lg_2) # label(axiom). [assumption].
% 0.98/1.29 4 -is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))) # label(prove_p_1) # label(negated_conjecture) # answer(prove_p_1). [assumption].
% 0.98/1.29 5 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.98/1.29 6 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D)))). [hyper(5,a,3,a,b,2,a)].
% 0.98/1.29 8 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(B,D)),equivalent(C,D)),E)),equivalent(A,E))). [hyper(5,a,2,a,b,3,a)].
% 0.98/1.29 10 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,equivalent(equivalent(C,D),equivalent(equivalent(D,C),B))))). [hyper(5,a,2,a,b,1,a)].
% 0.98/1.29 71 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(D,A),equivalent(D,B)),C))). [hyper(5,a,8,a,b,2,a)].
% 0.98/1.29 94 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(C,equivalent(equivalent(B,A),D)))). [hyper(5,a,6,a,b,10,a)].
% 0.98/1.29 446 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,A),D)),equivalent(equivalent(C,B),D))). [hyper(5,a,6,a,b,71,a)].
% 0.98/1.29 3056 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))). [hyper(5,a,94,a,b,446,a)].
% 0.98/1.29 3057 $F # answer(prove_p_1). [resolve(3056,a,4,a)].
% 0.98/1.29
% 0.98/1.29 % SZS output end Refutation
% 0.98/1.29 ============================== end of proof ==========================
% 0.98/1.29
% 0.98/1.29 ============================== STATISTICS ============================
% 0.98/1.29
% 0.98/1.29 Given=105. Generated=7121. Kept=3056. proofs=1.
% 0.98/1.29 Usable=104. Sos=2936. Demods=0. Limbo=13, Disabled=7. Hints=0.
% 0.98/1.29 Megabytes=3.09.
% 0.98/1.29 User_CPU=0.32, System_CPU=0.01, Wall_clock=0.
% 0.98/1.29
% 0.98/1.29 ============================== end of statistics =====================
% 0.98/1.29
% 0.98/1.29 ============================== end of search =========================
% 0.98/1.29
% 0.98/1.29 THEOREM PROVED
% 0.98/1.29 % SZS status Unsatisfiable
% 0.98/1.29
% 0.98/1.29 Exiting with 1 proof.
% 0.98/1.29
% 0.98/1.29 Process 12750 exit (max_proofs) Mon Jul 4 14:28:50 2022
% 0.98/1.29 Prover9 interrupted
%------------------------------------------------------------------------------