TSTP Solution File: LCL080-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL080-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:51 EDT 2022
% Result : Unsatisfiable 1.23s 1.51s
% Output : Refutation 1.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL080-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n016.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 : Sat Jul 2 14:36:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.23/1.51 ============================== Prover9 ===============================
% 1.23/1.51 Prover9 (32) version 2009-11A, November 2009.
% 1.23/1.51 Process 18643 was started by sandbox on n016.cluster.edu,
% 1.23/1.51 Sat Jul 2 14:36:14 2022
% 1.23/1.51 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18490_n016.cluster.edu".
% 1.23/1.51 ============================== end of head ===========================
% 1.23/1.51
% 1.23/1.51 ============================== INPUT =================================
% 1.23/1.51
% 1.23/1.51 % Reading from file /tmp/Prover9_18490_n016.cluster.edu
% 1.23/1.51
% 1.23/1.51 set(prolog_style_variables).
% 1.23/1.51 set(auto2).
% 1.23/1.51 % set(auto2) -> set(auto).
% 1.23/1.51 % set(auto) -> set(auto_inference).
% 1.23/1.51 % set(auto) -> set(auto_setup).
% 1.23/1.51 % set(auto_setup) -> set(predicate_elim).
% 1.23/1.51 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.23/1.51 % set(auto) -> set(auto_limits).
% 1.23/1.51 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.23/1.51 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.23/1.51 % set(auto) -> set(auto_denials).
% 1.23/1.51 % set(auto) -> set(auto_process).
% 1.23/1.51 % set(auto2) -> assign(new_constants, 1).
% 1.23/1.51 % set(auto2) -> assign(fold_denial_max, 3).
% 1.23/1.51 % set(auto2) -> assign(max_weight, "200.000").
% 1.23/1.51 % set(auto2) -> assign(max_hours, 1).
% 1.23/1.51 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.23/1.51 % set(auto2) -> assign(max_seconds, 0).
% 1.23/1.51 % set(auto2) -> assign(max_minutes, 5).
% 1.23/1.51 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.23/1.51 % set(auto2) -> set(sort_initial_sos).
% 1.23/1.51 % set(auto2) -> assign(sos_limit, -1).
% 1.23/1.51 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.23/1.51 % set(auto2) -> assign(max_megs, 400).
% 1.23/1.51 % set(auto2) -> assign(stats, some).
% 1.23/1.51 % set(auto2) -> clear(echo_input).
% 1.23/1.51 % set(auto2) -> set(quiet).
% 1.23/1.51 % set(auto2) -> clear(print_initial_clauses).
% 1.23/1.51 % set(auto2) -> clear(print_given).
% 1.23/1.51 assign(lrs_ticks,-1).
% 1.23/1.51 assign(sos_limit,10000).
% 1.23/1.51 assign(order,kbo).
% 1.23/1.51 set(lex_order_vars).
% 1.23/1.51 clear(print_given).
% 1.23/1.51
% 1.23/1.51 % formulas(sos). % not echoed (6 formulas)
% 1.23/1.51
% 1.23/1.51 ============================== end of input ==========================
% 1.23/1.51
% 1.23/1.51 % From the command line: assign(max_seconds, 300).
% 1.23/1.51
% 1.23/1.51 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.23/1.51
% 1.23/1.51 % Formulas that are not ordinary clauses:
% 1.23/1.51
% 1.23/1.51 ============================== end of process non-clausal formulas ===
% 1.23/1.51
% 1.23/1.51 ============================== PROCESS INITIAL CLAUSES ===============
% 1.23/1.51
% 1.23/1.51 ============================== PREDICATE ELIMINATION =================
% 1.23/1.51
% 1.23/1.51 ============================== end predicate elimination =============
% 1.23/1.51
% 1.23/1.51 Auto_denials:
% 1.23/1.51 % copying label prove_ic_JLukasiewicz to answer in negative clause
% 1.23/1.51
% 1.23/1.51 Term ordering decisions:
% 1.23/1.51 Function symbol KB weights: a=1. b=1. c=1. e=1. implies=1.
% 1.23/1.51
% 1.23/1.51 ============================== end of process initial clauses ========
% 1.23/1.51
% 1.23/1.51 ============================== CLAUSES FOR SEARCH ====================
% 1.23/1.51
% 1.23/1.51 ============================== end of clauses for search =============
% 1.23/1.51
% 1.23/1.51 ============================== SEARCH ================================
% 1.23/1.51
% 1.23/1.51 % Starting search at 0.01 seconds.
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=42.000, iters=3354
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=38.000, iters=3340
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=34.000, iters=3421
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=32.000, iters=3392
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=30.000, iters=3390
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=28.000, iters=3351
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=26.000, iters=3348
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=24.000, iters=3344
% 1.23/1.51
% 1.23/1.51 Low Water (keep): wt=22.000, iters=3347
% 1.23/1.51
% 1.23/1.51 ============================== PROOF =================================
% 1.23/1.51 % SZS status Unsatisfiable
% 1.23/1.51 % SZS output start Refutation
% 1.23/1.51
% 1.23/1.51 % Proof 1 at 0.52 (+ 0.03) seconds: prove_ic_JLukasiewicz.
% 1.23/1.51 % Length of proof is 21.
% 1.23/1.51 % Level of proof is 9.
% 1.23/1.51 % Maximum clause weight is 16.000.
% 1.23/1.51 % Given clauses 165.
% 1.23/1.51
% 1.23/1.51 2 is_a_theorem(implies(A,implies(B,A))) # label(ic_2) # label(axiom). [assumption].
% 1.23/1.51 3 is_a_theorem(implies(implies(implies(A,B),A),A)) # label(ic_3) # label(axiom). [assumption].
% 1.23/1.51 4 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(ic_4) # label(axiom). [assumption].
% 1.23/1.51 5 -is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))) # label(prove_ic_JLukasiewicz) # label(negated_conjecture) # answer(prove_ic_JLukasiewicz). [assumption].
% 1.23/1.51 6 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 1.23/1.51 7 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))). [hyper(6,a,4,a,b,4,a)].
% 1.23/1.51 9 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(6,a,4,a,b,2,a)].
% 1.23/1.51 11 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(6,a,2,a,b,3,a)].
% 1.23/1.51 14 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))). [hyper(6,a,7,a,b,7,a)].
% 1.23/1.51 18 is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))). [hyper(6,a,7,a,b,3,a)].
% 1.23/1.51 28 is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))). [hyper(6,a,9,a,b,4,a)].
% 1.23/1.51 56 is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))). [hyper(6,a,7,a,b,18,a)].
% 1.23/1.51 101 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,implies(D,C))))). [hyper(6,a,14,a,b,28,a)].
% 1.23/1.51 339 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(6,a,9,a,b,56,a)].
% 1.23/1.51 353 is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)). [hyper(6,a,56,a,b,11,a)].
% 1.23/1.51 364 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))). [hyper(6,a,14,a,b,339,a)].
% 1.23/1.51 1131 is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))). [hyper(6,a,7,a,b,353,a)].
% 1.23/1.51 2142 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))). [hyper(6,a,7,a,b,1131,a)].
% 1.23/1.51 3927 is_a_theorem(implies(implies(A,B),implies(implies(implies(B,C),A),B))). [hyper(6,a,364,a,b,2142,a)].
% 1.23/1.51 6823 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))). [hyper(6,a,101,a,b,3927,a)].
% 1.23/1.51 6824 $F # answer(prove_ic_JLukasiewicz). [resolve(6823,a,5,a)].
% 1.23/1.51
% 1.23/1.51 % SZS output end Refutation
% 1.23/1.51 ============================== end of proof ==========================
% 1.23/1.51
% 1.23/1.51 ============================== STATISTICS ============================
% 1.23/1.51
% 1.23/1.51 Given=165. Generated=22775. Kept=6823. proofs=1.
% 1.23/1.51 Usable=164. Sos=6589. Demods=0. Limbo=36, Disabled=39. Hints=0.
% 1.23/1.51 Megabytes=5.67.
% 1.23/1.51 User_CPU=0.52, System_CPU=0.03, Wall_clock=1.
% 1.23/1.51
% 1.23/1.51 ============================== end of statistics =====================
% 1.23/1.51
% 1.23/1.51 ============================== end of search =========================
% 1.23/1.51
% 1.23/1.51 THEOREM PROVED
% 1.23/1.51 % SZS status Unsatisfiable
% 1.23/1.51
% 1.23/1.51 Exiting with 1 proof.
% 1.23/1.51
% 1.23/1.51 Process 18643 exit (max_proofs) Sat Jul 2 14:36:15 2022
% 1.23/1.51 Prover9 interrupted
%------------------------------------------------------------------------------