TSTP Solution File: LCL035-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL035-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:32 EDT 2022
% Result : Unsatisfiable 0.42s 1.03s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL035-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % 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 : Sat Jul 2 10:42:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.03 ============================== Prover9 ===============================
% 0.42/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.03 Process 12523 was started by sandbox2 on n008.cluster.edu,
% 0.42/1.03 Sat Jul 2 10:42:09 2022
% 0.42/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12369_n008.cluster.edu".
% 0.42/1.03 ============================== end of head ===========================
% 0.42/1.03
% 0.42/1.03 ============================== INPUT =================================
% 0.42/1.03
% 0.42/1.03 % Reading from file /tmp/Prover9_12369_n008.cluster.edu
% 0.42/1.03
% 0.42/1.03 set(prolog_style_variables).
% 0.42/1.03 set(auto2).
% 0.42/1.03 % set(auto2) -> set(auto).
% 0.42/1.03 % set(auto) -> set(auto_inference).
% 0.42/1.03 % set(auto) -> set(auto_setup).
% 0.42/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.03 % set(auto) -> set(auto_limits).
% 0.42/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.03 % set(auto) -> set(auto_denials).
% 0.42/1.03 % set(auto) -> set(auto_process).
% 0.42/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.03 % set(auto2) -> assign(stats, some).
% 0.42/1.03 % set(auto2) -> clear(echo_input).
% 0.42/1.03 % set(auto2) -> set(quiet).
% 0.42/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.03 % set(auto2) -> clear(print_given).
% 0.42/1.03 assign(lrs_ticks,-1).
% 0.42/1.03 assign(sos_limit,10000).
% 0.42/1.03 assign(order,kbo).
% 0.42/1.03 set(lex_order_vars).
% 0.42/1.03 clear(print_given).
% 0.42/1.03
% 0.42/1.03 % formulas(sos). % not echoed (3 formulas)
% 0.42/1.03
% 0.42/1.03 ============================== end of input ==========================
% 0.42/1.03
% 0.42/1.03 % From the command line: assign(max_seconds, 300).
% 0.42/1.03
% 0.42/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.03
% 0.42/1.03 % Formulas that are not ordinary clauses:
% 0.42/1.03
% 0.42/1.03 ============================== end of process non-clausal formulas ===
% 0.42/1.03
% 0.42/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.03
% 0.42/1.03 ============================== PREDICATE ELIMINATION =================
% 0.42/1.03
% 0.42/1.03 ============================== end predicate elimination =============
% 0.42/1.03
% 0.42/1.03 Auto_denials:
% 0.42/1.03 % copying label prove_c0_4 to answer in negative clause
% 0.42/1.03
% 0.42/1.03 Term ordering decisions:
% 0.42/1.03 Function symbol KB weights: falsehood=1. a=1. implies=1.
% 0.42/1.03
% 0.42/1.03 ============================== end of process initial clauses ========
% 0.42/1.03
% 0.42/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.03
% 0.42/1.03 ============================== end of clauses for search =============
% 0.42/1.03
% 0.42/1.03 ============================== SEARCH ================================
% 0.42/1.03
% 0.42/1.03 % Starting search at 0.01 seconds.
% 0.42/1.03
% 0.42/1.03 ============================== PROOF =================================
% 0.42/1.03 % SZS status Unsatisfiable
% 0.42/1.03 % SZS output start Refutation
% 0.42/1.03
% 0.42/1.03 % Proof 1 at 0.01 (+ 0.00) seconds: prove_c0_4.
% 0.42/1.03 % Length of proof is 9.
% 0.42/1.03 % Level of proof is 6.
% 0.42/1.03 % Maximum clause weight is 20.000.
% 0.42/1.03 % Given clauses 10.
% 0.42/1.03
% 0.42/1.03 1 is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))) # label(c0_CAMerideth) # label(axiom). [assumption].
% 0.42/1.03 2 -is_a_theorem(implies(falsehood,a)) # label(prove_c0_4) # label(negated_conjecture) # answer(prove_c0_4). [assumption].
% 0.42/1.03 3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.42/1.03 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.42/1.03 6 is_a_theorem(implies(implies(implies(A,implies(falsehood,B)),C),implies(D,C))). [hyper(3,a,1,a,b,4,a)].
% 0.42/1.03 14 is_a_theorem(implies(A,implies(B,implies(falsehood,C)))). [hyper(3,a,6,a,b,6,a)].
% 0.42/1.03 18 is_a_theorem(implies(A,implies(falsehood,B))). [hyper(3,a,14,a,b,14,a)].
% 0.42/1.03 25 is_a_theorem(implies(falsehood,A)). [hyper(3,a,18,a,b,18,a)].
% 0.42/1.03 26 $F # answer(prove_c0_4). [resolve(25,a,2,a)].
% 0.42/1.03
% 0.42/1.03 % SZS output end Refutation
% 0.42/1.03 ============================== end of proof ==========================
% 0.42/1.03
% 0.42/1.03 ============================== STATISTICS ============================
% 0.42/1.03
% 0.42/1.03 Given=10. Generated=55. Kept=25. proofs=1.
% 0.42/1.03 Usable=10. Sos=13. Demods=0. Limbo=0, Disabled=4. Hints=0.
% 0.42/1.03 Megabytes=0.06.
% 0.42/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/1.03
% 0.42/1.03 ============================== end of statistics =====================
% 0.42/1.03
% 0.42/1.03 ============================== end of search =========================
% 0.42/1.03
% 0.42/1.03 THEOREM PROVED
% 0.42/1.03 % SZS status Unsatisfiable
% 0.42/1.03
% 0.42/1.03 Exiting with 1 proof.
% 0.42/1.03
% 0.42/1.03 Process 12523 exit (max_proofs) Sat Jul 2 10:42:09 2022
% 0.42/1.03 Prover9 interrupted
%------------------------------------------------------------------------------