TSTP Solution File: LCL092-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL092-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL092-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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 : Sun Jul 3 00:30:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.09 ============================== Prover9 ===============================
% 0.72/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.09 Process 7725 was started by sandbox on n017.cluster.edu,
% 0.72/1.09 Sun Jul 3 00:30:11 2022
% 0.72/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7572_n017.cluster.edu".
% 0.72/1.09 ============================== end of head ===========================
% 0.72/1.09
% 0.72/1.09 ============================== INPUT =================================
% 0.72/1.09
% 0.72/1.09 % Reading from file /tmp/Prover9_7572_n017.cluster.edu
% 0.72/1.09
% 0.72/1.09 set(prolog_style_variables).
% 0.72/1.09 set(auto2).
% 0.72/1.09 % set(auto2) -> set(auto).
% 0.72/1.09 % set(auto) -> set(auto_inference).
% 0.72/1.09 % set(auto) -> set(auto_setup).
% 0.72/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.09 % set(auto) -> set(auto_limits).
% 0.72/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.09 % set(auto) -> set(auto_denials).
% 0.72/1.09 % set(auto) -> set(auto_process).
% 0.72/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.09 % set(auto2) -> assign(stats, some).
% 0.72/1.09 % set(auto2) -> clear(echo_input).
% 0.72/1.09 % set(auto2) -> set(quiet).
% 0.72/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.09 % set(auto2) -> clear(print_given).
% 0.72/1.09 assign(lrs_ticks,-1).
% 0.72/1.09 assign(sos_limit,10000).
% 0.72/1.09 assign(order,kbo).
% 0.72/1.09 set(lex_order_vars).
% 0.72/1.09 clear(print_given).
% 0.72/1.09
% 0.72/1.09 % formulas(sos). % not echoed (3 formulas)
% 0.72/1.09
% 0.72/1.09 ============================== end of input ==========================
% 0.72/1.09
% 0.72/1.09 % From the command line: assign(max_seconds, 300).
% 0.72/1.09
% 0.72/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.09
% 0.72/1.09 % Formulas that are not ordinary clauses:
% 0.72/1.09
% 0.72/1.09 ============================== end of process non-clausal formulas ===
% 0.72/1.09
% 0.72/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.09
% 0.72/1.09 ============================== PREDICATE ELIMINATION =================
% 0.72/1.09
% 0.72/1.09 ============================== end predicate elimination =============
% 0.72/1.09
% 0.72/1.09 Auto_denials:
% 0.72/1.09 % copying label prove_ic_3 to answer in negative clause
% 0.72/1.09
% 0.72/1.09 Term ordering decisions:
% 0.72/1.09 Function symbol KB weights: a=1. b=1. implies=1.
% 0.72/1.09
% 0.72/1.09 ============================== end of process initial clauses ========
% 0.72/1.09
% 0.72/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.09
% 0.72/1.09 ============================== end of clauses for search =============
% 0.72/1.09
% 0.72/1.09 ============================== SEARCH ================================
% 0.72/1.09
% 0.72/1.09 % Starting search at 0.01 seconds.
% 0.72/1.09
% 0.72/1.09 ============================== PROOF =================================
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09 % SZS output start Refutation
% 0.72/1.09
% 0.72/1.09 % Proof 1 at 0.10 (+ 0.01) seconds: prove_ic_3.
% 0.72/1.09 % Length of proof is 28.
% 0.72/1.09 % Level of proof is 22.
% 0.72/1.09 % Maximum clause weight is 24.000.
% 0.72/1.09 % Given clauses 100.
% 0.72/1.09
% 0.72/1.09 1 is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))) # label(ic_JLukasiewicz_5) # label(axiom). [assumption].
% 0.72/1.09 2 -is_a_theorem(implies(implies(implies(a,b),a),a)) # label(prove_ic_3) # label(negated_conjecture) # answer(prove_ic_3). [assumption].
% 0.72/1.09 3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.72/1.09 4 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))). [hyper(3,a,1,a,b,1,a)].
% 0.72/1.09 5 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))). [hyper(3,a,4,a,b,4,a)].
% 0.72/1.09 7 is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))). [hyper(3,a,5,a,b,5,a)].
% 0.72/1.09 11 is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))). [hyper(3,a,1,a,b,7,a)].
% 0.72/1.09 18 is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))). [hyper(3,a,1,a,b,11,a)].
% 0.72/1.09 21 is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,implies(E,C)))))). [hyper(3,a,11,a,b,1,a)].
% 0.72/1.09 50 is_a_theorem(implies(A,implies(implies(A,B),implies(C,implies(D,B))))). [hyper(3,a,21,a,b,21,a)].
% 0.72/1.09 58 is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))). [hyper(3,a,18,a,b,1,a)].
% 0.72/1.09 63 is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(E,implies(implies(implies(D,F),C),D)))). [hyper(3,a,1,a,b,50,a)].
% 0.72/1.09 105 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))). [hyper(3,a,58,a,b,58,a)].
% 0.72/1.09 109 is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))). [hyper(3,a,105,a,b,105,a)].
% 0.72/1.09 114 is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))). [hyper(3,a,1,a,b,109,a)].
% 0.72/1.09 120 is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))). [hyper(3,a,1,a,b,114,a)].
% 0.72/1.09 379 is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))). [hyper(3,a,120,a,b,114,a)].
% 0.72/1.09 385 is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))). [hyper(3,a,379,a,b,379,a)].
% 0.72/1.09 394 is_a_theorem(implies(implies(A,A),implies(A,A))). [hyper(3,a,385,a,b,385,a)].
% 0.72/1.09 397 is_a_theorem(implies(A,implies(B,implies(C,C)))). [hyper(3,a,120,a,b,394,a)].
% 0.72/1.09 408 is_a_theorem(implies(A,implies(B,B))). [hyper(3,a,397,a,b,397,a)].
% 0.72/1.09 419 is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))). [hyper(3,a,1,a,b,408,a)].
% 0.72/1.09 447 is_a_theorem(implies(implies(implies(A,B),A),implies(C,implies(D,A)))). [hyper(3,a,1,a,b,419,a)].
% 0.72/1.09 517 is_a_theorem(implies(A,implies(B,implies(C,implies(implies(implies(D,E),D),D))))). [hyper(3,a,447,a,b,63,a)].
% 0.72/1.09 679 is_a_theorem(implies(A,implies(B,implies(implies(implies(C,D),C),C)))). [hyper(3,a,517,a,b,517,a)].
% 0.72/1.09 685 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(3,a,679,a,b,679,a)].
% 0.72/1.09 701 is_a_theorem(implies(implies(implies(A,B),A),A)). [hyper(3,a,685,a,b,685,a)].
% 0.72/1.09 702 $F # answer(prove_ic_3). [resolve(701,a,2,a)].
% 0.72/1.09
% 0.72/1.09 % SZS output end Refutation
% 0.72/1.09 ============================== end of proof ==========================
% 0.72/1.09
% 0.72/1.09 ============================== STATISTICS ============================
% 0.72/1.09
% 0.72/1.09 Given=100. Generated=5410. Kept=701. proofs=1.
% 0.72/1.09 Usable=59. Sos=343. Demods=0. Limbo=0, Disabled=301. Hints=0.
% 0.72/1.09 Megabytes=0.66.
% 0.72/1.09 User_CPU=0.10, System_CPU=0.01, Wall_clock=0.
% 0.72/1.09
% 0.72/1.09 ============================== end of statistics =====================
% 0.72/1.09
% 0.72/1.09 ============================== end of search =========================
% 0.72/1.09
% 0.72/1.09 THEOREM PROVED
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09
% 0.72/1.09 Exiting with 1 proof.
% 0.72/1.09
% 0.72/1.09 Process 7725 exit (max_proofs) Sun Jul 3 00:30:11 2022
% 0.72/1.09 Prover9 interrupted
%------------------------------------------------------------------------------