TSTP Solution File: LCL644+1.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL644+1.005 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:48:09 EDT 2022
% Result : Theorem 0.87s 1.35s
% Output : Refutation 0.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL644+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.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 16:24:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.87/1.35 ============================== Prover9 ===============================
% 0.87/1.35 Prover9 (32) version 2009-11A, November 2009.
% 0.87/1.35 Process 30482 was started by sandbox2 on n020.cluster.edu,
% 0.87/1.35 Sun Jul 3 16:24:15 2022
% 0.87/1.35 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30074_n020.cluster.edu".
% 0.87/1.35 ============================== end of head ===========================
% 0.87/1.35
% 0.87/1.35 ============================== INPUT =================================
% 0.87/1.35
% 0.87/1.35 % Reading from file /tmp/Prover9_30074_n020.cluster.edu
% 0.87/1.35
% 0.87/1.35 set(prolog_style_variables).
% 0.87/1.35 set(auto2).
% 0.87/1.35 % set(auto2) -> set(auto).
% 0.87/1.35 % set(auto) -> set(auto_inference).
% 0.87/1.35 % set(auto) -> set(auto_setup).
% 0.87/1.35 % set(auto_setup) -> set(predicate_elim).
% 0.87/1.35 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.87/1.35 % set(auto) -> set(auto_limits).
% 0.87/1.35 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.87/1.35 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.87/1.35 % set(auto) -> set(auto_denials).
% 0.87/1.35 % set(auto) -> set(auto_process).
% 0.87/1.35 % set(auto2) -> assign(new_constants, 1).
% 0.87/1.35 % set(auto2) -> assign(fold_denial_max, 3).
% 0.87/1.35 % set(auto2) -> assign(max_weight, "200.000").
% 0.87/1.35 % set(auto2) -> assign(max_hours, 1).
% 0.87/1.35 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.87/1.35 % set(auto2) -> assign(max_seconds, 0).
% 0.87/1.35 % set(auto2) -> assign(max_minutes, 5).
% 0.87/1.35 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.87/1.35 % set(auto2) -> set(sort_initial_sos).
% 0.87/1.35 % set(auto2) -> assign(sos_limit, -1).
% 0.87/1.35 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.87/1.35 % set(auto2) -> assign(max_megs, 400).
% 0.87/1.35 % set(auto2) -> assign(stats, some).
% 0.87/1.35 % set(auto2) -> clear(echo_input).
% 0.87/1.35 % set(auto2) -> set(quiet).
% 0.87/1.35 % set(auto2) -> clear(print_initial_clauses).
% 0.87/1.35 % set(auto2) -> clear(print_given).
% 0.87/1.35 assign(lrs_ticks,-1).
% 0.87/1.35 assign(sos_limit,10000).
% 0.87/1.35 assign(order,kbo).
% 0.87/1.35 set(lex_order_vars).
% 0.87/1.35 clear(print_given).
% 0.87/1.35
% 0.87/1.35 % formulas(sos). % not echoed (1 formulas)
% 0.87/1.35
% 0.87/1.35 ============================== end of input ==========================
% 0.87/1.35
% 0.87/1.35 % From the command line: assign(max_seconds, 300).
% 0.87/1.35
% 0.87/1.35 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.87/1.35
% 0.87/1.35 % Formulas that are not ordinary clauses:
% 0.87/1.35 1 --(exists X -(-((all Y (-r1(X,Y) | -(p6(Y) & (all X (-r1(Y,X) | p6(X)))) | p5(Y))) | (all Y (-r1(X,Y) | p6(Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X))) & p5(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p6(X) & (all Y (-r1(X,Y) | p6(Y)))) | p5(X))) | p6(Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X))) & p5(Y)))) & (all Y (-r1(X,Y) | -(p6(Y) & (all X (-r1(Y,X) | p6(X)))) | p5(Y) | (all X (-r1(Y,X) | p6(X) | -(p5(X) & (all Y (-r1(X,Y) | p5(Y))) & p5(X)))))) & (all Y (-r1(X,Y) | -(p6(Y) & (all X (-r1(Y,X) | p6(X)))) | p5(Y) | p6(Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X))) & p5(Y)))))) | -((all Y (-r1(X,Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X)))) | p4(Y))) | (all Y (-r1(X,Y) | p5(Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X))) & p4(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p5(X) & (all Y (-r1(X,Y) | p5(Y)))) | p4(X))) | p5(Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X))) & p4(Y)))) & (all Y (-r1(X,Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X)))) | p4(Y) | (all X (-r1(Y,X) | p5(X) | -(p4(X) & (all Y (-r1(X,Y) | p4(Y))) & p4(X)))))) & (all Y (-r1(X,Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X)))) | p4(Y) | p5(Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X))) & p4(Y)))))) | -((all Y (-r1(X,Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X)))) | p3(Y))) | (all Y (-r1(X,Y) | p4(Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X))) & p3(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p4(X) & (all Y (-r1(X,Y) | p4(Y)))) | p3(X))) | p4(Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X))) & p3(Y)))) & (all Y (-r1(X,Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X)))) | p3(Y) | (all X (-r1(Y,X) | p4(X) | -(p3(X) & (all Y (-r1(X,Y) | p3(Y))) & p3(X)))))) & (all Y (-r1(X,Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X)))) | p3(Y) | p4(Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X))) & p3(Y)))))) | -((all Y (-r1(X,Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X)))) | p2(Y))) | (all Y (-r1(X,Y) | p3(Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X))) & p2(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p3(X) & (all Y (-r1(X,Y) | p3(Y)))) | p2(X))) | p3(Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X))) & p2(Y)))) & (all Y (-r1(X,Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X)))) | p2(Y) | (all X (-r1(Y,X) | p3(X) | -(p2(X) & (all Y (-r1(X,Y) | p2(Y))) & p2(X)))))) & (all Y (-r1(X,Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X)))) | p2(Y) | p3(Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X))) & p2(Y)))))) | (all Y (-r1(X,Y) | p5(Y) | -((all X (-r1(Y,X) | p5(X))) & p5(Y)))) | (all Y (-r1(X,Y) | p5(Y) | -((all X (-r1(Y,X) | p5(X))) & p5(Y)))) | -((all Y (-r1(X,Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X)))) | p1(Y))) | (all Y (-r1(X,Y) | p2(Y) | -(p1(Y) & (all X (-r1(Y,X) | p1(X))) & p1(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p2(X) & (all Y (-r1(X,Y) | p2(Y)))) | p1(X))) | p2(Y) | -(p1(Y) & (all X (-r1(Y,X) | p1(X))) & p1(Y)))) & (all Y (-r1(X,Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X)))) | p1(Y) | (all X (-r1(Y,X) | p2(X) | -(p1(X) & (all Y (-r1(X,Y) | p1(Y))) & p1(X)))))) & (all Y (-r1(X,Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X)))) | p1(Y) | p2(Y) | -(p1(Y) & (all X (-r1(Y,X) | p1(X))) & p1(Y)))))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.87/1.35
% 0.87/1.35 ============================== end of process non-clausal formulas ===
% 0.87/1.35
% 0.87/1.35 ============================== PROCESS INITIAL CLAUSES ===============
% 0.87/1.35
% 0.87/1.35 ============================== PREDICATE ELIMINATION =================
% 0.87/1.35
% 0.87/1.35 ============================== end predicate elimination =============
% 0.87/1.35
% 0.87/1.35 Auto_denials:
% 0.87/1.35 % copying label main to answer in negative clause
% 0.87/1.35
% 0.87/1.35 Term ordering decisions:
% 0.87/1.35 Function symbol KB weights:
% 0.87/1.35
% 0.87/1.35 ============================== PROOF =================================
% 0.87/1.35 % SZS status Theorem
% 0.87/1.35 % SZS output start Refutation
% 0.87/1.35
% 0.87/1.35 % Proof 1 at 0.23 (+ 0.00) seconds: main.
% 0.87/1.35 % Length of proof is 2.
% 0.87/1.35 % Level of proof is 1.
% 0.87/1.35 % Maximum clause weight is 0.000.
% 0.87/1.35 % Given clauses 0.
% 0.87/1.35
% 0.87/1.35 1 --(exists X -(-((all Y (-r1(X,Y) | -(p6(Y) & (all X (-r1(Y,X) | p6(X)))) | p5(Y))) | (all Y (-r1(X,Y) | p6(Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X))) & p5(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p6(X) & (all Y (-r1(X,Y) | p6(Y)))) | p5(X))) | p6(Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X))) & p5(Y)))) & (all Y (-r1(X,Y) | -(p6(Y) & (all X (-r1(Y,X) | p6(X)))) | p5(Y) | (all X (-r1(Y,X) | p6(X) | -(p5(X) & (all Y (-r1(X,Y) | p5(Y))) & p5(X)))))) & (all Y (-r1(X,Y) | -(p6(Y) & (all X (-r1(Y,X) | p6(X)))) | p5(Y) | p6(Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X))) & p5(Y)))))) | -((all Y (-r1(X,Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X)))) | p4(Y))) | (all Y (-r1(X,Y) | p5(Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X))) & p4(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p5(X) & (all Y (-r1(X,Y) | p5(Y)))) | p4(X))) | p5(Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X))) & p4(Y)))) & (all Y (-r1(X,Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X)))) | p4(Y) | (all X (-r1(Y,X) | p5(X) | -(p4(X) & (all Y (-r1(X,Y) | p4(Y))) & p4(X)))))) & (all Y (-r1(X,Y) | -(p5(Y) & (all X (-r1(Y,X) | p5(X)))) | p4(Y) | p5(Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X))) & p4(Y)))))) | -((all Y (-r1(X,Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X)))) | p3(Y))) | (all Y (-r1(X,Y) | p4(Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X))) & p3(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p4(X) & (all Y (-r1(X,Y) | p4(Y)))) | p3(X))) | p4(Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X))) & p3(Y)))) & (all Y (-r1(X,Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X)))) | p3(Y) | (all X (-r1(Y,X) | p4(X) | -(p3(X) & (all Y (-r1(X,Y) | p3(Y))) & p3(X)))))) & (all Y (-r1(X,Y) | -(p4(Y) & (all X (-r1(Y,X) | p4(X)))) | p3(Y) | p4(Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X))) & p3(Y)))))) | -((all Y (-r1(X,Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X)))) | p2(Y))) | (all Y (-r1(X,Y) | p3(Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X))) & p2(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p3(X) & (all Y (-r1(X,Y) | p3(Y)))) | p2(X))) | p3(Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X))) & p2(Y)))) & (all Y (-r1(X,Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X)))) | p2(Y) | (all X (-r1(Y,X) | p3(X) | -(p2(X) & (all Y (-r1(X,Y) | p2(Y))) & p2(X)))))) & (all Y (-r1(X,Y) | -(p3(Y) & (all X (-r1(Y,X) | p3(X)))) | p2(Y) | p3(Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X))) & p2(Y)))))) | (all Y (-r1(X,Y) | p5(Y) | -((all X (-r1(Y,X) | p5(X))) & p5(Y)))) | (all Y (-r1(X,Y) | p5(Y) | -((all X (-r1(Y,X) | p5(X))) & p5(Y)))) | -((all Y (-r1(X,Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X)))) | p1(Y))) | (all Y (-r1(X,Y) | p2(Y) | -(p1(Y) & (all X (-r1(Y,X) | p1(X))) & p1(Y)))) | -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p2(X) & (all Y (-r1(X,Y) | p2(Y)))) | p1(X))) | p2(Y) | -(p1(Y) & (all X (-r1(Y,X) | p1(X))) & p1(Y)))) & (all Y (-r1(X,Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X)))) | p1(Y) | (all X (-r1(Y,X) | p2(X) | -(p1(X) & (all Y (-r1(X,Y) | p1(Y))) & p1(X)))))) & (all Y (-r1(X,Y) | -(p2(Y) & (all X (-r1(Y,X) | p2(X)))) | p1(Y) | p2(Y) | -(p1(Y) & (all X (-r1(Y,X) | p1(X))) & p1(Y)))))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.87/1.35 2 $F # label(main) # label(negated_conjecture) # answer(main). [clausify(1)].
% 0.87/1.35
% 0.87/1.35 % SZS output end Refutation
% 0.87/1.35 ============================== end of proof ==========================
% 0.87/1.35
% 0.87/1.35 ============================== STATISTICS ============================
% 0.87/1.35
% 0.87/1.35 Given=0. Generated=1. Kept=0. proofs=1.
% 0.87/1.35 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=1. Hints=0.
% 0.87/1.35 Megabytes=0.36.
% 0.87/1.35 User_CPU=0.23, System_CPU=0.00, Wall_clock=1.
% 0.87/1.35
% 0.87/1.35 ============================== end of statistics =====================
% 0.87/1.35
% 0.87/1.35 ============================== end of search =========================
% 0.87/1.35
% 0.87/1.35 THEOREM PROVED
% 0.87/1.35 % SZS status Theorem
% 0.87/1.35
% 0.87/1.35 Exiting with 1 proof.
% 0.87/1.35
% 0.87/1.35 Process 30482 exit (max_proofs) Sun Jul 3 16:24:16 2022
% 0.87/1.35 Prover9 interrupted
%------------------------------------------------------------------------------