%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %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 : Fri Jul 15 00:23:09 EDT 2022
% Result : Unsatisfiable 1.30s 1.67s
% Output : Refutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(apply(apply(apply(s,A),B),C),apply(apply(A,C),apply(B,C))),
file('COL004-1.p',unknown),
[] ).
cnf(2,plain,
equal(apply(apply(A,B),apply(C,B)),apply(apply(apply(s,A),C),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(apply(apply(k,A),B),A),
file('COL004-1.p',unknown),
[] ).
cnf(4,plain,
~ equal(apply(g(A),apply(apply(f(A),f(A)),g(A))),apply(apply(A,f(A)),g(A))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(apply(apply(apply(s,k),A),B),B),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(6,plain,
equal(apply(apply(apply(s,apply(k,A)),B),C),apply(A,apply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(19,plain,
equal(apply(A,apply(B,A)),apply(apply(apply(s,apply(apply(s,k),C)),B),A)),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(20,plain,
equal(apply(apply(apply(s,apply(apply(s,k),A)),B),C),apply(C,apply(B,C))),
inference(flip,[status(thm),theory(equality)],[19]),
[iquote('flip(19)')] ).
cnf(40,plain,
equal(apply(apply(A,apply(B,C)),apply(D,C)),apply(apply(apply(s,apply(apply(s,apply(k,A)),B)),D),C)),
inference(para,[status(thm),theory(equality)],[6,2]),
[iquote('para(6,2)')] ).
cnf(47,plain,
equal(apply(A,A),apply(apply(apply(s,apply(apply(s,k),B)),apply(apply(s,k),C)),A)),
inference(para,[status(thm),theory(equality)],[5,19]),
[iquote('para(5,19)')] ).
cnf(3694,plain,
equal(apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),apply(s,k))),A),B),C),apply(C,apply(apply(A,B),C))),
inference(para,[status(thm),theory(equality)],[40,20]),
[iquote('para(40,20)')] ).
cnf(3695,plain,
equal(apply(A,apply(apply(B,C),A)),apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),apply(s,k))),B),C),A)),
inference(flip,[status(thm),theory(equality)],[3694]),
[iquote('flip(3694)')] ).
cnf(5213,plain,
~ equal(apply(g(A),apply(apply(apply(apply(s,apply(apply(s,k),B)),apply(apply(s,k),C)),f(A)),g(A))),apply(apply(A,f(A)),g(A))),
inference(para,[status(thm),theory(equality)],[47,4]),
[iquote('para(47,4)')] ).
cnf(5214,plain,
$false,
inference(conflict,[status(thm)],[5213,3695]),
[iquote('conflict(5213,3695)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %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 : Tue May 31 04:16:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.30/1.67 ----- EQP 0.9e, May 2009 -----
% 1.30/1.67 The job began on n020.cluster.edu, Tue May 31 04:16:24 2022
% 1.30/1.67 The command was "./eqp09e".
% 1.30/1.67
% 1.30/1.67 set(prolog_style_variables).
% 1.30/1.67 set(lrpo).
% 1.30/1.67 set(basic_paramod).
% 1.30/1.67 set(functional_subsume).
% 1.30/1.67 set(ordered_paramod).
% 1.30/1.67 set(prime_paramod).
% 1.30/1.67 set(para_pairs).
% 1.30/1.67 assign(pick_given_ratio,4).
% 1.30/1.67 clear(print_kept).
% 1.30/1.67 clear(print_new_demod).
% 1.30/1.67 clear(print_back_demod).
% 1.30/1.67 clear(print_given).
% 1.30/1.67 assign(max_mem,64000).
% 1.30/1.67 end_of_commands.
% 1.30/1.67
% 1.30/1.67 Usable:
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Sos:
% 1.30/1.67 0 (wt=-1) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 1.30/1.67 0 (wt=-1) [] apply(apply(k,A),B) = A.
% 1.30/1.67 0 (wt=-1) [] -(apply(apply(A,f(A)),g(A)) = apply(g(A),apply(apply(f(A),f(A)),g(A)))).
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Demodulators:
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Passive:
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Starting to process input.
% 1.30/1.67
% 1.30/1.67 ** KEPT: 1 (wt=15) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 1.30/1.67
% 1.30/1.67 ** KEPT: 2 (wt=15) [flip(1)] apply(apply(A,B),apply(C,B)) = apply(apply(apply(s,A),C),B).
% 1.30/1.67 clause forward subsumed: 0 (wt=15) [flip(2)] apply(apply(apply(s,A),C),B) = apply(apply(A,B),apply(C,B)).
% 1.30/1.67
% 1.30/1.67 ** KEPT: 3 (wt=7) [] apply(apply(k,A),B) = A.
% 1.30/1.67 3 is a new demodulator.
% 1.30/1.67
% 1.30/1.67 ** KEPT: 4 (wt=19) [flip(1)] -(apply(g(A),apply(apply(f(A),f(A)),g(A))) = apply(apply(A,f(A)),g(A))).
% 1.30/1.67 ---------------- PROOF FOUND ----------------
% 1.30/1.67 % SZS status Unsatisfiable
% 1.30/1.67
% 1.30/1.67
% 1.30/1.67 After processing input:
% 1.30/1.67
% 1.30/1.67 Usable:
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Sos:
% 1.30/1.67 3 (wt=7) [] apply(apply(k,A),B) = A.
% 1.30/1.67 1 (wt=15) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 1.30/1.67 2 (wt=15) [flip(1)] apply(apply(A,B),apply(C,B)) = apply(apply(apply(s,A),C),B).
% 1.30/1.67 4 (wt=19) [flip(1)] -(apply(g(A),apply(apply(f(A),f(A)),g(A))) = apply(apply(A,f(A)),g(A))).
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Demodulators:
% 1.30/1.67 3 (wt=7) [] apply(apply(k,A),B) = A.
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 Passive:
% 1.30/1.67 end_of_list.
% 1.30/1.67
% 1.30/1.67 UNIT CONFLICT from 5213 and 3695 at 0.47 seconds.
% 1.30/1.67
% 1.30/1.67 ---------------- PROOF ----------------
% 1.30/1.67 % SZS output start Refutation
% See solution above
% 1.30/1.67 ------------ end of proof -------------
% 1.30/1.67
% 1.30/1.67
% 1.30/1.67 ------------- memory usage ------------
% 1.30/1.67 Memory dynamically allocated (tp_alloc): 11718.
% 1.30/1.67 type (bytes each) gets frees in use avail bytes
% 1.30/1.67 sym_ent ( 96) 56 0 56 0 5.2 K
% 1.30/1.67 term ( 16) 347907 185203 162704 32 3158.1 K
% 1.30/1.67 gen_ptr ( 8) 823142 22977 800165 13 6251.4 K
% 1.30/1.67 context ( 808) 313913 313911 2 4 4.7 K
% 1.30/1.67 trail ( 12) 7736 7736 0 5 0.1 K
% 1.30/1.67 bt_node ( 68) 125803 125799 4 11 1.0 K
% 1.30/1.67 ac_position (285432) 0 0 0 0 0.0 K
% 1.30/1.67 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.30/1.67 ac_match_free_vars_pos (4020)
% 1.30/1.67 0 0 0 0 0.0 K
% 1.30/1.67 discrim ( 12) 92809 3212 89597 0 1050.0 K
% 1.30/1.67 flat ( 40) 1091721 1091721 0 73 2.9 K
% 1.30/1.67 discrim_pos ( 12) 5108 5108 0 1 0.0 K
% 1.30/1.67 fpa_head ( 12) 2564 0 2564 0 30.0 K
% 1.30/1.67 fpa_tree ( 28) 21730 21730 0 45 1.2 K
% 1.30/1.67 fpa_pos ( 36) 6079 6079 0 1 0.0 K
% 1.30/1.67 literal ( 12) 18016 12803 5213 1 61.1 K
% 1.30/1.67 clause ( 24) 18016 12803 5213 1 122.2 K
% 1.30/1.67 list ( 12) 925 869 56 3 0.7 K
% 1.30/1.67 list_pos ( 20) 16960 1019 15941 0 311.3 K
% 1.30/1.67 pair_index ( 40) 2 0 2 0 0.1 K
% 1.30/1.67
% 1.30/1.67 -------------- statistics -------------
% 1.30/1.67 Clauses input 3
% 1.30/1.67 Usable input 0
% 1.30/1.67 Sos input 3
% 1.30/1.67 Demodulators input 0
% 1.30/1.67 Passive input 0
% 1.30/1.67
% 1.30/1.67 Processed BS (before search) 5
% 1.30/1.67 Forward subsumed BS 1
% 1.30/1.67 Kept BS 4
% 1.30/1.67 New demodulators BS 1
% 1.30/1.67 Back demodulated BS 0
% 1.30/1.67
% 1.30/1.67 Clauses or pairs given 4495
% 1.30/1.67 Clauses generated 9256
% 1.30/1.67 Forward subsumed 4047
% 1.30/1.67 Deleted by weight 0
% 1.30/1.67 Deleted by variable count 0
% 1.30/1.67 Kept 5209
% 1.30/1.67 New demodulators 865
% 1.30/1.67 Back demodulated 225
% 1.30/1.67 Ordered paramod prunes 0
% 1.30/1.67 Basic paramod prunes 35637
% 1.30/1.67 Prime paramod prunes 12
% 1.30/1.67 Semantic prunes 0
% 1.30/1.67
% 1.30/1.67 Rewrite attmepts 199760
% 1.30/1.67 Rewrites 2325
% 1.30/1.67
% 1.30/1.67 FPA overloads 0
% 1.30/1.67 FPA underloads 0
% 1.30/1.67
% 1.30/1.67 Usable size 0
% 1.30/1.67 Sos size 4987
% 1.30/1.67 Demodulators size 755
% 1.30/1.67 Passive size 0
% 1.30/1.67 Disabled size 225
% 1.30/1.67
% 1.30/1.67 Proofs found 1
% 1.30/1.67
% 1.30/1.67 ----------- times (seconds) ----------- Tue May 31 04:16:25 2022
% 1.30/1.67
% 1.30/1.67 user CPU time 0.47 (0 hr, 0 min, 0 sec)
% 1.30/1.67 system CPU time 0.13 (0 hr, 0 min, 0 sec)
% 1.30/1.67 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.30/1.67 input time 0.00
% 1.30/1.67 paramodulation time 0.03
% 1.30/1.67 demodulation time 0.04
% 1.30/1.67 orient time 0.03
% 1.30/1.67 weigh time 0.01
% 1.30/1.67 forward subsume time 0.04
% 1.30/1.67 back demod find time 0.04
% 1.30/1.67 conflict time 0.01
% 1.30/1.67 LRPO time 0.02
% 1.30/1.67 store clause time 0.21
% 1.30/1.67 disable clause time 0.01
% 1.30/1.67 prime paramod time 0.01
% 1.30/1.67 semantics time 0.00
% 1.30/1.67
% 1.30/1.67 EQP interrupted
%------------------------------------------------------------------------------