TSTP Solution File: LCL675+1.010 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL675+1.010 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:49:06 EDT 2022
% Result : Unknown 47.54s 47.82s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL675+1.010 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.32 % Computer : n028.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 08:19:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.73/1.04 ============================== Prover9 ===============================
% 0.73/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.04 Process 18200 was started by sandbox on n028.cluster.edu,
% 0.73/1.04 Mon Jul 4 08:19:05 2022
% 0.73/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18046_n028.cluster.edu".
% 0.73/1.04 ============================== end of head ===========================
% 0.73/1.04
% 0.73/1.04 ============================== INPUT =================================
% 0.73/1.04
% 0.73/1.04 % Reading from file /tmp/Prover9_18046_n028.cluster.edu
% 0.73/1.04
% 0.73/1.04 set(prolog_style_variables).
% 0.73/1.04 set(auto2).
% 0.73/1.04 % set(auto2) -> set(auto).
% 0.73/1.04 % set(auto) -> set(auto_inference).
% 0.73/1.04 % set(auto) -> set(auto_setup).
% 0.73/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.04 % set(auto) -> set(auto_limits).
% 0.73/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.04 % set(auto) -> set(auto_denials).
% 0.73/1.04 % set(auto) -> set(auto_process).
% 0.73/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.04 % set(auto2) -> assign(stats, some).
% 0.73/1.04 % set(auto2) -> clear(echo_input).
% 0.73/1.04 % set(auto2) -> set(quiet).
% 0.73/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.04 % set(auto2) -> clear(print_given).
% 0.73/1.04 assign(lrs_ticks,-1).
% 0.73/1.04 assign(sos_limit,10000).
% 0.73/1.04 assign(order,kbo).
% 0.73/1.04 set(lex_order_vars).
% 0.73/1.04 clear(print_given).
% 0.73/1.04
% 0.73/1.04 % formulas(sos). % not echoed (3 formulas)
% 0.73/1.04
% 0.73/1.04 ============================== end of input ==========================
% 0.73/1.04
% 0.73/1.04 % From the command line: assign(max_seconds, 300).
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.04
% 0.73/1.04 % Formulas that are not ordinary clauses:
% 0.73/1.04 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.04 2 (all X all Y all Z (r1(X,Y) & r1(Y,Z) -> r1(X,Z))) # label(transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.04 3 --(exists X ((all Y (-r1(X,Y) | (-(all X (-r1(Y,X) | -(-p11(X) & -p111(X) & p110(X)))) & -(all X (-r1(Y,X) | -(p11(X) & -p111(X) & p110(X)))) | -(-p110(Y) & p109(Y))) & (-(all X (-r1(Y,X) | -(-p10(X) & -p110(X) & p109(X)))) & -(all X (-r1(Y,X) | -(p10(X) & -p110(X) & p109(X)))) | -(-p109(Y) & p108(Y))) & (-(all X (-r1(Y,X) | -(-p9(X) & -p109(X) & p108(X)))) & -(all X (-r1(Y,X) | -(p9(X) & -p109(X) & p108(X)))) | -(-p108(Y) & p107(Y))) & (-(all X (-r1(Y,X) | -(-p8(X) & -p108(X) & p107(X)))) & -(all X (-r1(Y,X) | -(p8(X) & -p108(X) & p107(X)))) | -(-p107(Y) & p106(Y))) & (-(all X (-r1(Y,X) | -(-p7(X) & -p107(X) & p106(X)))) & -(all X (-r1(Y,X) | -(p7(X) & -p107(X) & p106(X)))) | -(-p106(Y) & p105(Y))) & (-(all X (-r1(Y,X) | -(-p6(X) & -p106(X) & p105(X)))) & -(all X (-r1(Y,X) | -(p6(X) & -p106(X) & p105(X)))) | -(-p105(Y) & p104(Y))) & (-(all X (-r1(Y,X) | -(-p5(X) & -p105(X) & p104(X)))) & -(all X (-r1(Y,X) | -(p5(X) & -p105(X) & p104(X)))) | -(-p104(Y) & p103(Y))) & (-(all X (-r1(Y,X) | -(-p4(X) & -p104(X) & p103(X)))) & -(all X (-r1(Y,X) | -(p4(X) & -p104(X) & p103(X)))) | -(-p103(Y) & p102(Y))) & (-(all X (-r1(Y,X) | -(-p3(X) & -p103(X) & p102(X)))) & -(all X (-r1(Y,X) | -(p3(X) & -p103(X) & p102(X)))) | -(-p102(Y) & p101(Y))) & (-(all X (-r1(Y,X) | -(-p2(X) & -p102(X) & p101(X)))) & -(all X (-r1(Y,X) | -(p2(X) & -p102(X) & p101(X)))) | -(-p101(Y) & p100(Y))) & (((all X (-r1(Y,X) | -p11(X) | -p110(X))) | p11(Y)) & ((all X (-r1(Y,X) | p11(X) | -p110(X))) | -p11(Y)) | -p110(Y)) & (((all X (-r1(Y,X) | -p10(X) | -p109(X))) | p10(Y)) & ((all X (-r1(Y,X) | p10(X) | -p109(X))) | -p10(Y)) | -p109(Y)) & (((all X (-r1(Y,X) | -p9(X) | -p108(X))) | p9(Y)) & ((all X (-r1(Y,X) | p9(X) | -p108(X))) | -p9(Y)) | -p108(Y)) & (((all X (-r1(Y,X) | -p8(X) | -p107(X))) | p8(Y)) & ((all X (-r1(Y,X) | p8(X) | -p107(X))) | -p8(Y)) | -p107(Y)) & (((all X (-r1(Y,X) | -p7(X) | -p106(X))) | p7(Y)) & ((all X (-r1(Y,X) | p7(X) | -p106(X))) | -p7(Y)) | -p106(Y)) & (((all X (-r1(Y,X) | -p6(X) | -p105(X))) | p6(Y)) & ((all X (-r1(Y,X) | p6(X) | -p105(X))) | -p6(Y)) | -p105(Y)) & (((all X (-r1(Y,X) | -p5(X) | -p104(X))) | p5(Y)) & ((all X (-r1(Y,X) | p5(X) | -p104(X))) | -p5(Y)) | -p104(Y)) & (((all X (-r1(Y,X) | -p4(X) | -p103(X))) | p4(Y)) & ((all X (-r1(Y,X) | p4(X) | -p103(X))) | -p4(Y)) | -p103(Y)) & (((all X (-r1(Y,X) | -p3(X) | -p102(X))) | p3(Y)) & ((all X (-r1(Y,X) | p3(X) | -p102(X))) | -p3(Y)) | -p102(Y)) & (((all X (-r1(Y,X) | -p2(X) | -p101(X))) | p2(Y)) & ((all X (-r1(Y,X) | p2(X) | -p101(X))) | -p2(Y)) | -p101(Y)) & (((all X (-r1(Y,X) | -p1(X) | -p100(X))) | p1(Y)) & ((all X (-r1(Y,X) | p1(X) | -p100(X))) | -p1(Y)) | -p100(Y)) & (p110(Y) | -p111(Y)) & (p109(Y) | -p110(Y)) & (p108(Y) | -p109(Y)) & (p107(Y) | -p108(Y)) & (p106(Y) | -p107(Y)) & (p105(Y) | -p106(Y)) & (p104(Y) | -p105(Y)) & (p103(Y) | -p104(Y)) & (p102(Y) | -p103(Y)) & (p101(Y) | -p102(Y)) & (p100(Y) | -p101(Y)))) & -p101(X) & p100(X))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 47.54/47.82
% 47.54/47.82 ============================== end of process non-clausal formulas ===
% 47.54/47.82
% 47.54/47.82 ============================== PROCESS INITIAL CLAUSES ===============
% 47.54/47.82
% 47.54/47.82 ============================== PREDICATE ELIMINATION =================
% 47.54/47.82
% 47.54/47.82 ============================== end predicate elimination =============
% 47.54/47.82
% 47.54/47.82 Auto_denials: (non-Horn, no changes).
% 47.54/47.82
% 47.54/47.82 Term ordering decisions:
% 47.54/47.82 Function symbol KB weights: c1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1.
% 47.54/47.82
% 47.54/47.82 ============================== end of process initial clauses ========
% 47.54/47.82
% 47.54/47.82 ============================== CLAUSES FOR SEARCH ====================
% 47.54/47.82
% 47.54/47.82 ============================== end of clauses for search =============
% 47.54/47.82
% 47.54/47.82 ============================== SEARCH ================================
% 47.54/47.82
% 47.54/47.82 % Starting search at 0.03 seconds.
% 47.54/47.82
% 47.54/47.82 Low Water (keep): wt=25.000, iters=3692
% 47.54/47.82
% 47.54/47.82 Low Water (keep): wt=21.000, iters=3397
% 47.54/47.82
% 47.54/47.82 Low Water (keep): wt=20.000, iters=3335
% 47.54/47.82
% 47.54/47.82 Low Water (keep): wt=19.000, iters=3340
% 47.54/47.82
% 47.54/47.82 Low Water (keep): wt=18.000, iters=3336
% 47.54/47.82
% 47.54/47.82 Low Water (keep): wt=17.000, iters=3351
% 47.54/47.82
% 47.54/47.82 ============================== STATISTICS ============================
% 47.54/47.82
% 47.54/47.82 Given=79029. Generated=635859. Kept=129058. proofs=0.
% 47.54/47.82 Usable=76403. Sos=0. Demods=0. Limbo=0, Disabled=52772. Hints=0.
% 47.54/47.82 Megabytes=123.02.
% 47.54/47.82 User_CPU=46.38, System_CPU=0.41, Wall_clock=47.
% 47.54/47.82
% 47.54/47.82 ============================== end of statistics =====================
% 47.54/47.82
% 47.54/47.82 ============================== end of search =========================
% 47.54/47.82
% 47.54/47.82 SEARCH FAILED
% 47.54/47.82
% 47.54/47.82 Exiting with failure.
% 47.54/47.82
% 47.54/47.82 Process 18200 exit (sos_empty) Mon Jul 4 08:19:52 2022
% 47.54/47.82 Prover9 interrupted
%------------------------------------------------------------------------------