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