TSTP Solution File: LCL094-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL094-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:57 EDT 2022
% Result : Unsatisfiable 0.77s 1.11s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL094-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 15:05:56 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.77/1.11 ============================== Prover9 ===============================
% 0.77/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.11 Process 14835 was started by sandbox on n029.cluster.edu,
% 0.77/1.11 Sun Jul 3 15:05:56 2022
% 0.77/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14682_n029.cluster.edu".
% 0.77/1.11 ============================== end of head ===========================
% 0.77/1.11
% 0.77/1.11 ============================== INPUT =================================
% 0.77/1.11
% 0.77/1.11 % Reading from file /tmp/Prover9_14682_n029.cluster.edu
% 0.77/1.11
% 0.77/1.11 set(prolog_style_variables).
% 0.77/1.11 set(auto2).
% 0.77/1.11 % set(auto2) -> set(auto).
% 0.77/1.11 % set(auto) -> set(auto_inference).
% 0.77/1.11 % set(auto) -> set(auto_setup).
% 0.77/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.11 % set(auto) -> set(auto_limits).
% 0.77/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.11 % set(auto) -> set(auto_denials).
% 0.77/1.11 % set(auto) -> set(auto_process).
% 0.77/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.11 % set(auto2) -> assign(stats, some).
% 0.77/1.11 % set(auto2) -> clear(echo_input).
% 0.77/1.11 % set(auto2) -> set(quiet).
% 0.77/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.11 % set(auto2) -> clear(print_given).
% 0.77/1.11 assign(lrs_ticks,-1).
% 0.77/1.11 assign(sos_limit,10000).
% 0.77/1.11 assign(order,kbo).
% 0.77/1.11 set(lex_order_vars).
% 0.77/1.11 clear(print_given).
% 0.77/1.11
% 0.77/1.11 % formulas(sos). % not echoed (3 formulas)
% 0.77/1.11
% 0.77/1.11 ============================== end of input ==========================
% 0.77/1.11
% 0.77/1.11 % From the command line: assign(max_seconds, 300).
% 0.77/1.11
% 0.77/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.11
% 0.77/1.11 % Formulas that are not ordinary clauses:
% 0.77/1.11
% 0.77/1.11 ============================== end of process non-clausal formulas ===
% 0.77/1.11
% 0.77/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.11
% 0.77/1.11 ============================== PREDICATE ELIMINATION =================
% 0.77/1.11
% 0.77/1.11 ============================== end predicate elimination =============
% 0.77/1.11
% 0.77/1.11 Auto_denials:
% 0.77/1.11 % copying label prove_ic_5 to answer in negative clause
% 0.77/1.11
% 0.77/1.11 Term ordering decisions:
% 0.77/1.11 Function symbol KB weights: a=1. b=1. implies=1.
% 0.77/1.11
% 0.77/1.11 ============================== end of process initial clauses ========
% 0.77/1.11
% 0.77/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.11
% 0.77/1.11 ============================== end of clauses for search =============
% 0.77/1.11
% 0.77/1.11 ============================== SEARCH ================================
% 0.77/1.11
% 0.77/1.11 % Starting search at 0.01 seconds.
% 0.77/1.11
% 0.77/1.11 ============================== PROOF =================================
% 0.77/1.11 % SZS status Unsatisfiable
% 0.77/1.11 % SZS output start Refutation
% 0.77/1.11
% 0.77/1.11 % Proof 1 at 0.07 (+ 0.01) seconds: prove_ic_5.
% 0.77/1.11 % Length of proof is 30.
% 0.77/1.11 % Level of proof is 18.
% 0.77/1.11 % Maximum clause weight is 20.000.
% 0.77/1.11 % Given clauses 75.
% 0.77/1.11
% 0.77/1.11 1 is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))) # label(ic_JLukasiewicz_4) # label(axiom). [assumption].
% 0.77/1.11 2 -is_a_theorem(implies(a,implies(implies(a,b),b))) # label(prove_ic_5) # label(negated_conjecture) # answer(prove_ic_5). [assumption].
% 0.77/1.11 3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.77/1.11 4 is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),implies(C,E)),implies(F,implies(C,E))))). [hyper(3,a,1,a,b,1,a)].
% 0.77/1.11 5 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))). [hyper(3,a,4,a,b,4,a)].
% 0.77/1.11 7 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))). [hyper(3,a,5,a,b,5,a)].
% 0.77/1.11 9 is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,C))))). [hyper(3,a,5,a,b,1,a)].
% 0.77/1.11 10 is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))). [hyper(3,a,7,a,b,7,a)].
% 0.77/1.11 12 is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))). [hyper(3,a,1,a,b,10,a)].
% 0.77/1.11 17 is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))). [hyper(3,a,9,a,b,9,a)].
% 0.77/1.11 18 is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),E),implies(B,E)))). [hyper(3,a,1,a,b,9,a)].
% 0.77/1.11 32 is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))). [hyper(3,a,12,a,b,12,a)].
% 0.77/1.11 37 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(3,a,5,a,b,32,a)].
% 0.77/1.11 52 is_a_theorem(implies(A,implies(B,A))). [hyper(3,a,37,a,b,37,a)].
% 0.77/1.11 58 is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))). [hyper(3,a,1,a,b,52,a)].
% 0.77/1.11 73 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(A,D))). [hyper(3,a,18,a,b,18,a)].
% 0.77/1.11 126 is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))). [hyper(3,a,58,a,b,58,a)].
% 0.77/1.11 129 is_a_theorem(implies(A,implies(B,B))). [hyper(3,a,126,a,b,126,a)].
% 0.77/1.11 131 is_a_theorem(implies(A,implies(implies(B,implies(B,C)),implies(D,implies(B,C))))). [hyper(3,a,1,a,b,126,a)].
% 0.77/1.11 134 is_a_theorem(implies(A,A)). [hyper(3,a,129,a,b,129,a)].
% 0.77/1.11 145 is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))). [hyper(3,a,17,a,b,134,a)].
% 0.77/1.11 451 is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))). [hyper(3,a,131,a,b,131,a)].
% 0.77/1.11 461 is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))). [hyper(3,a,73,a,b,451,a)].
% 0.77/1.11 466 is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))). [hyper(3,a,451,a,b,145,a)].
% 0.77/1.11 468 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(3,a,451,a,b,126,a)].
% 0.77/1.11 481 is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))). [hyper(3,a,451,a,b,461,a)].
% 0.77/1.11 572 is_a_theorem(implies(implies(implies(A,A),B),B)). [hyper(3,a,466,a,b,466,a)].
% 0.77/1.11 586 is_a_theorem(implies(implies(implies(A,B),A),A)). [hyper(3,a,572,a,b,468,a)].
% 0.77/1.11 606 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(3,a,586,a,b,481,a)].
% 0.77/1.11 607 $F # answer(prove_ic_5). [resolve(606,a,2,a)].
% 0.77/1.11
% 0.77/1.11 % SZS output end Refutation
% 0.77/1.11 ============================== end of proof ==========================
% 0.77/1.11
% 0.77/1.11 ============================== STATISTICS ============================
% 0.77/1.11
% 0.77/1.11 Given=75. Generated=4525. Kept=606. proofs=1.
% 0.77/1.11 Usable=70. Sos=501. Demods=0. Limbo=0, Disabled=37. Hints=0.
% 0.77/1.11 Megabytes=0.65.
% 0.77/1.11 User_CPU=0.07, System_CPU=0.01, Wall_clock=0.
% 0.77/1.11
% 0.77/1.11 ============================== end of statistics =====================
% 0.77/1.11
% 0.77/1.11 ============================== end of search =========================
% 0.77/1.11
% 0.77/1.11 THEOREM PROVED
% 0.77/1.11 % SZS status Unsatisfiable
% 0.77/1.11
% 0.77/1.11 Exiting with 1 proof.
% 0.77/1.11
% 0.77/1.11 Process 14835 exit (max_proofs) Sun Jul 3 15:05:56 2022
% 0.77/1.11 Prover9 interrupted
%------------------------------------------------------------------------------