TSTP Solution File: COL049-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL049-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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 : Fri Jul 15 00:23:17 EDT 2022
% Result : Unsatisfiable 0.44s 1.17s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 4 RR)
% Number of literals : 13 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(apply(apply(apply(b,A),B),C),apply(A,apply(B,C))),
file('COL049-1.p',unknown),
[] ).
cnf(2,plain,
equal(apply(apply(w,A),B),apply(apply(A,B),B)),
file('COL049-1.p',unknown),
[] ).
cnf(3,plain,
equal(apply(apply(A,B),B),apply(apply(w,A),B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(apply(m,A),apply(A,A)),
file('COL049-1.p',unknown),
[] ).
cnf(5,plain,
equal(apply(A,A),apply(m,A)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
~ equal(apply(f(A),apply(A,f(A))),apply(A,f(A))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(19,plain,
equal(apply(apply(w,apply(b,A)),B),apply(A,apply(B,B))),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(20,plain,
equal(apply(A,apply(B,B)),apply(apply(w,apply(b,A)),B)),
inference(flip,[status(thm),theory(equality)],[19]),
[iquote('flip(19)')] ).
cnf(43,plain,
~ equal(apply(f(apply(apply(b,A),B)),apply(A,apply(B,f(apply(apply(b,A),B))))),apply(A,apply(B,f(apply(apply(b,A),B))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,6]),1]),
[iquote('para(1,6),demod([1])')] ).
cnf(45,plain,
equal(apply(apply(w,apply(b,A)),B),apply(A,apply(m,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,20]),1]),
[iquote('para(5,20),flip(1)')] ).
cnf(53,plain,
equal(apply(A,apply(m,apply(w,apply(b,A)))),apply(m,apply(w,apply(b,A)))),
inference(para,[status(thm),theory(equality)],[45,5]),
[iquote('para(45,5)')] ).
cnf(549,plain,
~ equal(apply(f(apply(apply(b,A),apply(apply(b,B),C))),apply(A,apply(B,apply(C,f(apply(apply(b,A),apply(apply(b,B),C))))))),apply(A,apply(B,apply(C,f(apply(apply(b,A),apply(apply(b,B),C))))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,43]),1]),
[iquote('para(1,43),demod([1])')] ).
cnf(550,plain,
$false,
inference(conflict,[status(thm)],[549,53]),
[iquote('conflict(549,53)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COL049-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n019.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 : Tue May 31 12:56:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.17 ----- EQP 0.9e, May 2009 -----
% 0.44/1.17 The job began on n019.cluster.edu, Tue May 31 12:56:26 2022
% 0.44/1.17 The command was "./eqp09e".
% 0.44/1.17
% 0.44/1.17 set(prolog_style_variables).
% 0.44/1.17 set(lrpo).
% 0.44/1.17 set(basic_paramod).
% 0.44/1.17 set(functional_subsume).
% 0.44/1.17 set(ordered_paramod).
% 0.44/1.17 set(prime_paramod).
% 0.44/1.17 set(para_pairs).
% 0.44/1.17 assign(pick_given_ratio,4).
% 0.44/1.17 clear(print_kept).
% 0.44/1.17 clear(print_new_demod).
% 0.44/1.17 clear(print_back_demod).
% 0.44/1.17 clear(print_given).
% 0.44/1.17 assign(max_mem,64000).
% 0.44/1.17 end_of_commands.
% 0.44/1.17
% 0.44/1.17 Usable:
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Sos:
% 0.44/1.17 0 (wt=-1) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.44/1.17 0 (wt=-1) [] apply(apply(w,A),B) = apply(apply(A,B),B).
% 0.44/1.17 0 (wt=-1) [] apply(m,A) = apply(A,A).
% 0.44/1.17 0 (wt=-1) [] -(apply(A,f(A)) = apply(f(A),apply(A,f(A)))).
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Demodulators:
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Passive:
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Starting to process input.
% 0.44/1.17
% 0.44/1.17 ** KEPT: 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.44/1.17 1 is a new demodulator.
% 0.44/1.17
% 0.44/1.17 ** KEPT: 2 (wt=11) [] apply(apply(w,A),B) = apply(apply(A,B),B).
% 0.44/1.17
% 0.44/1.17 ** KEPT: 3 (wt=11) [flip(2)] apply(apply(A,B),B) = apply(apply(w,A),B).
% 0.44/1.17 clause forward subsumed: 0 (wt=11) [flip(3)] apply(apply(w,A),B) = apply(apply(A,B),B).
% 0.44/1.17
% 0.44/1.17 ** KEPT: 4 (wt=7) [] apply(m,A) = apply(A,A).
% 0.44/1.17
% 0.44/1.17 ** KEPT: 5 (wt=7) [flip(4)] apply(A,A) = apply(m,A).
% 0.44/1.17 clause forward subsumed: 0 (wt=7) [flip(5)] apply(m,A) = apply(A,A).
% 0.44/1.17
% 0.44/1.17 ** KEPT: 6 (wt=12) [flip(1)] -(apply(f(A),apply(A,f(A))) = apply(A,f(A))).
% 0.44/1.17 ---------------- PROOF FOUND ----------------
% 0.44/1.17 % SZS status Unsatisfiable
% 0.44/1.17
% 0.44/1.17
% 0.44/1.17 After processing input:
% 0.44/1.17
% 0.44/1.17 Usable:
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Sos:
% 0.44/1.17 4 (wt=7) [] apply(m,A) = apply(A,A).
% 0.44/1.17 5 (wt=7) [flip(4)] apply(A,A) = apply(m,A).
% 0.44/1.17 2 (wt=11) [] apply(apply(w,A),B) = apply(apply(A,B),B).
% 0.44/1.17 3 (wt=11) [flip(2)] apply(apply(A,B),B) = apply(apply(w,A),B).
% 0.44/1.17 6 (wt=12) [flip(1)] -(apply(f(A),apply(A,f(A))) = apply(A,f(A))).
% 0.44/1.17 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Demodulators:
% 0.44/1.17 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 Passive:
% 0.44/1.17 end_of_list.
% 0.44/1.17
% 0.44/1.17 UNIT CONFLICT from 549 and 53 at 0.04 seconds.
% 0.44/1.17
% 0.44/1.17 ---------------- PROOF ----------------
% 0.44/1.17 % SZS output start Refutation
% See solution above
% 0.44/1.17 ------------ end of proof -------------
% 0.44/1.17
% 0.44/1.17
% 0.44/1.17 ------------- memory usage ------------
% 0.44/1.17 Memory dynamically allocated (tp_alloc): 976.
% 0.44/1.17 type (bytes each) gets frees in use avail bytes
% 0.44/1.17 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.44/1.17 term ( 16) 49187 36727 12460 45 242.1 K
% 0.44/1.17 gen_ptr ( 8) 61467 5867 55600 12 434.5 K
% 0.44/1.17 context ( 808) 54774 54772 2 4 4.7 K
% 0.44/1.17 trail ( 12) 797 797 0 4 0.0 K
% 0.44/1.17 bt_node ( 68) 21618 21615 3 6 0.6 K
% 0.44/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.44/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.44/1.17 ac_match_free_vars_pos (4020)
% 0.44/1.17 0 0 0 0 0.0 K
% 0.44/1.17 discrim ( 12) 10132 565 9567 0 112.1 K
% 0.44/1.17 flat ( 40) 135726 135726 0 39 1.5 K
% 0.44/1.17 discrim_pos ( 12) 1758 1758 0 1 0.0 K
% 0.44/1.17 fpa_head ( 12) 1367 0 1367 0 16.0 K
% 0.44/1.17 fpa_tree ( 28) 4084 4084 0 49 1.3 K
% 0.44/1.17 fpa_pos ( 36) 811 811 0 1 0.0 K
% 0.44/1.17 literal ( 12) 2970 2421 549 0 6.4 K
% 0.44/1.17 clause ( 24) 2970 2421 549 0 12.9 K
% 0.44/1.17 list ( 12) 321 265 56 3 0.7 K
% 0.44/1.17 list_pos ( 20) 1998 203 1795 0 35.1 K
% 0.44/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.44/1.17
% 0.44/1.17 -------------- statistics -------------
% 0.44/1.17 Clauses input 4
% 0.44/1.17 Usable input 0
% 0.44/1.17 Sos input 4
% 0.44/1.17 Demodulators input 0
% 0.44/1.17 Passive input 0
% 0.44/1.17
% 0.44/1.17 Processed BS (before search) 8
% 0.44/1.17 Forward subsumed BS 2
% 0.44/1.17 Kept BS 6
% 0.44/1.17 New demodulators BS 1
% 0.44/1.17 Back demodulated BS 0
% 0.44/1.17
% 0.44/1.17 Clauses or pairs given 1700
% 0.44/1.17 Clauses generated 1377
% 0.44/1.17 Forward subsumed 834
% 0.44/1.17 Deleted by weight 0
% 0.44/1.17 Deleted by variable count 0
% 0.44/1.17 Kept 543
% 0.44/1.17 New demodulators 261
% 0.44/1.17 Back demodulated 43
% 0.44/1.17 Ordered paramod prunes 0
% 0.44/1.17 Basic paramod prunes 5017
% 0.44/1.17 Prime paramod prunes 25
% 0.44/1.17 Semantic prunes 0
% 0.44/1.17
% 0.44/1.17 Rewrite attmepts 30048
% 0.44/1.17 Rewrites 1236
% 0.44/1.17
% 0.44/1.17 FPA overloads 0
% 0.44/1.17 FPA underloads 0
% 0.44/1.17
% 0.44/1.17 Usable size 0
% 0.44/1.17 Sos size 505
% 0.44/1.17 Demodulators size 237
% 0.44/1.17 Passive size 0
% 0.44/1.17 Disabled size 43
% 0.44/1.17
% 0.44/1.17 Proofs found 1
% 0.44/1.17
% 0.44/1.17 ----------- times (seconds) ----------- Tue May 31 12:56:26 2022
% 0.44/1.17
% 0.44/1.17 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.44/1.17 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.44/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.44/1.17 input time 0.00
% 0.44/1.17 paramodulation time 0.01
% 0.44/1.17 demodulation time 0.01
% 0.44/1.17 orient time 0.01
% 0.44/1.17 weigh time 0.00
% 0.44/1.17 forward subsume time 0.00
% 0.44/1.17 back demod find time 0.00
% 0.44/1.17 conflict time 0.00
% 0.44/1.17 LRPO time 0.01
% 0.44/1.17 store clause time 0.01
% 0.44/1.17 disable clause time 0.00
% 0.44/1.17 prime paramod time 0.00
% 0.44/1.17 semantics time 0.00
% 0.44/1.17
% 0.44/1.17 EQP interrupted
%------------------------------------------------------------------------------