TSTP Solution File: LCL674+1.020 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL674+1.020 : 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:49:05 EDT 2022
% Result : Theorem 2.33s 2.61s
% Output : Refutation 2.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL674+1.020 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 08:59:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.90/1.22 ============================== Prover9 ===============================
% 0.90/1.22 Prover9 (32) version 2009-11A, November 2009.
% 0.90/1.22 Process 20839 was started by sandbox2 on n020.cluster.edu,
% 0.90/1.22 Mon Jul 4 09:00:00 2022
% 0.90/1.22 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20685_n020.cluster.edu".
% 0.90/1.22 ============================== end of head ===========================
% 0.90/1.22
% 0.90/1.22 ============================== INPUT =================================
% 0.90/1.22
% 0.90/1.22 % Reading from file /tmp/Prover9_20685_n020.cluster.edu
% 0.90/1.22
% 0.90/1.22 set(prolog_style_variables).
% 0.90/1.22 set(auto2).
% 0.90/1.22 % set(auto2) -> set(auto).
% 0.90/1.22 % set(auto) -> set(auto_inference).
% 0.90/1.22 % set(auto) -> set(auto_setup).
% 0.90/1.22 % set(auto_setup) -> set(predicate_elim).
% 0.90/1.22 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.90/1.22 % set(auto) -> set(auto_limits).
% 0.90/1.22 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.90/1.22 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.90/1.22 % set(auto) -> set(auto_denials).
% 0.90/1.22 % set(auto) -> set(auto_process).
% 0.90/1.22 % set(auto2) -> assign(new_constants, 1).
% 0.90/1.22 % set(auto2) -> assign(fold_denial_max, 3).
% 0.90/1.22 % set(auto2) -> assign(max_weight, "200.000").
% 0.90/1.22 % set(auto2) -> assign(max_hours, 1).
% 0.90/1.22 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.90/1.22 % set(auto2) -> assign(max_seconds, 0).
% 0.90/1.22 % set(auto2) -> assign(max_minutes, 5).
% 0.90/1.22 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.90/1.22 % set(auto2) -> set(sort_initial_sos).
% 0.90/1.22 % set(auto2) -> assign(sos_limit, -1).
% 0.90/1.22 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.90/1.22 % set(auto2) -> assign(max_megs, 400).
% 0.90/1.22 % set(auto2) -> assign(stats, some).
% 0.90/1.22 % set(auto2) -> clear(echo_input).
% 0.90/1.22 % set(auto2) -> set(quiet).
% 0.90/1.22 % set(auto2) -> clear(print_initial_clauses).
% 0.90/1.22 % set(auto2) -> clear(print_given).
% 0.90/1.22 assign(lrs_ticks,-1).
% 0.90/1.22 assign(sos_limit,10000).
% 0.90/1.22 assign(order,kbo).
% 0.90/1.22 set(lex_order_vars).
% 0.90/1.22 clear(print_given).
% 0.90/1.22
% 0.90/1.22 % formulas(sos). % not echoed (3 formulas)
% 0.90/1.22
% 0.90/1.22 ============================== end of input ==========================
% 0.90/1.22
% 0.90/1.22 % From the command line: assign(max_seconds, 300).
% 0.90/1.22
% 0.90/1.22 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.90/1.22
% 0.90/1.22 % Formulas that are not ordinary clauses:
% 0.90/1.22 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.90/1.22 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.90/1.22 3 --(exists X -(-(all Y (-r1(X,Y) | p8(Y))) | -((all Y (-r1(X,Y) | (-(all X (-r1(Y,X) | -(-p21(X) & -p121(X) & p120(X)))) & -(all X (-r1(Y,X) | -(p21(X) & -p121(X) & p120(X)))) | -(-p120(Y) & p119(Y))) & (-(all X (-r1(Y,X) | -(-p20(X) & -p120(X) & p119(X)))) & -(all X (-r1(Y,X) | -(p20(X) & -p120(X) & p119(X)))) | -(-p119(Y) & p118(Y))) & (-(all X (-r1(Y,X) | -(-p19(X) & -p119(X) & p118(X)))) & -(all X (-r1(Y,X) | -(p19(X) & -p119(X) & p118(X)))) | -(-p118(Y) & p117(Y))) & (-(all X (-r1(Y,X) | -(-p18(X) & -p118(X) & p117(X)))) & -(all X (-r1(Y,X) | -(p18(X) & -p118(X) & p117(X)))) | -(-p117(Y) & p116(Y))) & (-(all X (-r1(Y,X) | -(-p17(X) & -p117(X) & p116(X)))) & -(all X (-r1(Y,X) | -(p17(X) & -p117(X) & p116(X)))) | -(-p116(Y) & p115(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) | -(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) | -p21(X) | -p120(X))) | p21(Y)) & ((all X (-r1(Y,X) | p21(X) | -p120(X))) | -p21(Y)) | -p120(Y)) & (((all X (-r1(Y,X) | -p20(X) | -p119(X))) | p20(Y)) & ((all X (-r1(Y,X) | p20(X) | -p119(X))) | -p20(Y)) | -p119(Y)) & (((all X (-r1(Y,X) | -p19(X) | -p118(X))) | p19(Y)) & ((all X (-r1(Y,X) | p19(X) | -p118(X))) | -p19(Y)) | -p118(Y)) & (((all X (-r1(Y,X) | -p18(X) | -p117(X))) | p18(Y)) & ((all X (-r1(Y,X) | p18(X) | -p117(X))) | -p18(Y)) | -p117(Y)) & (((all X (-r1(Y,X) | -p17(X) | -p116(X))) | p17(Y)) & ((all X (-r1(Y,X) | p17(X) | -p116(X))) | -p17(Y)) | -p116(Y)) & (((all X (-r1(Y,X) | -p16(X) | -p115(X))) | p16(Y)) & ((all X (-r1(Y,X) | p16(X) | -p115(X))) | -p16(Y)) | -p115(Y)) & (((all X (-r1(Y,X) | -p15(X) | -p114(X))) | p15(Y)) & ((all X (-r1(Y,X) | p15(X) | -p114(X))) | -p15(Y)) | -p114(Y)) & (((all X (-r1(Y,X) | -p14(X) | -p113(X))) | p14(Y)) & ((all X (-r1(Y,X) | p14(X) | -p113(X))) | -p14(Y)) | -p113(Y)) & (((all X (-r1(Y,X) | -p13(X) | -p112(X))) | p13(Y)) & ((all X (-r1(Y,X) | p13(X) | -p112(X))) | -p13(Y)) | -p112(Y)) & (((all X (-r1(Y,X) | -p12(X) | -p111(X))) | p12(Y)) & ((all X (-r1(Y,X) | p12(X) | -p111(X))) | -p12(Y)) | -p111(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)) & (p120(Y) | -p121(Y)) & (p119(Y) | -p120(Y)) & (p118(Y) | -p119(Y)) & (p117(Y) | -p118(Y)) & (p116(Y) | -p117(Y)) & (p115(Y) | -p116(Y)) & (p114(Y) | -p115(Y)) & (p113(Y) | -p114(Y)) & (p112(Y) | -p113(Y)) & (p111(Y) | -p112(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].
% 0.90/1.22
% 0.90/1.22 ============================== end of process non-clausal formulas ===
% 2.33/2.61
% 2.33/2.61 ============================== PROCESS INITIAL CLAUSES ===============
% 2.33/2.61
% 2.33/2.61 ============================== PREDICATE ELIMINATION =================
% 2.33/2.61
% 2.33/2.61 ============================== end predicate elimination =============
% 2.33/2.61
% 2.33/2.61 Auto_denials: (non-Horn, no changes).
% 2.33/2.61
% 2.33/2.61 Term ordering decisions:
% 2.33/2.61 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. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1.
% 2.33/2.61
% 2.33/2.61 ============================== end of process initial clauses ========
% 2.33/2.61
% 2.33/2.61 ============================== CLAUSES FOR SEARCH ====================
% 2.33/2.61
% 2.33/2.61 ============================== end of clauses for search =============
% 2.33/2.61
% 2.33/2.61 ============================== SEARCH ================================
% 2.33/2.61
% 2.33/2.61 % Starting search at 0.09 seconds.
% 2.33/2.61
% 2.33/2.61 ============================== PROOF =================================
% 2.33/2.61 % SZS status Theorem
% 2.33/2.61 % SZS output start Refutation
% 2.33/2.61
% 2.33/2.61 % Proof 1 at 1.42 (+ 0.04) seconds.
% 2.33/2.61 % Length of proof is 61.
% 2.33/2.61 % Level of proof is 15.
% 2.33/2.61 % Maximum clause weight is 16.000.
% 2.33/2.61 % Given clauses 6357.
% 2.33/2.61
% 2.33/2.61 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 2.33/2.61 2 (all X all Y all Z (r1(X,Y) & r1(Y,Z) -> r1(X,Z))) # label(transitivity) # label(axiom) # label(non_clause). [assumption].
% 2.33/2.61 3 --(exists X -(-(all Y (-r1(X,Y) | p8(Y))) | -((all Y (-r1(X,Y) | (-(all X (-r1(Y,X) | -(-p21(X) & -p121(X) & p120(X)))) & -(all X (-r1(Y,X) | -(p21(X) & -p121(X) & p120(X)))) | -(-p120(Y) & p119(Y))) & (-(all X (-r1(Y,X) | -(-p20(X) & -p120(X) & p119(X)))) & -(all X (-r1(Y,X) | -(p20(X) & -p120(X) & p119(X)))) | -(-p119(Y) & p118(Y))) & (-(all X (-r1(Y,X) | -(-p19(X) & -p119(X) & p118(X)))) & -(all X (-r1(Y,X) | -(p19(X) & -p119(X) & p118(X)))) | -(-p118(Y) & p117(Y))) & (-(all X (-r1(Y,X) | -(-p18(X) & -p118(X) & p117(X)))) & -(all X (-r1(Y,X) | -(p18(X) & -p118(X) & p117(X)))) | -(-p117(Y) & p116(Y))) & (-(all X (-r1(Y,X) | -(-p17(X) & -p117(X) & p116(X)))) & -(all X (-r1(Y,X) | -(p17(X) & -p117(X) & p116(X)))) | -(-p116(Y) & p115(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) | -(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) | -p21(X) | -p120(X))) | p21(Y)) & ((all X (-r1(Y,X) | p21(X) | -p120(X))) | -p21(Y)) | -p120(Y)) & (((all X (-r1(Y,X) | -p20(X) | -p119(X))) | p20(Y)) & ((all X (-r1(Y,X) | p20(X) | -p119(X))) | -p20(Y)) | -p119(Y)) & (((all X (-r1(Y,X) | -p19(X) | -p118(X))) | p19(Y)) & ((all X (-r1(Y,X) | p19(X) | -p118(X))) | -p19(Y)) | -p118(Y)) & (((all X (-r1(Y,X) | -p18(X) | -p117(X))) | p18(Y)) & ((all X (-r1(Y,X) | p18(X) | -p117(X))) | -p18(Y)) | -p117(Y)) & (((all X (-r1(Y,X) | -p17(X) | -p116(X))) | p17(Y)) & ((all X (-r1(Y,X) | p17(X) | -p116(X))) | -p17(Y)) | -p116(Y)) & (((all X (-r1(Y,X) | -p16(X) | -p115(X))) | p16(Y)) & ((all X (-r1(Y,X) | p16(X) | -p115(X))) | -p16(Y)) | -p115(Y)) & (((all X (-r1(Y,X) | -p15(X) | -p114(X))) | p15(Y)) & ((all X (-r1(Y,X) | p15(X) | -p114(X))) | -p15(Y)) | -p114(Y)) & (((all X (-r1(Y,X) | -p14(X) | -p113(X))) | p14(Y)) & ((all X (-r1(Y,X) | p14(X) | -p113(X))) | -p14(Y)) | -p113(Y)) & (((all X (-r1(Y,X) | -p13(X) | -p112(X))) | p13(Y)) & ((all X (-r1(Y,X) | p13(X) | -p112(X))) | -p13(Y)) | -p112(Y)) & (((all X (-r1(Y,X) | -p12(X) | -p111(X))) | p12(Y)) & ((all X (-r1(Y,X) | p12(X) | -p111(X))) | -p12(Y)) | -p111(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)) & (p120(Y) | -p121(Y)) & (p119(Y) | -p120(Y)) & (p118(Y) | -p119(Y)) & (p117(Y) | -p118(Y)) & (p116(Y) | -p117(Y)) & (p115(Y) | -p116(Y)) & (p114(Y) | -p115(Y)) & (p113(Y) | -p114(Y)) & (p112(Y) | -p113(Y)) & (p111(Y) | -p112(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].
% 2.33/2.61 4 r1(A,A) # label(reflexivity) # label(axiom). [clausify(1)].
% 2.33/2.61 5 -r1(A,B) | -r1(B,C) | r1(A,C) # label(transitivity) # label(axiom). [clausify(2)].
% 2.33/2.61 6 -r1(c1,A) | p8(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 109 -r1(c1,A) | r1(A,f27(A)) | p107(A) | -p106(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 110 -r1(c1,A) | -p8(f27(A)) | p107(A) | -p106(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 121 -r1(c1,A) | r1(A,f30(A)) | p106(A) | -p105(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 123 -r1(c1,A) | -p107(f30(A)) | p106(A) | -p105(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 124 -r1(c1,A) | p106(f30(A)) | p106(A) | -p105(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 129 -r1(c1,A) | r1(A,f32(A)) | p105(A) | -p104(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 131 -r1(c1,A) | -p106(f32(A)) | p105(A) | -p104(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 132 -r1(c1,A) | p105(f32(A)) | p105(A) | -p104(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 137 -r1(c1,A) | r1(A,f34(A)) | p104(A) | -p103(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 139 -r1(c1,A) | -p105(f34(A)) | p104(A) | -p103(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 140 -r1(c1,A) | p104(f34(A)) | p104(A) | -p103(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 141 -r1(c1,A) | r1(A,f35(A)) | p103(A) | -p102(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 143 -r1(c1,A) | -p104(f35(A)) | p103(A) | -p102(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 144 -r1(c1,A) | p103(f35(A)) | p103(A) | -p102(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 149 -r1(c1,A) | r1(A,f37(A)) | p102(A) | -p101(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 151 -r1(c1,A) | -p103(f37(A)) | p102(A) | -p101(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 152 -r1(c1,A) | p102(f37(A)) | p102(A) | -p101(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 157 -r1(c1,A) | r1(A,f39(A)) | p101(A) | -p100(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 159 -r1(c1,A) | -p102(f39(A)) | p101(A) | -p100(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 160 -r1(c1,A) | p101(f39(A)) | p101(A) | -p100(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 226 -p101(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 227 p100(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 2.33/2.61 371 r1(c1,f39(c1)). [resolve(157,a,4,a),unit_del(b,226),unit_del(c,227)].
% 2.33/2.61 373 -p102(f39(c1)). [resolve(159,a,4,a),unit_del(b,226),unit_del(c,227)].
% 2.33/2.61 374 p101(f39(c1)). [resolve(160,a,4,a),unit_del(b,226),unit_del(c,227)].
% 2.33/2.61 482 p102(f37(f39(c1))). [resolve(371,a,152,a),unit_del(b,373),unit_del(c,374)].
% 2.33/2.61 483 -p103(f37(f39(c1))). [resolve(371,a,151,a),unit_del(b,373),unit_del(c,374)].
% 2.33/2.61 485 r1(f39(c1),f37(f39(c1))). [resolve(371,a,149,a),unit_del(b,373),unit_del(c,374)].
% 2.33/2.61 488 -r1(f39(c1),A) | r1(c1,A). [resolve(371,a,5,a)].
% 2.33/2.61 544 r1(c1,f37(f39(c1))). [resolve(488,a,485,a)].
% 2.33/2.61 576 p103(f35(f37(f39(c1)))). [resolve(544,a,144,a),unit_del(b,483),unit_del(c,482)].
% 2.33/2.61 577 -p104(f35(f37(f39(c1)))). [resolve(544,a,143,a),unit_del(b,483),unit_del(c,482)].
% 2.33/2.61 579 r1(f37(f39(c1)),f35(f37(f39(c1)))). [resolve(544,a,141,a),unit_del(b,483),unit_del(c,482)].
% 2.33/2.61 582 -r1(f37(f39(c1)),A) | r1(c1,A). [resolve(544,a,5,a)].
% 2.33/2.61 744 r1(c1,f35(f37(f39(c1)))). [resolve(582,a,579,a)].
% 2.33/2.61 781 p104(f34(f35(f37(f39(c1))))). [resolve(744,a,140,a),unit_del(b,577),unit_del(c,576)].
% 2.33/2.61 782 -p105(f34(f35(f37(f39(c1))))). [resolve(744,a,139,a),unit_del(b,577),unit_del(c,576)].
% 2.33/2.61 784 r1(f35(f37(f39(c1))),f34(f35(f37(f39(c1))))). [resolve(744,a,137,a),unit_del(b,577),unit_del(c,576)].
% 2.33/2.61 791 -r1(f35(f37(f39(c1))),A) | r1(c1,A). [resolve(744,a,5,a)].
% 2.33/2.61 1312 r1(c1,f34(f35(f37(f39(c1))))). [resolve(784,a,791,a)].
% 2.33/2.61 1365 p105(f32(f34(f35(f37(f39(c1)))))). [resolve(1312,a,132,a),unit_del(b,782),unit_del(c,781)].
% 2.33/2.61 1366 -p106(f32(f34(f35(f37(f39(c1)))))). [resolve(1312,a,131,a),unit_del(b,782),unit_del(c,781)].
% 2.33/2.61 1368 r1(f34(f35(f37(f39(c1)))),f32(f34(f35(f37(f39(c1)))))). [resolve(1312,a,129,a),unit_del(b,782),unit_del(c,781)].
% 2.33/2.61 1375 -r1(f34(f35(f37(f39(c1)))),A) | r1(c1,A). [resolve(1312,a,5,a)].
% 2.33/2.61 2752 r1(c1,f32(f34(f35(f37(f39(c1)))))). [resolve(1368,a,1375,a)].
% 2.33/2.61 2815 p106(f30(f32(f34(f35(f37(f39(c1))))))). [resolve(2752,a,124,a),unit_del(b,1366),unit_del(c,1365)].
% 2.33/2.61 2816 -p107(f30(f32(f34(f35(f37(f39(c1))))))). [resolve(2752,a,123,a),unit_del(b,1366),unit_del(c,1365)].
% 2.33/2.61 2818 r1(f32(f34(f35(f37(f39(c1))))),f30(f32(f34(f35(f37(f39(c1))))))). [resolve(2752,a,121,a),unit_del(b,1366),unit_del(c,1365)].
% 2.33/2.61 2825 -r1(f32(f34(f35(f37(f39(c1))))),A) | r1(c1,A). [resolve(2752,a,5,a)].
% 2.33/2.61 6123 r1(c1,f30(f32(f34(f35(f37(f39(c1))))))). [resolve(2818,a,2825,a)].
% 2.33/2.61 6199 -p8(f27(f30(f32(f34(f35(f37(f39(c1)))))))). [resolve(6123,a,110,a),unit_del(b,2816),unit_del(c,2815)].
% 2.33/2.61 6200 r1(f30(f32(f34(f35(f37(f39(c1)))))),f27(f30(f32(f34(f35(f37(f39(c1)))))))). [resolve(6123,a,109,a),unit_del(b,2816),unit_del(c,2815)].
% 2.33/2.61 6203 -r1(f30(f32(f34(f35(f37(f39(c1)))))),A) | r1(c1,A). [resolve(6123,a,5,a)].
% 2.33/2.61 13989 r1(c1,f27(f30(f32(f34(f35(f37(f39(c1)))))))). [resolve(6200,a,6203,a)].
% 2.33/2.61 14076 $F. [resolve(13989,a,6,a),unit_del(a,6199)].
% 2.33/2.61
% 2.33/2.61 % SZS output end Refutation
% 2.33/2.61 ============================== end of proof ==========================
% 2.33/2.61
% 2.33/2.61 ============================== STATISTICS ============================
% 2.33/2.61
% 2.33/2.61 Given=6357. Generated=58786. Kept=14072. proofs=1.
% 2.33/2.61 Usable=6347. Sos=1425. Demods=0. Limbo=78, Disabled=6450. Hints=0.
% 2.33/2.61 Megabytes=11.93.
% 2.33/2.61 User_CPU=1.42, System_CPU=0.04, Wall_clock=2.
% 2.33/2.61
% 2.33/2.61 ============================== end of statistics =====================
% 2.33/2.61
% 2.33/2.61 ============================== end of search =========================
% 2.33/2.61
% 2.33/2.61 THEOREM PROVED
% 2.33/2.61 % SZS status Theorem
% 2.33/2.61
% 2.33/2.61 Exiting with 1 proof.
% 2.33/2.61
% 2.33/2.61 Process 20839 exit (max_proofs) Mon Jul 4 09:00:02 2022
% 2.33/2.61 Prover9 interrupted
%------------------------------------------------------------------------------