TSTP Solution File: LCL574+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL574+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:47:38 EDT 2022
% Result : Timeout 300.02s 300.83s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL574+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 02:31:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 30914 was started by sandbox on n008.cluster.edu,
% 0.42/1.00 Mon Jul 4 02:31:39 2022
% 0.42/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30760_n008.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_30760_n008.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (52 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 1 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 2 op_and -> (all X all Y and(X,Y) = not(or(not(X),not(Y)))) # label(op_and) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 3 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 op_implies_or -> (all X all Y implies(X,Y) = or(not(X),Y)) # label(op_implies_or) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 5 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 6 necessitation <-> (all X (is_a_theorem(X) -> is_a_theorem(necessarily(X)))) # label(necessitation) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 7 modus_ponens_strict_implies <-> (all X all Y (is_a_theorem(X) & is_a_theorem(strict_implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens_strict_implies) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 adjunction <-> (all X all Y (is_a_theorem(X) & is_a_theorem(Y) -> is_a_theorem(and(X,Y)))) # label(adjunction) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 substitution_strict_equiv <-> (all X all Y (is_a_theorem(strict_equiv(X,Y)) -> X = Y)) # label(substitution_strict_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 10 axiom_K <-> (all X all Y is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))) # label(axiom_K) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 11 axiom_M <-> (all X is_a_theorem(implies(necessarily(X),X))) # label(axiom_M) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 12 axiom_4 <-> (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 13 axiom_B <-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))) # label(axiom_B) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 14 axiom_5 <-> (all X is_a_theorem(implies(possibly(X),necessarily(possibly(X))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 15 axiom_s1 <-> (all X all Y all Z is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))) # label(axiom_s1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 16 axiom_s2 <-> (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),and(possibly(P),possibly(Q))))) # label(axiom_s2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 17 axiom_s3 <-> (all X all Y is_a_theorem(strict_implies(strict_implies(X,Y),strict_implies(not(possibly(Y)),not(possibly(X)))))) # label(axiom_s3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 18 axiom_s4 <-> (all X is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))) # label(axiom_s4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 19 axiom_m1 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),and(Y,X)))) # label(axiom_m1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 20 axiom_m2 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),X))) # label(axiom_m2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 21 axiom_m3 <-> (all X all Y all Z is_a_theorem(strict_implies(and(and(X,Y),Z),and(X,and(Y,Z))))) # label(axiom_m3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 22 axiom_m4 <-> (all X is_a_theorem(strict_implies(X,and(X,X)))) # label(axiom_m4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 23 axiom_m5 <-> (all X all Y all Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))) # label(axiom_m5) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 24 axiom_m6 <-> (all X is_a_theorem(strict_implies(X,possibly(X)))) # label(axiom_m6) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 25 axiom_m7 <-> (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),P))) # label(axiom_m7) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 26 axiom_m8 <-> (all P all Q is_a_theorem(strict_implies(strict_implies(P,Q),strict_implies(possibly(P),possibly(Q))))) # label(axiom_m8) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 27 axiom_m9 <-> (all X is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X)))) # label(axiom_m9) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 28 axiom_m10 <-> (all X is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))) # label(axiom_m10) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 29 op_possibly -> (all X possibly(X) = not(necessarily(not(X)))) # label(op_possibly) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 30 op_necessarily -> (all X necessarily(X) = not(possibly(not(X)))) # label(op_necessarily) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 31 op_strict_implies -> (all X all Y strict_implies(X,Y) = necessarily(implies(X,Y))) # label(op_strict_implies) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 32 op_strict_equiv -> (all X all Y strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X))) # label(op_strict_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00
% 0.42/1.00 ============================== end predicate elimination =============
% 0.42/1.00
% 0.42/1.00 Auto_denials: (non-Horn, no changes).
% 0.42/1.00
% 0.42/1.00 Term ordering decisions:
% 0.42/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. c37=1. c38=1. c39=1. strict_implies=1. and=1. implies=1. or=1. strict_equiv=1. equiv=1. necessarily=1. possibly=1. not=1.
% 0.42/1.00
% 0.42/1.00 ============================== end of process initial clauses ========
% 0.42/1.00
% 0.42/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.00
% 0.42/1.00 ============================== end of clauses for search =============
% 0.42/1.00
% 300.02/300.83 Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------