TSTP Solution File: LCL089-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL089-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:56 EDT 2022
% Result : Unsatisfiable 0.81s 1.10s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL089-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.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 : Mon Jul 4 19:36:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.81/1.10 ============================== Prover9 ===============================
% 0.81/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.10 Process 3646 was started by sandbox2 on n026.cluster.edu,
% 0.81/1.10 Mon Jul 4 19:36:37 2022
% 0.81/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3491_n026.cluster.edu".
% 0.81/1.10 ============================== end of head ===========================
% 0.81/1.10
% 0.81/1.10 ============================== INPUT =================================
% 0.81/1.10
% 0.81/1.10 % Reading from file /tmp/Prover9_3491_n026.cluster.edu
% 0.81/1.10
% 0.81/1.10 set(prolog_style_variables).
% 0.81/1.10 set(auto2).
% 0.81/1.10 % set(auto2) -> set(auto).
% 0.81/1.10 % set(auto) -> set(auto_inference).
% 0.81/1.10 % set(auto) -> set(auto_setup).
% 0.81/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.10 % set(auto) -> set(auto_limits).
% 0.81/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.10 % set(auto) -> set(auto_denials).
% 0.81/1.10 % set(auto) -> set(auto_process).
% 0.81/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.10 % set(auto2) -> assign(stats, some).
% 0.81/1.10 % set(auto2) -> clear(echo_input).
% 0.81/1.10 % set(auto2) -> set(quiet).
% 0.81/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.10 % set(auto2) -> clear(print_given).
% 0.81/1.10 assign(lrs_ticks,-1).
% 0.81/1.10 assign(sos_limit,10000).
% 0.81/1.10 assign(order,kbo).
% 0.81/1.10 set(lex_order_vars).
% 0.81/1.10 clear(print_given).
% 0.81/1.10
% 0.81/1.10 % formulas(sos). % not echoed (3 formulas)
% 0.81/1.10
% 0.81/1.10 ============================== end of input ==========================
% 0.81/1.10
% 0.81/1.10 % From the command line: assign(max_seconds, 300).
% 0.81/1.10
% 0.81/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.10
% 0.81/1.10 % Formulas that are not ordinary clauses:
% 0.81/1.10
% 0.81/1.10 ============================== end of process non-clausal formulas ===
% 0.81/1.10
% 0.81/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.10
% 0.81/1.10 ============================== PREDICATE ELIMINATION =================
% 0.81/1.10
% 0.81/1.10 ============================== end predicate elimination =============
% 0.81/1.10
% 0.81/1.10 Auto_denials:
% 0.81/1.10 % copying label prove_ic_4 to answer in negative clause
% 0.81/1.10
% 0.81/1.10 Term ordering decisions:
% 0.81/1.10 Function symbol KB weights: a=1. b=1. c=1. implies=1.
% 0.81/1.10
% 0.81/1.10 ============================== end of process initial clauses ========
% 0.81/1.10
% 0.81/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.10
% 0.81/1.10 ============================== end of clauses for search =============
% 0.81/1.10
% 0.81/1.10 ============================== SEARCH ================================
% 0.81/1.10
% 0.81/1.10 % Starting search at 0.01 seconds.
% 0.81/1.10
% 0.81/1.10 ============================== PROOF =================================
% 0.81/1.10 % SZS status Unsatisfiable
% 0.81/1.10 % SZS output start Refutation
% 0.81/1.10
% 0.81/1.10 % Proof 1 at 0.09 (+ 0.01) seconds: prove_ic_4.
% 0.81/1.10 % Length of proof is 37.
% 0.81/1.10 % Level of proof is 21.
% 0.81/1.10 % Maximum clause weight is 20.000.
% 0.81/1.10 % Given clauses 82.
% 0.81/1.10
% 0.81/1.10 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.81/1.10 2 -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))) # label(prove_ic_4) # label(negated_conjecture) # answer(prove_ic_4). [assumption].
% 0.81/1.10 3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.81/1.10 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.81/1.10 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.81/1.10 7 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))). [hyper(3,a,5,a,b,5,a)].
% 0.81/1.10 9 is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,C))))). [hyper(3,a,5,a,b,1,a)].
% 0.81/1.10 10 is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))). [hyper(3,a,7,a,b,7,a)].
% 0.81/1.10 12 is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))). [hyper(3,a,1,a,b,10,a)].
% 0.81/1.10 17 is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))). [hyper(3,a,9,a,b,9,a)].
% 0.81/1.10 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.81/1.10 32 is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))). [hyper(3,a,12,a,b,12,a)].
% 0.81/1.10 37 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(3,a,5,a,b,32,a)].
% 0.81/1.10 52 is_a_theorem(implies(A,implies(B,A))). [hyper(3,a,37,a,b,37,a)].
% 0.81/1.10 55 is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))). [hyper(3,a,1,a,b,37,a)].
% 0.81/1.10 58 is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))). [hyper(3,a,1,a,b,52,a)].
% 0.81/1.10 68 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(3,a,55,a,b,55,a)].
% 0.81/1.10 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.81/1.10 79 is_a_theorem(implies(implies(A,B),implies(C,implies(implies(B,D),implies(A,D))))). [hyper(3,a,68,a,b,1,a)].
% 0.81/1.10 126 is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))). [hyper(3,a,58,a,b,58,a)].
% 0.81/1.10 129 is_a_theorem(implies(A,implies(B,B))). [hyper(3,a,126,a,b,126,a)].
% 0.81/1.10 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.81/1.10 134 is_a_theorem(implies(A,A)). [hyper(3,a,129,a,b,129,a)].
% 0.81/1.10 145 is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))). [hyper(3,a,17,a,b,134,a)].
% 0.81/1.10 451 is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))). [hyper(3,a,131,a,b,131,a)].
% 0.81/1.10 459 is_a_theorem(implies(A,implies(implies(B,implies(B,C)),implies(B,C)))). [hyper(3,a,451,a,b,451,a)].
% 0.81/1.10 461 is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))). [hyper(3,a,73,a,b,451,a)].
% 0.81/1.10 466 is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))). [hyper(3,a,451,a,b,145,a)].
% 0.81/1.10 468 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(3,a,451,a,b,126,a)].
% 0.81/1.10 481 is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))). [hyper(3,a,451,a,b,461,a)].
% 0.81/1.10 572 is_a_theorem(implies(implies(implies(A,A),B),B)). [hyper(3,a,466,a,b,466,a)].
% 0.81/1.10 586 is_a_theorem(implies(implies(implies(A,B),A),A)). [hyper(3,a,572,a,b,468,a)].
% 0.81/1.10 606 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(3,a,586,a,b,481,a)].
% 0.81/1.10 672 is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)). [hyper(3,a,606,a,b,52,a)].
% 0.81/1.10 782 is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))). [hyper(3,a,672,a,b,459,a)].
% 0.81/1.10 800 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))). [hyper(3,a,782,a,b,79,a)].
% 0.81/1.10 801 $F # answer(prove_ic_4). [resolve(800,a,2,a)].
% 0.81/1.10
% 0.81/1.10 % SZS output end Refutation
% 0.81/1.10 ============================== end of proof ==========================
% 0.81/1.10
% 0.81/1.10 ============================== STATISTICS ============================
% 0.81/1.10
% 0.81/1.10 Given=82. Generated=5593. Kept=800. proofs=1.
% 0.81/1.10 Usable=77. Sos=683. Demods=0. Limbo=5, Disabled=37. Hints=0.
% 0.81/1.10 Megabytes=0.82.
% 0.81/1.10 User_CPU=0.09, System_CPU=0.01, Wall_clock=1.
% 0.81/1.10
% 0.81/1.10 ============================== end of statistics =====================
% 0.81/1.10
% 0.81/1.10 ============================== end of search =========================
% 0.81/1.10
% 0.81/1.10 THEOREM PROVED
% 0.81/1.10 % SZS status Unsatisfiable
% 0.81/1.10
% 0.81/1.10 Exiting with 1 proof.
% 0.81/1.10
% 0.81/1.10 Process 3646 exit (max_proofs) Mon Jul 4 19:36:38 2022
% 0.81/1.10 Prover9 interrupted
%------------------------------------------------------------------------------