TSTP Solution File: LCL675+1.015 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL675+1.015 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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 : Timeout 300.02s 300.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL675+1.015 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.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 : Sun Jul 3 15:16:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 ============================== Prover9 ===============================
% 0.42/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.06 Process 1453 was started by sandbox2 on n007.cluster.edu,
% 0.42/1.06 Sun Jul 3 15:16:41 2022
% 0.42/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1297_n007.cluster.edu".
% 0.42/1.06 ============================== end of head ===========================
% 0.42/1.06
% 0.42/1.06 ============================== INPUT =================================
% 0.42/1.06
% 0.42/1.06 % Reading from file /tmp/Prover9_1297_n007.cluster.edu
% 0.42/1.06
% 0.42/1.06 set(prolog_style_variables).
% 0.42/1.06 set(auto2).
% 0.42/1.06 % set(auto2) -> set(auto).
% 0.42/1.06 % set(auto) -> set(auto_inference).
% 0.42/1.06 % set(auto) -> set(auto_setup).
% 0.42/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.06 % set(auto) -> set(auto_limits).
% 0.42/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.06 % set(auto) -> set(auto_denials).
% 0.42/1.06 % set(auto) -> set(auto_process).
% 0.42/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.06 % set(auto2) -> assign(stats, some).
% 0.42/1.06 % set(auto2) -> clear(echo_input).
% 0.42/1.06 % set(auto2) -> set(quiet).
% 0.42/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.06 % set(auto2) -> clear(print_given).
% 0.42/1.06 assign(lrs_ticks,-1).
% 0.42/1.06 assign(sos_limit,10000).
% 0.42/1.06 assign(order,kbo).
% 0.42/1.06 set(lex_order_vars).
% 0.42/1.06 clear(print_given).
% 0.42/1.06
% 0.42/1.06 % formulas(sos). % not echoed (3 formulas)
% 0.42/1.06
% 0.42/1.06 ============================== end of input ==========================
% 0.42/1.06
% 0.42/1.06 % From the command line: assign(max_seconds, 300).
% 0.42/1.06
% 0.42/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.06
% 0.42/1.06 % Formulas that are not ordinary clauses:
% 0.42/1.06 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 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.42/1.06 3 --(exists X ((all Y (-r1(X,Y) | (-(all X (-r1(Y,X) | -(-p16(X) & -p116(X) & p115(X)))) & -(all X (-r1(Y,X) | -(p16(X) & -p116(X) & p115(X)))) | -(-p115(Y) & p114(Y))) & (-(all X (-r1(Y,X) | -(-p15(X) & -p115(X) & p114(X)))) & -(all X (-r1(Y,X) | -(p15(X) & -p115(X) & p114(X)))) | -(-p114(Y) & p113(Y))) & (-(all X (-r1(Y,X) | -(-p14(X) & -p114(X) & p113(X)))) & -(all X (-r1(Y,X) | -(p14(X) & -p114(X) & p113(X)))) | -(-p113(Y) & p112(Y))) & (-(all X (-r1(Y,X) | -(-p13(X) & -p113(X) & p112(X)))) & -(all X (-r1(Y,X) | -(p13(X) & -p113(X) & p112(X)))) | -(-p112(Y) & p111(Y))) & (-(all X (-r1(Y,X) | -(-p12(X) & -p112(X) & p111(X)))) & -(all X (-r1(Y,X) | -(p12(X) & -p112(X) & p111(X)))) | -(-p111(Y) & p110(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) | -(p4Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------