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