TSTP Solution File: LCL674+1.015 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL674+1.015 : TPTP v8.1.0. Released v4.0.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:49:04 EDT 2022
% Result : Theorem 1.32s 1.63s
% Output : Refutation 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL674+1.015 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n008.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 : Sat Jul 2 11:21:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.84/1.10 ============================== Prover9 ===============================
% 0.84/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.84/1.10 Process 24941 was started by sandbox on n008.cluster.edu,
% 0.84/1.10 Sat Jul 2 11:21:54 2022
% 0.84/1.10 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24788_n008.cluster.edu".
% 0.84/1.10 ============================== end of head ===========================
% 0.84/1.10
% 0.84/1.10 ============================== INPUT =================================
% 0.84/1.10
% 0.84/1.10 % Reading from file /tmp/Prover9_24788_n008.cluster.edu
% 0.84/1.10
% 0.84/1.10 set(prolog_style_variables).
% 0.84/1.10 set(auto2).
% 0.84/1.10 % set(auto2) -> set(auto).
% 0.84/1.10 % set(auto) -> set(auto_inference).
% 0.84/1.10 % set(auto) -> set(auto_setup).
% 0.84/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.84/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.84/1.10 % set(auto) -> set(auto_limits).
% 0.84/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.84/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.84/1.10 % set(auto) -> set(auto_denials).
% 0.84/1.10 % set(auto) -> set(auto_process).
% 0.84/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.84/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.84/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.84/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.84/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.84/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.84/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.84/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.84/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.84/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.84/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.84/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.84/1.10 % set(auto2) -> assign(stats, some).
% 0.84/1.10 % set(auto2) -> clear(echo_input).
% 0.84/1.10 % set(auto2) -> set(quiet).
% 0.84/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.84/1.10 % set(auto2) -> clear(print_given).
% 0.84/1.10 assign(lrs_ticks,-1).
% 0.84/1.10 assign(sos_limit,10000).
% 0.84/1.10 assign(order,kbo).
% 0.84/1.10 set(lex_order_vars).
% 0.84/1.10 clear(print_given).
% 0.84/1.10
% 0.84/1.10 % formulas(sos). % not echoed (3 formulas)
% 0.84/1.10
% 0.84/1.10 ============================== end of input ==========================
% 0.84/1.10
% 0.84/1.10 % From the command line: assign(max_seconds, 300).
% 0.84/1.10
% 0.84/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.84/1.10
% 0.84/1.10 % Formulas that are not ordinary clauses:
% 0.84/1.10 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 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.84/1.10 3 --(exists X -(-(all Y (-r1(X,Y) | p7(Y))) | -((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) | -(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) | -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)) & (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].
% 1.32/1.63
% 1.32/1.63 ============================== end of process non-clausal formulas ===
% 1.32/1.63
% 1.32/1.63 ============================== PROCESS INITIAL CLAUSES ===============
% 1.32/1.63
% 1.32/1.63 ============================== PREDICATE ELIMINATION =================
% 1.32/1.63
% 1.32/1.63 ============================== end predicate elimination =============
% 1.32/1.63
% 1.32/1.63 Auto_denials: (non-Horn, no changes).
% 1.32/1.63
% 1.32/1.63 Term ordering decisions:
% 1.32/1.63 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.
% 1.32/1.63
% 1.32/1.63 ============================== end of process initial clauses ========
% 1.32/1.63
% 1.32/1.63 ============================== CLAUSES FOR SEARCH ====================
% 1.32/1.63
% 1.32/1.63 ============================== end of clauses for search =============
% 1.32/1.63
% 1.32/1.63 ============================== SEARCH ================================
% 1.32/1.63
% 1.32/1.63 % Starting search at 0.06 seconds.
% 1.32/1.63
% 1.32/1.63 ============================== PROOF =================================
% 1.32/1.63 % SZS status Theorem
% 1.32/1.63 % SZS output start Refutation
% 1.32/1.63
% 1.32/1.63 % Proof 1 at 0.55 (+ 0.02) seconds.
% 1.32/1.63 % Length of proof is 54.
% 1.32/1.63 % Level of proof is 14.
% 1.32/1.63 % Maximum clause weight is 14.000.
% 1.32/1.63 % Given clauses 2746.
% 1.32/1.63
% 1.32/1.63 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 1.32/1.63 2 (all X all Y all Z (r1(X,Y) & r1(Y,Z) -> r1(X,Z))) # label(transitivity) # label(axiom) # label(non_clause). [assumption].
% 1.32/1.63 3 --(exists X -(-(all Y (-r1(X,Y) | p7(Y))) | -((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) | -(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) | -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)) & (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].
% 1.32/1.63 4 r1(A,A) # label(reflexivity) # label(axiom). [clausify(1)].
% 1.32/1.63 5 -r1(A,B) | -r1(B,C) | r1(A,C) # label(transitivity) # label(axiom). [clausify(2)].
% 1.32/1.63 6 -r1(c1,A) | p7(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 77 -r1(c1,A) | r1(A,f19(A)) | p106(A) | -p105(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 78 -r1(c1,A) | -p7(f19(A)) | p106(A) | -p105(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 89 -r1(c1,A) | r1(A,f22(A)) | p105(A) | -p104(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 91 -r1(c1,A) | -p106(f22(A)) | p105(A) | -p104(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 92 -r1(c1,A) | p105(f22(A)) | p105(A) | -p104(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 97 -r1(c1,A) | r1(A,f24(A)) | p104(A) | -p103(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 99 -r1(c1,A) | -p105(f24(A)) | p104(A) | -p103(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 100 -r1(c1,A) | p104(f24(A)) | p104(A) | -p103(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 105 -r1(c1,A) | r1(A,f26(A)) | p103(A) | -p102(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 107 -r1(c1,A) | -p104(f26(A)) | p103(A) | -p102(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 108 -r1(c1,A) | p103(f26(A)) | p103(A) | -p102(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 109 -r1(c1,A) | r1(A,f27(A)) | p102(A) | -p101(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 111 -r1(c1,A) | -p103(f27(A)) | p102(A) | -p101(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 112 -r1(c1,A) | p102(f27(A)) | p102(A) | -p101(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 117 -r1(c1,A) | r1(A,f29(A)) | p101(A) | -p100(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 119 -r1(c1,A) | -p102(f29(A)) | p101(A) | -p100(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 120 -r1(c1,A) | p101(f29(A)) | p101(A) | -p100(A) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 171 -p101(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 172 p100(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 1.32/1.63 276 r1(c1,f29(c1)). [resolve(117,a,4,a),unit_del(b,171),unit_del(c,172)].
% 1.32/1.63 278 -p102(f29(c1)). [resolve(119,a,4,a),unit_del(b,171),unit_del(c,172)].
% 1.32/1.63 279 p101(f29(c1)). [resolve(120,a,4,a),unit_del(b,171),unit_del(c,172)].
% 1.32/1.63 362 p102(f27(f29(c1))). [resolve(276,a,112,a),unit_del(b,278),unit_del(c,279)].
% 1.32/1.63 363 -p103(f27(f29(c1))). [resolve(276,a,111,a),unit_del(b,278),unit_del(c,279)].
% 1.32/1.63 365 r1(f29(c1),f27(f29(c1))). [resolve(276,a,109,a),unit_del(b,278),unit_del(c,279)].
% 1.32/1.63 368 -r1(f29(c1),A) | r1(c1,A). [resolve(276,a,5,a)].
% 1.32/1.63 408 -r1(f27(f29(c1)),A) | r1(f29(c1),A). [resolve(365,a,5,a)].
% 1.32/1.63 419 r1(c1,f27(f29(c1))). [resolve(368,a,365,a)].
% 1.32/1.63 442 p103(f26(f27(f29(c1)))). [resolve(419,a,108,a),unit_del(b,363),unit_del(c,362)].
% 1.32/1.63 443 -p104(f26(f27(f29(c1)))). [resolve(419,a,107,a),unit_del(b,363),unit_del(c,362)].
% 1.32/1.63 445 r1(f27(f29(c1)),f26(f27(f29(c1)))). [resolve(419,a,105,a),unit_del(b,363),unit_del(c,362)].
% 1.32/1.63 587 r1(f29(c1),f26(f27(f29(c1)))). [resolve(445,a,408,a)].
% 1.32/1.63 594 r1(c1,f26(f27(f29(c1)))). [resolve(587,a,368,a)].
% 1.32/1.63 629 p104(f24(f26(f27(f29(c1))))). [resolve(594,a,100,a),unit_del(b,443),unit_del(c,442)].
% 1.32/1.63 630 -p105(f24(f26(f27(f29(c1))))). [resolve(594,a,99,a),unit_del(b,443),unit_del(c,442)].
% 1.32/1.63 632 r1(f26(f27(f29(c1))),f24(f26(f27(f29(c1))))). [resolve(594,a,97,a),unit_del(b,443),unit_del(c,442)].
% 1.32/1.63 639 -r1(f26(f27(f29(c1))),A) | r1(c1,A). [resolve(594,a,5,a)].
% 1.32/1.63 1131 r1(c1,f24(f26(f27(f29(c1))))). [resolve(632,a,639,a)].
% 1.32/1.63 1180 p105(f22(f24(f26(f27(f29(c1)))))). [resolve(1131,a,92,a),unit_del(b,630),unit_del(c,629)].
% 1.32/1.63 1181 -p106(f22(f24(f26(f27(f29(c1)))))). [resolve(1131,a,91,a),unit_del(b,630),unit_del(c,629)].
% 1.32/1.63 1183 r1(f24(f26(f27(f29(c1)))),f22(f24(f26(f27(f29(c1)))))). [resolve(1131,a,89,a),unit_del(b,630),unit_del(c,629)].
% 1.32/1.63 1190 -r1(f24(f26(f27(f29(c1)))),A) | r1(c1,A). [resolve(1131,a,5,a)].
% 1.32/1.63 2500 r1(c1,f22(f24(f26(f27(f29(c1)))))). [resolve(1190,a,1183,a)].
% 1.32/1.63 2555 -p7(f19(f22(f24(f26(f27(f29(c1))))))). [resolve(2500,a,78,a),unit_del(b,1181),unit_del(c,1180)].
% 1.32/1.63 2556 r1(f22(f24(f26(f27(f29(c1))))),f19(f22(f24(f26(f27(f29(c1))))))). [resolve(2500,a,77,a),unit_del(b,1181),unit_del(c,1180)].
% 1.32/1.63 2559 -r1(f22(f24(f26(f27(f29(c1))))),A) | r1(c1,A). [resolve(2500,a,5,a)].
% 1.32/1.63 5828 r1(c1,f19(f22(f24(f26(f27(f29(c1))))))). [resolve(2556,a,2559,a)].
% 1.32/1.63 5901 $F. [resolve(5828,a,6,a),unit_del(a,2555)].
% 1.32/1.63
% 1.32/1.63 % SZS output end Refutation
% 1.32/1.63 ============================== end of proof ==========================
% 1.32/1.63
% 1.32/1.63 ============================== STATISTICS ============================
% 1.32/1.63
% 1.32/1.63 Given=2746. Generated=22082. Kept=5897. proofs=1.
% 1.32/1.63 Usable=2729. Sos=657. Demods=0. Limbo=64, Disabled=2620. Hints=0.
% 1.32/1.63 Megabytes=5.06.
% 1.32/1.63 User_CPU=0.55, System_CPU=0.02, Wall_clock=0.
% 1.32/1.63
% 1.32/1.63 ============================== end of statistics =====================
% 1.32/1.63
% 1.32/1.63 ============================== end of search =========================
% 1.32/1.63
% 1.32/1.63 THEOREM PROVED
% 1.32/1.63 % SZS status Theorem
% 1.32/1.63
% 1.32/1.63 Exiting with 1 proof.
% 1.32/1.63
% 1.32/1.63 Process 24941 exit (max_proofs) Sat Jul 2 11:21:54 2022
% 1.32/1.63 Prover9 interrupted
%------------------------------------------------------------------------------