TSTP Solution File: LCL257-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL257-1 : TPTP v8.1.0. Released v2.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:45:32 EDT 2022
% Result : Unsatisfiable 0.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL257-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 16:43:10 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 26287 was started by sandbox on n014.cluster.edu,
% 0.45/1.00 Sat Jul 2 16:43:10 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26134_n014.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_26134_n014.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (3 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials:
% 0.45/1.00 % copying label prove_xhn to answer in negative clause
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00 Function symbol KB weights: x=1. y=1. z=1. equivalent=1.
% 0.45/1.00
% 0.45/1.00 ============================== end of process initial clauses ========
% 0.45/1.00
% 0.45/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.00
% 0.45/1.00 ============================== end of clauses for search =============
% 0.45/1.00
% 0.45/1.00 ============================== SEARCH ================================
% 0.45/1.00
% 0.45/1.00 % Starting search at 0.01 seconds.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: prove_xhn.
% 0.45/1.00 % Length of proof is 12.
% 0.45/1.00 % Level of proof is 7.
% 0.45/1.00 % Maximum clause weight is 16.000.
% 0.45/1.00 % Given clauses 19.
% 0.45/1.00
% 0.45/1.00 1 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(A,C)))) # label(yql) # label(axiom). [assumption].
% 0.45/1.00 2 -is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))) # label(prove_xhn) # label(negated_conjecture) # answer(prove_xhn). [assumption].
% 0.45/1.00 3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.45/1.00 4 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,B))),equivalent(equivalent(D,C),A))). [hyper(3,a,1,a,b,1,a)].
% 0.45/1.00 7 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))). [hyper(3,a,4,a,b,1,a)].
% 0.45/1.00 8 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(B,C),A))). [hyper(3,a,1,a,b,7,a)].
% 0.45/1.00 10 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))). [hyper(3,a,4,a,b,8,a)].
% 0.45/1.00 12 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(equivalent(D,B),equivalent(A,D))))). [hyper(3,a,8,a,b,4,a)].
% 0.45/1.00 13 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(C,B))). [hyper(3,a,8,a,b,1,a)].
% 0.45/1.00 46 is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)). [hyper(3,a,13,a,b,10,a)].
% 0.45/1.00 105 is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B)))). [hyper(3,a,12,a,b,46,a)].
% 0.45/1.00 106 $F # answer(prove_xhn). [resolve(105,a,2,a)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=19. Generated=207. Kept=105. proofs=1.
% 0.45/1.00 Usable=16. Sos=69. Demods=0. Limbo=9, Disabled=13. Hints=0.
% 0.45/1.00 Megabytes=0.11.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 26287 exit (max_proofs) Sat Jul 2 16:43:10 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------