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