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