%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL035-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:14 EDT 2022
% Result : Unsatisfiable 1.01s 1.42s
% Output : Refutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 3 RR)
% Number of literals : 13 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(apply(apply(l,A),B),apply(A,apply(B,B))),
file('COL035-1.p',unknown),
[] ).
cnf(2,plain,
equal(apply(A,apply(B,B)),apply(apply(l,A),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(apply(apply(w,A),B),apply(apply(A,B),B)),
file('COL035-1.p',unknown),
[] ).
cnf(5,plain,
equal(apply(apply(apply(q,A),B),C),apply(B,apply(A,C))),
file('COL035-1.p',unknown),
[] ).
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(apply(l,w),A),B),apply(apply(apply(A,A),B),B)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(20,plain,
equal(apply(apply(apply(A,A),B),B),apply(apply(apply(l,w),A),B)),
inference(flip,[status(thm),theory(equality)],[19]),
[iquote('flip(19)')] ).
cnf(869,plain,
equal(apply(apply(A,B),apply(A,B)),apply(apply(apply(l,w),apply(q,A)),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,20]),5]),
[iquote('para(5,20),demod([5])')] ).
cnf(870,plain,
equal(apply(apply(apply(l,w),apply(q,A)),B),apply(apply(A,B),apply(A,B))),
inference(flip,[status(thm),theory(equality)],[869]),
[iquote('flip(869)')] ).
cnf(1915,plain,
equal(apply(apply(apply(l,w),apply(q,l)),A),apply(A,apply(apply(l,A),apply(l,A)))),
inference(para,[status(thm),theory(equality)],[869,1]),
[iquote('para(869,1)')] ).
cnf(1916,plain,
equal(apply(A,apply(apply(l,A),apply(l,A))),apply(apply(apply(l,w),apply(q,l)),A)),
inference(flip,[status(thm),theory(equality)],[1915]),
[iquote('flip(1915)')] ).
cnf(2957,plain,
~ equal(apply(f(apply(apply(l,w),apply(q,A))),apply(apply(A,f(apply(apply(l,w),apply(q,A)))),apply(A,f(apply(apply(l,w),apply(q,A)))))),apply(apply(apply(l,w),apply(q,A)),f(apply(apply(l,w),apply(q,A))))),
inference(para,[status(thm),theory(equality)],[870,6]),
[iquote('para(870,6)')] ).
cnf(2958,plain,
$false,
inference(conflict,[status(thm)],[2957,1916]),
[iquote('conflict(2957,1916)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL035-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue May 31 09:46:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.01/1.42 ----- EQP 0.9e, May 2009 -----
% 1.01/1.42 The job began on n022.cluster.edu, Tue May 31 09:46:08 2022
% 1.01/1.42 The command was "./eqp09e".
% 1.01/1.42
% 1.01/1.42 set(prolog_style_variables).
% 1.01/1.42 set(lrpo).
% 1.01/1.42 set(basic_paramod).
% 1.01/1.42 set(functional_subsume).
% 1.01/1.42 set(ordered_paramod).
% 1.01/1.42 set(prime_paramod).
% 1.01/1.42 set(para_pairs).
% 1.01/1.42 assign(pick_given_ratio,4).
% 1.01/1.42 clear(print_kept).
% 1.01/1.42 clear(print_new_demod).
% 1.01/1.42 clear(print_back_demod).
% 1.01/1.42 clear(print_given).
% 1.01/1.42 assign(max_mem,64000).
% 1.01/1.42 end_of_commands.
% 1.01/1.42
% 1.01/1.42 Usable:
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Sos:
% 1.01/1.42 0 (wt=-1) [] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 1.01/1.42 0 (wt=-1) [] apply(apply(w,A),B) = apply(apply(A,B),B).
% 1.01/1.42 0 (wt=-1) [] apply(apply(apply(q,A),B),C) = apply(B,apply(A,C)).
% 1.01/1.42 0 (wt=-1) [] -(apply(A,f(A)) = apply(f(A),apply(A,f(A)))).
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Demodulators:
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Passive:
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Starting to process input.
% 1.01/1.42
% 1.01/1.42 ** KEPT: 1 (wt=11) [] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 1.01/1.42
% 1.01/1.42 ** KEPT: 2 (wt=11) [flip(1)] apply(A,apply(B,B)) = apply(apply(l,A),B).
% 1.01/1.42 clause forward subsumed: 0 (wt=11) [flip(2)] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 1.01/1.42
% 1.01/1.42 ** KEPT: 3 (wt=11) [] apply(apply(w,A),B) = apply(apply(A,B),B).
% 1.01/1.42
% 1.01/1.42 ** KEPT: 4 (wt=11) [flip(3)] apply(apply(A,B),B) = apply(apply(w,A),B).
% 1.01/1.42 clause forward subsumed: 0 (wt=11) [flip(4)] apply(apply(w,A),B) = apply(apply(A,B),B).
% 1.01/1.42
% 1.01/1.42 ** KEPT: 5 (wt=13) [] apply(apply(apply(q,A),B),C) = apply(B,apply(A,C)).
% 1.01/1.42 5 is a new demodulator.
% 1.01/1.42
% 1.01/1.42 ** KEPT: 6 (wt=12) [flip(1)] -(apply(f(A),apply(A,f(A))) = apply(A,f(A))).
% 1.01/1.42 ---------------- PROOF FOUND ----------------
% 1.01/1.42 % SZS status Unsatisfiable
% 1.01/1.42
% 1.01/1.42
% 1.01/1.42 After processing input:
% 1.01/1.42
% 1.01/1.42 Usable:
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Sos:
% 1.01/1.42 1 (wt=11) [] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 1.01/1.42 2 (wt=11) [flip(1)] apply(A,apply(B,B)) = apply(apply(l,A),B).
% 1.01/1.42 3 (wt=11) [] apply(apply(w,A),B) = apply(apply(A,B),B).
% 1.01/1.42 4 (wt=11) [flip(3)] apply(apply(A,B),B) = apply(apply(w,A),B).
% 1.01/1.42 6 (wt=12) [flip(1)] -(apply(f(A),apply(A,f(A))) = apply(A,f(A))).
% 1.01/1.42 5 (wt=13) [] apply(apply(apply(q,A),B),C) = apply(B,apply(A,C)).
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Demodulators:
% 1.01/1.42 5 (wt=13) [] apply(apply(apply(q,A),B),C) = apply(B,apply(A,C)).
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 Passive:
% 1.01/1.42 end_of_list.
% 1.01/1.42
% 1.01/1.42 UNIT CONFLICT from 2957 and 1916 at 0.26 seconds.
% 1.01/1.42
% 1.01/1.42 ---------------- PROOF ----------------
% 1.01/1.42 % SZS output start Refutation
% See solution above
% 1.01/1.42 ------------ end of proof -------------
% 1.01/1.42
% 1.01/1.42
% 1.01/1.42 ------------- memory usage ------------
% 1.01/1.42 Memory dynamically allocated (tp_alloc): 5859.
% 1.01/1.42 type (bytes each) gets frees in use avail bytes
% 1.01/1.42 sym_ent ( 96) 56 0 56 0 5.2 K
% 1.01/1.42 term ( 16) 221704 141249 80455 48 1560.8 K
% 1.01/1.42 gen_ptr ( 8) 407847 32549 375298 12 2932.1 K
% 1.01/1.42 context ( 808) 209251 209249 2 5 5.5 K
% 1.01/1.42 trail ( 12) 6950 6950 0 4 0.0 K
% 1.01/1.42 bt_node ( 68) 52549 52546 3 10 0.9 K
% 1.01/1.42 ac_position (285432) 0 0 0 0 0.0 K
% 1.01/1.42 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.01/1.42 ac_match_free_vars_pos (4020)
% 1.01/1.42 0 0 0 0 0.0 K
% 1.01/1.42 discrim ( 12) 61955 10945 51010 0 597.8 K
% 1.01/1.42 flat ( 40) 682865 682865 0 87 3.4 K
% 1.01/1.42 discrim_pos ( 12) 5476 5476 0 1 0.0 K
% 1.01/1.42 fpa_head ( 12) 3315 0 3315 0 38.8 K
% 1.01/1.42 fpa_tree ( 28) 26695 26695 0 143 3.9 K
% 1.01/1.42 fpa_pos ( 36) 3947 3947 0 1 0.0 K
% 1.01/1.42 literal ( 12) 12202 9245 2957 0 34.7 K
% 1.01/1.42 clause ( 24) 12202 9245 2957 0 69.3 K
% 1.01/1.42 list ( 12) 1049 993 56 3 0.7 K
% 1.01/1.42 list_pos ( 20) 11048 2555 8493 13 166.1 K
% 1.01/1.42 pair_index ( 40) 2 0 2 0 0.1 K
% 1.01/1.42
% 1.01/1.42 -------------- statistics -------------
% 1.01/1.42 Clauses input 4
% 1.01/1.42 Usable input 0
% 1.01/1.42 Sos input 4
% 1.01/1.42 Demodulators input 0
% 1.01/1.42 Passive input 0
% 1.01/1.42
% 1.01/1.42 Processed BS (before search) 8
% 1.01/1.42 Forward subsumed BS 2
% 1.01/1.42 Kept BS 6
% 1.01/1.42 New demodulators BS 1
% 1.01/1.42 Back demodulated BS 0
% 1.01/1.42
% 1.01/1.42 Clauses or pairs given 3417
% 1.01/1.42 Clauses generated 5666
% 1.01/1.42 Forward subsumed 2715
% 1.01/1.42 Deleted by weight 0
% 1.01/1.42 Deleted by variable count 0
% 1.01/1.42 Kept 2951
% 1.01/1.42 New demodulators 989
% 1.01/1.42 Back demodulated 588
% 1.01/1.42 Ordered paramod prunes 0
% 1.01/1.42 Basic paramod prunes 11173
% 1.01/1.42 Prime paramod prunes 65
% 1.01/1.42 Semantic prunes 0
% 1.01/1.42
% 1.01/1.42 Rewrite attmepts 140409
% 1.01/1.42 Rewrites 3169
% 1.01/1.42
% 1.01/1.42 FPA overloads 0
% 1.01/1.42 FPA underloads 0
% 1.01/1.42
% 1.01/1.42 Usable size 0
% 1.01/1.42 Sos size 2368
% 1.01/1.42 Demodulators size 801
% 1.01/1.42 Passive size 0
% 1.01/1.42 Disabled size 588
% 1.01/1.42
% 1.01/1.42 Proofs found 1
% 1.01/1.42
% 1.01/1.42 ----------- times (seconds) ----------- Tue May 31 09:46:08 2022
% 1.01/1.42
% 1.01/1.42 user CPU time 0.26 (0 hr, 0 min, 0 sec)
% 1.01/1.42 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 1.01/1.42 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 1.01/1.42 input time 0.00
% 1.01/1.42 paramodulation time 0.03
% 1.01/1.42 demodulation time 0.03
% 1.01/1.42 orient time 0.02
% 1.01/1.42 weigh time 0.01
% 1.01/1.42 forward subsume time 0.01
% 1.01/1.42 back demod find time 0.03
% 1.01/1.42 conflict time 0.00
% 1.01/1.42 LRPO time 0.01
% 1.01/1.42 store clause time 0.08
% 1.01/1.42 disable clause time 0.01
% 1.01/1.42 prime paramod time 0.01
% 1.01/1.42 semantics time 0.00
% 1.01/1.42
% 1.01/1.42 EQP interrupted
%------------------------------------------------------------------------------