TSTP Solution File: LCL496+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL496+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:47:12 EDT 2022
% Result : Unknown 145.87s 146.18s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL496+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 15:38:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.07 ============================== Prover9 ===============================
% 0.46/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.07 Process 26506 was started by sandbox2 on n013.cluster.edu,
% 0.46/1.07 Sat Jul 2 15:38:45 2022
% 0.46/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26352_n013.cluster.edu".
% 0.46/1.07 ============================== end of head ===========================
% 0.46/1.07
% 0.46/1.07 ============================== INPUT =================================
% 0.46/1.07
% 0.46/1.07 % Reading from file /tmp/Prover9_26352_n013.cluster.edu
% 0.46/1.07
% 0.46/1.07 set(prolog_style_variables).
% 0.46/1.07 set(auto2).
% 0.46/1.07 % set(auto2) -> set(auto).
% 0.46/1.07 % set(auto) -> set(auto_inference).
% 0.46/1.07 % set(auto) -> set(auto_setup).
% 0.46/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.07 % set(auto) -> set(auto_limits).
% 0.46/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.07 % set(auto) -> set(auto_denials).
% 0.46/1.07 % set(auto) -> set(auto_process).
% 0.46/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.07 % set(auto2) -> assign(stats, some).
% 0.46/1.07 % set(auto2) -> clear(echo_input).
% 0.46/1.07 % set(auto2) -> set(quiet).
% 0.46/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.07 % set(auto2) -> clear(print_given).
% 0.46/1.07 assign(lrs_ticks,-1).
% 0.46/1.07 assign(sos_limit,10000).
% 0.46/1.07 assign(order,kbo).
% 0.46/1.07 set(lex_order_vars).
% 0.46/1.07 clear(print_given).
% 0.46/1.07
% 0.46/1.07 % formulas(sos). % not echoed (45 formulas)
% 0.46/1.07
% 0.46/1.07 ============================== end of input ==========================
% 0.46/1.07
% 0.46/1.07 % From the command line: assign(max_seconds, 300).
% 0.46/1.07
% 0.46/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.07
% 0.46/1.07 % Formulas that are not ordinary clauses:
% 0.46/1.07 1 modus_ponens <-> (all X all Y (is_a_theorem(X) & is_a_theorem(implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 2 substitution_of_equivalents <-> (all X all Y (is_a_theorem(equiv(X,Y)) -> X = Y)) # label(substitution_of_equivalents) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 3 modus_tollens <-> (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) # label(modus_tollens) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 4 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 5 implies_2 <-> (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) # label(implies_2) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 6 implies_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))) # label(implies_3) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 7 and_1 <-> (all X all Y is_a_theorem(implies(and(X,Y),X))) # label(and_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 8 and_2 <-> (all X all Y is_a_theorem(implies(and(X,Y),Y))) # label(and_2) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 9 and_3 <-> (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) # label(and_3) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 10 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 11 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 12 or_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) # label(or_3) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 13 equivalence_1 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) # label(equivalence_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 14 equivalence_2 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(Y,X)))) # label(equivalence_2) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 15 equivalence_3 <-> (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) # label(equivalence_3) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 16 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 17 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 18 kn3 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) # label(kn3) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 19 cn1 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))) # label(cn1) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 20 cn2 <-> (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) # label(cn2) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 21 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 22 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 23 r2 <-> (all P all Q is_a_theorem(implies(Q,or(P,Q)))) # label(r2) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 24 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 25 r4 <-> (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) # label(r4) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 26 r5 <-> (all P all Q all R is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))) # label(r5) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 27 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 28 op_and -> (all X all Y and(X,Y) = not(or(not(X),not(Y)))) # label(op_and) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 29 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 30 op_implies_or -> (all X all Y implies(X,Y) = or(not(X),Y)) # label(op_implies_or) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78 31 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause). [assumption].
% 1.50/1.78
% 1.50/1.78 ============================== end of process non-clausal formulas ===
% 1.50/1.78
% 1.50/1.78 ============================== PROCESS INITIAL CLAUSES ===============
% 1.50/1.78
% 1.50/1.78 ============================== PREDICATE ELIMINATION =================
% 1.50/1.78
% 1.50/1.78 ============================== end predicate elimination =============
% 1.50/1.78
% 1.50/1.78 Auto_denials: (non-Horn, no changes).
% 1.50/1.78
% 1.50/1.78 Term ordering decisions:
% 1.50/1.78
% 1.50/1.78 % Assigning unary symbol not kb_weight 0 and highest precedence (94).
% 1.50/1.78 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. c37=1. c38=1. c39=1. c40=1. c41=1. c42=1. c43=1. c44=1. c45=1. c46=1. c47=1. c48=1. c49=1. c50=1. c51=1. c52=1. c53=1. c54=1. c55=1. implies=1. or=1. and=1. equiv=1. not=0.
% 1.50/1.78
% 1.50/1.78 ============================== end of process initial clauses ========
% 1.50/1.78
% 1.50/1.78 ============================== CLAUSES FOR SEARCH ====================
% 1.50/1.78
% 1.50/1.78 ============================== end of clauses for search =============
% 1.50/1.78
% 1.50/1.78 ============================== SEARCH ================================
% 1.50/1.78
% 1.50/1.78 % Starting search at 0.02 seconds.
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=34.000, iters=3610
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=28.000, iters=3507
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=22.000, iters=3396
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=21.000, iters=3528
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=19.000, iters=3339
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=18.000, iters=3349
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=17.000, iters=3344
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=16.000, iters=3363
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=15.000, iters=3334
% 1.50/1.78
% 1.50/1.78 Low Water (keep): wt=14.000, iters=3394
% 145.87/146.17
% 145.87/146.17 Low Water (keep): wt=13.000, iters=3345
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3162, wt=57.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=2318, wt=49.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=1354, wt=42.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=1355, wt=41.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3711, wt=36.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3646, wt=34.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3516, wt=33.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3715, wt=32.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3173, wt=31.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3714, wt=30.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=3520, wt=29.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=11376, wt=12.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=12096, wt=11.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=13729, wt=10.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=13797, wt=9.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=14346, wt=8.000
% 145.87/146.17
% 145.87/146.17 Low Water (keep): wt=12.000, iters=3458
% 145.87/146.17
% 145.87/146.17 Low Water (keep): wt=11.000, iters=3359
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=73014, wt=7.000
% 145.87/146.17
% 145.87/146.17 Low Water (displace): id=73050, wt=6.000
% 145.87/146.17
% 145.87/146.17 Low Water (keep): wt=10.000, iters=3679
% 145.87/146.17
% 145.87/146.17 ============================== STATISTICS ============================
% 145.87/146.17
% 145.87/146.17 Given=8647. Generated=17869131. Kept=618631. proofs=0.
% 145.87/146.17 Usable=8287. Sos=9999. Demods=11. Limbo=887, Disabled=599532. Hints=0.
% 145.87/146.17 Kept_by_rule=0, Deleted_by_rule=0.
% 145.87/146.17 Forward_subsumed=2130329. Back_subsumed=2971.
% 145.87/146.17 Sos_limit_deleted=15120171. Sos_displaced=596382. Sos_removed=0.
% 145.87/146.17 New_demodulators=28 (0 lex), Back_demodulated=90. Back_unit_deleted=15.
% 145.87/146.17 Demod_attempts=212996440. Demod_rewrites=450846.
% 145.87/146.17 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 145.87/146.17 Nonunit_fsub_feature_tests=136470. Nonunit_bsub_feature_tests=6592.
% 145.87/146.17 Megabytes=419.43.
% 145.87/146.17 User_CPU=135.67, System_CPU=9.44, Wall_clock=145.
% 145.87/146.17
% 145.87/146.17 Megs malloced by palloc(): 400.
% 145.87/146.17 type (bytes each) gets frees in use bytes
% 145.87/146.17 chunk ( 104) 926 926 0 0.0 K
% 145.87/146.17 string_buf ( 8) 866 866 0 0.0 K
% 145.87/146.17 token ( 20) 2172 2172 0 0.0 K
% 145.87/146.17 pterm ( 16) 1198 1198 0 0.0 K
% 145.87/146.17 hashtab ( 8) 31 31 0 0.0 K
% 145.87/146.17 hashnode ( 8) 154 154 0 0.0 K
% 145.87/146.17 term ( 20) 216086099 209406120 6679979 130468.3 K
% 145.87/146.17 term arg arrays: 40226.6 K
% 145.87/146.17 attribute ( 12) 355 14 341 4.0 K
% 145.87/146.17 ilist ( 8) 729990774 727392890 2597884 20296.0 K
% 145.87/146.17 plist ( 8) 11904571 11265863 638708 4989.9 K
% 145.87/146.17 i2list ( 12) 29691 29691 0 0.0 K
% 145.87/146.17 just ( 12) 18218714 17488186 730528 8560.9 K
% 145.87/146.17 parajust ( 16) 34559 17566 16993 265.5 K
% 145.87/146.17 instancejust ( 8) 0 0 0 0.0 K
% 145.87/146.17 ivyjust ( 24) 0 0 0 0.0 K
% 145.87/146.17 formula ( 28) 1511 1183 328 9.0 K
% 145.87/146.17 formula arg arrays: 1.0 K
% 145.87/146.17 topform ( 52) 17869237 17250500 618737 31420.2 K
% 145.87/146.17 clist_pos ( 20) 1844656 1225940 618716 12084.3 K
% 145.87/146.17 clist ( 16) 8 1 7 0.1 K
% 145.87/146.17 context ( 808) 60748646 60748644 2 1.6 K
% 145.87/146.17 trail ( 12) 50149215 50149214 1 0.0 K
% 145.87/146.17 ac_match_pos (70044) 0 0 0 0.0 K
% 145.87/146.17 ac_match_free_vars_pos (20020)
% 145.87/146.17 0 0 0 0.0 K
% 145.87/146.17 btm_state ( 60) 0 0 0 0.0 K
% 145.87/146.17 btu_state ( 60) 0 0 0 0.0 K
% 145.87/146.17 ac_position (285432) 0 0 0 0.0 K
% 145.87/146.17 fpa_trie ( 20) 8927724 7419873 1507851 29450.2 K
% 145.87/146.17 fpa_state ( 28) 13742861 13742294 567 15.5 K
% 145.87/146.17 fpa_index ( 12) 10 0 10 0.1 K
% 145.87/146.17 fpa_chunk ( 20) 8586423 8536115 50308 982.6 K
% 145.87/146.17 fpa_list ( 16) 7453921 0 7453921 116467.5 K
% 145.87/146.17 fpa_list chunks: 2238.3 K
% 145.87/146.17 discrim ( 12) 5300720 5227231 73489 861.2 K
% 145.87/146.17 discrim_pos ( 16) 2580594 2580594 0 0.0 K
% 145.87/146.17 flat2 ( 32) 214393073 214393073 0 0.0 K
% 145.87/146.17 flat ( 48) 0 0 0 0.0 K
% 145.87/146.17 flatterm ( 32) 319167838 319167838 0 0.0 K
% 145.87/146.17 mindex ( 28) 13 0 13 0.4 K
% 145.87/146.17 mindex_pos ( 56) 22505563 22505562 1 0.1 K
% 145.87/146.17 lindex ( 12) 5 0 5 0.1 K
% 145.87/146.17 clash ( 40) 673135 673135 0 0.0 K
% 145.87/146.17 di_tree ( 12) 519205 440062 79143 927.5 K
% 145.87/146.17 avl_node ( 20) 1235425 1215427 19998 390.6 K
% 145.87/146.17
% 145.87/146.17 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 145.87/146.17 List 1, length 7, 0.0 K
% 145.87/146.17 List 2, length 308, 2.4 K
% 145.87/146.17 List 3, length 23872, 279.8 K
% 145.87/146.17 List 7, length 8, 0.2 K
% 145.87/146.17 List 8, length 494, 15.4 K
% 145.87/146.17 List 10, length 3, 0.1 K
% 145.87/146.17 List 14, length 2, 0.1 K
% 145.87/146.17 List 16, length 256, 16.0 K
% 145.87/146.17 List 26, length 30, 3.0 K
% 145.87/146.17 List 32, length 167, 20.9 K
% 145.87/146.17 List 64, length 128, 32.0 K
% 145.87/146.17 List 128, length 21, 10.5 K
% 145.87/146.17 List 202, length 3, 2.4 K
% 145.87/146.17 List 256, length 12, 12.0 K
% 145.87/146.17
% 145.87/146.17 ============================== SELECTOR REPORT =======================
% 145.87/146.17 Sos_deleted=15120171, Sos_displaced=596382, Sos_size=9999
% 145.87/146.17 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 145.87/146.17 I 2147483647 high age 0 61
% 145.87/146.17 H 1 high weight 0 0
% 145.87/146.17 A 1 low age 9999 954
% 145.87/146.17 F 4 low weight 8225 3816
% 145.87/146.17 T 4 low weight 1774 3816
% 145.87/146.17 ============================== end of selector report ================
% 145.87/146.17
% 145.87/146.17 ============================== end of statistics =====================
% 145.87/146.17
% 145.87/146.17 Exiting with failure.
% 145.87/146.17
% 145.87/146.17 Process 26506 exit (max_megs) Sat Jul 2 15:41:10 2022
% 145.87/146.17 Prover9 interrupted
%------------------------------------------------------------------------------