TSTP Solution File: LCL072-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:47 EDT 2022
% Result : Unsatisfiable 0.69s 1.04s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jul 2 10:25:47 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.69/1.04 ============================== Prover9 ===============================
% 0.69/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.04 Process 2712 was started by sandbox on n028.cluster.edu,
% 0.69/1.04 Sat Jul 2 10:25:47 2022
% 0.69/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2559_n028.cluster.edu".
% 0.69/1.04 ============================== end of head ===========================
% 0.69/1.04
% 0.69/1.04 ============================== INPUT =================================
% 0.69/1.04
% 0.69/1.04 % Reading from file /tmp/Prover9_2559_n028.cluster.edu
% 0.69/1.04
% 0.69/1.04 set(prolog_style_variables).
% 0.69/1.04 set(auto2).
% 0.69/1.04 % set(auto2) -> set(auto).
% 0.69/1.04 % set(auto) -> set(auto_inference).
% 0.69/1.04 % set(auto) -> set(auto_setup).
% 0.69/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.69/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.04 % set(auto) -> set(auto_limits).
% 0.69/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.04 % set(auto) -> set(auto_denials).
% 0.69/1.04 % set(auto) -> set(auto_process).
% 0.69/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.69/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.69/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.69/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.69/1.04 % set(auto2) -> assign(stats, some).
% 0.69/1.04 % set(auto2) -> clear(echo_input).
% 0.69/1.04 % set(auto2) -> set(quiet).
% 0.69/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.04 % set(auto2) -> clear(print_given).
% 0.69/1.04 assign(lrs_ticks,-1).
% 0.69/1.04 assign(sos_limit,10000).
% 0.69/1.04 assign(order,kbo).
% 0.69/1.04 set(lex_order_vars).
% 0.69/1.04 clear(print_given).
% 0.69/1.04
% 0.69/1.04 % formulas(sos). % not echoed (5 formulas)
% 0.69/1.04
% 0.69/1.04 ============================== end of input ==========================
% 0.69/1.04
% 0.69/1.04 % From the command line: assign(max_seconds, 300).
% 0.69/1.04
% 0.69/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.04
% 0.69/1.04 % Formulas that are not ordinary clauses:
% 0.69/1.04
% 0.69/1.04 ============================== end of process non-clausal formulas ===
% 0.69/1.04
% 0.69/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.04
% 0.69/1.04 ============================== PREDICATE ELIMINATION =================
% 0.69/1.04
% 0.69/1.04 ============================== end predicate elimination =============
% 0.69/1.04
% 0.69/1.04 Auto_denials:
% 0.69/1.04 % copying label prove_cn_3 to answer in negative clause
% 0.69/1.04
% 0.69/1.04 Term ordering decisions:
% 0.69/1.04
% 0.69/1.04 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.69/1.04 Function symbol KB weights: a=1. b=1. implies=1. not=0.
% 0.69/1.04
% 0.69/1.04 ============================== end of process initial clauses ========
% 0.69/1.04
% 0.69/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.04
% 0.69/1.04 ============================== end of clauses for search =============
% 0.69/1.04
% 0.69/1.04 ============================== SEARCH ================================
% 0.69/1.04
% 0.69/1.04 % Starting search at 0.01 seconds.
% 0.69/1.04
% 0.69/1.04 ============================== PROOF =================================
% 0.69/1.04 % SZS status Unsatisfiable
% 0.69/1.04 % SZS output start Refutation
% 0.69/1.04
% 0.69/1.04 % Proof 1 at 0.09 (+ 0.01) seconds: prove_cn_3.
% 0.69/1.04 % Length of proof is 17.
% 0.69/1.04 % Level of proof is 7.
% 0.69/1.04 % Maximum clause weight is 19.000.
% 0.69/1.04 % Given clauses 98.
% 0.69/1.04
% 0.69/1.04 1 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))) # label(cn_19) # label(axiom). [assumption].
% 0.69/1.04 2 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))) # label(cn_37) # label(axiom). [assumption].
% 0.69/1.04 3 is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))) # label(cn_60) # label(axiom). [assumption].
% 0.69/1.04 4 -is_a_theorem(implies(a,implies(not(a),b))) # label(prove_cn_3) # label(negated_conjecture) # answer(prove_cn_3). [assumption].
% 0.69/1.04 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.69/1.04 7 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(D,C),implies(implies(A,D),C)))). [hyper(5,a,3,a,b,2,a)].
% 0.69/1.04 14 is_a_theorem(implies(A,implies(B,A))). [hyper(5,a,1,a,b,1,a)].
% 0.69/1.04 20 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,2,a,b,14,a)].
% 0.69/1.04 49 is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))). [hyper(5,a,7,a,b,14,a)].
% 0.69/1.04 53 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(implies(D,B),A),implies(B,C)))). [hyper(5,a,7,a,b,1,a)].
% 0.69/1.04 254 is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))). [hyper(5,a,53,a,b,20,a)].
% 0.69/1.04 266 is_a_theorem(implies(implies(implies(A,B),implies(implies(C,B),D)),implies(B,D))). [hyper(5,a,53,a,b,1,a)].
% 0.69/1.04 345 is_a_theorem(implies(not(A),implies(A,B))). [hyper(5,a,266,a,b,254,a)].
% 0.69/1.04 348 is_a_theorem(implies(A,A)). [hyper(5,a,266,a,b,1,a)].
% 0.69/1.04 591 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,49,a,b,345,a)].
% 0.69/1.04 634 is_a_theorem(implies(A,implies(not(A),B))). [hyper(5,a,591,a,b,348,a)].
% 0.69/1.04 635 $F # answer(prove_cn_3). [resolve(634,a,4,a)].
% 0.69/1.04
% 0.69/1.04 % SZS output end Refutation
% 0.69/1.04 ============================== end of proof ==========================
% 0.69/1.04
% 0.69/1.04 ============================== STATISTICS ============================
% 0.69/1.04
% 0.69/1.04 Given=98. Generated=6380. Kept=634. proofs=1.
% 0.69/1.04 Usable=94. Sos=484. Demods=0. Limbo=13, Disabled=47. Hints=0.
% 0.69/1.04 Megabytes=0.69.
% 0.69/1.04 User_CPU=0.09, System_CPU=0.01, Wall_clock=0.
% 0.69/1.04
% 0.69/1.04 ============================== end of statistics =====================
% 0.69/1.04
% 0.69/1.04 ============================== end of search =========================
% 0.69/1.04
% 0.69/1.04 THEOREM PROVED
% 0.69/1.04 % SZS status Unsatisfiable
% 0.69/1.04
% 0.69/1.04 Exiting with 1 proof.
% 0.69/1.04
% 0.69/1.04 Process 2712 exit (max_proofs) Sat Jul 2 10:25:47 2022
% 0.69/1.04 Prover9 interrupted
%------------------------------------------------------------------------------