TSTP Solution File: LCL107-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL107-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:03 EDT 2022
% Result : Unsatisfiable 0.75s 1.05s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL107-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 21:42:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 25887 was started by sandbox2 on n007.cluster.edu,
% 0.75/1.05 Sun Jul 3 21:42:57 2022
% 0.75/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25733_n007.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_25733_n007.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.05 % set(auto2) -> assign(stats, some).
% 0.75/1.05 % set(auto2) -> clear(echo_input).
% 0.75/1.05 % set(auto2) -> set(quiet).
% 0.75/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.05 % set(auto2) -> clear(print_given).
% 0.75/1.05 assign(lrs_ticks,-1).
% 0.75/1.05 assign(sos_limit,10000).
% 0.75/1.05 assign(order,kbo).
% 0.75/1.05 set(lex_order_vars).
% 0.75/1.05 clear(print_given).
% 0.75/1.05
% 0.75/1.05 % formulas(sos). % not echoed (3 formulas)
% 0.75/1.05
% 0.75/1.05 ============================== end of input ==========================
% 0.75/1.05
% 0.75/1.05 % From the command line: assign(max_seconds, 300).
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.05
% 0.75/1.05 % Formulas that are not ordinary clauses:
% 0.75/1.05
% 0.75/1.05 ============================== end of process non-clausal formulas ===
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.05
% 0.75/1.05 ============================== PREDICATE ELIMINATION =================
% 0.75/1.05
% 0.75/1.05 ============================== end predicate elimination =============
% 0.75/1.05
% 0.75/1.05 Auto_denials:
% 0.75/1.05 % copying label prove_p_1 to answer in negative clause
% 0.75/1.05
% 0.75/1.05 Term ordering decisions:
% 0.75/1.05 Function symbol KB weights: a=1. b=1. c=1. e=1. equivalent=1.
% 0.75/1.05
% 0.75/1.05 ============================== end of process initial clauses ========
% 0.75/1.05
% 0.75/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.05
% 0.75/1.05 ============================== end of clauses for search =============
% 0.75/1.05
% 0.75/1.05 ============================== SEARCH ================================
% 0.75/1.05
% 0.75/1.05 % Starting search at 0.01 seconds.
% 0.75/1.05
% 0.75/1.05 ============================== PROOF =================================
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05 % SZS output start Refutation
% 0.75/1.05
% 0.75/1.05 % Proof 1 at 0.03 (+ 0.00) seconds: prove_p_1.
% 0.75/1.05 % Length of proof is 9.
% 0.75/1.05 % Level of proof is 6.
% 0.75/1.05 % Maximum clause weight is 32.000.
% 0.75/1.05 % Given clauses 35.
% 0.75/1.05
% 0.75/1.05 1 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,E),equivalent(equivalent(equivalent(F,E),equivalent(F,D)),V6))),equivalent(C,equivalent(equivalent(B,A),V6)))) # label(lg_27_1690) # label(axiom). [assumption].
% 0.75/1.05 2 -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.75/1.05 3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.75/1.05 4 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(C,B),equivalent(C,A)),D)),equivalent(equivalent(equivalent(E,F),equivalent(equivalent(V6,E),equivalent(V6,F))),D))). [hyper(3,a,1,a,b,1,a)].
% 0.75/1.05 5 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(equivalent(equivalent(D,equivalent(equivalent(E,F),equivalent(E,V6))),equivalent(D,equivalent(F,V6))),V7)),equivalent(equivalent(B,C),V7))). [hyper(3,a,1,a,b,4,a)].
% 0.75/1.05 8 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D))),equivalent(equivalent(equivalent(E,F),equivalent(E,V6)),V7)),equivalent(equivalent(F,V6),V7))). [hyper(3,a,5,a,b,1,a)].
% 0.75/1.05 63 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D))). [hyper(3,a,8,a,b,1,a)].
% 0.75/1.05 235 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))). [hyper(3,a,63,a,b,63,a)].
% 0.75/1.05 236 $F # answer(prove_p_1). [resolve(235,a,2,a)].
% 0.75/1.05
% 0.75/1.05 % SZS output end Refutation
% 0.75/1.05 ============================== end of proof ==========================
% 0.75/1.05
% 0.75/1.05 ============================== STATISTICS ============================
% 0.75/1.05
% 0.75/1.05 Given=35. Generated=517. Kept=235. proofs=1.
% 0.75/1.05 Usable=35. Sos=199. Demods=0. Limbo=0, Disabled=3. Hints=0.
% 0.75/1.05 Megabytes=0.33.
% 0.75/1.05 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.75/1.05
% 0.75/1.05 ============================== end of statistics =====================
% 0.75/1.05
% 0.75/1.05 ============================== end of search =========================
% 0.75/1.05
% 0.75/1.05 THEOREM PROVED
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05
% 0.75/1.05 Exiting with 1 proof.
% 0.75/1.05
% 0.75/1.05 Process 25887 exit (max_proofs) Sun Jul 3 21:42:57 2022
% 0.75/1.05 Prover9 interrupted
%------------------------------------------------------------------------------