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