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