TSTP Solution File: COL009-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:10 EDT 2022
% Result : Unsatisfiable 0.73s 1.10s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(apply(apply(apply(b,A),B),C),apply(A,apply(B,C))),
file('COL009-1.p',unknown),
[] ).
cnf(2,plain,
equal(apply(apply(l2,A),B),apply(B,apply(A,A))),
file('COL009-1.p',unknown),
[] ).
cnf(3,plain,
equal(apply(A,apply(B,B)),apply(apply(l2,B),A)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(apply(combinator,A),A),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(apply(apply(l2,A),apply(apply(b,B),C)),apply(B,apply(C,apply(A,A)))),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(16,plain,
equal(apply(A,apply(B,apply(C,C))),apply(apply(l2,C),apply(apply(b,A),B))),
inference(flip,[status(thm),theory(equality)],[15]),
[iquote('flip(15)')] ).
cnf(17,plain,
equal(apply(A,apply(B,apply(C,apply(apply(b,B),C)))),apply(apply(l2,apply(apply(b,B),C)),A)),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(22,plain,
~ equal(apply(apply(l2,A),apply(apply(b,combinator),B)),apply(B,apply(A,A))),
inference(para,[status(thm),theory(equality)],[16,4]),
[iquote('para(16,4)')] ).
cnf(23,plain,
$false,
inference(conflict,[status(thm)],[22,17]),
[iquote('conflict(22,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.35 % Computer : n017.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Tue May 31 14:36:11 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.73/1.10 ----- EQP 0.9e, May 2009 -----
% 0.73/1.10 The job began on n017.cluster.edu, Tue May 31 14:36:11 2022
% 0.73/1.10 The command was "./eqp09e".
% 0.73/1.10
% 0.73/1.10 set(prolog_style_variables).
% 0.73/1.10 set(lrpo).
% 0.73/1.10 set(basic_paramod).
% 0.73/1.10 set(functional_subsume).
% 0.73/1.10 set(ordered_paramod).
% 0.73/1.10 set(prime_paramod).
% 0.73/1.10 set(para_pairs).
% 0.73/1.10 assign(pick_given_ratio,4).
% 0.73/1.10 clear(print_kept).
% 0.73/1.10 clear(print_new_demod).
% 0.73/1.10 clear(print_back_demod).
% 0.73/1.10 clear(print_given).
% 0.73/1.10 assign(max_mem,64000).
% 0.73/1.10 end_of_commands.
% 0.73/1.10
% 0.73/1.10 Usable:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Sos:
% 0.73/1.10 0 (wt=-1) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.73/1.10 0 (wt=-1) [] apply(apply(l2,A),B) = apply(B,apply(A,A)).
% 0.73/1.10 0 (wt=-1) [] -(A = apply(combinator,A)).
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Demodulators:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Passive:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Starting to process input.
% 0.73/1.10
% 0.73/1.10 ** KEPT: 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.73/1.10 1 is a new demodulator.
% 0.73/1.10
% 0.73/1.10 ** KEPT: 2 (wt=11) [] apply(apply(l2,A),B) = apply(B,apply(A,A)).
% 0.73/1.10
% 0.73/1.10 ** KEPT: 3 (wt=11) [flip(2)] apply(A,apply(B,B)) = apply(apply(l2,B),A).
% 0.73/1.10 clause forward subsumed: 0 (wt=11) [flip(3)] apply(apply(l2,B),A) = apply(A,apply(B,B)).
% 0.73/1.10
% 0.73/1.10 ** KEPT: 4 (wt=5) [flip(1)] -(apply(combinator,A) = A).
% 0.73/1.10 ---------------- PROOF FOUND ----------------
% 0.73/1.10 % SZS status Unsatisfiable
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 After processing input:
% 0.73/1.10
% 0.73/1.10 Usable:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Sos:
% 0.73/1.10 4 (wt=5) [flip(1)] -(apply(combinator,A) = A).
% 0.73/1.10 2 (wt=11) [] apply(apply(l2,A),B) = apply(B,apply(A,A)).
% 0.73/1.10 3 (wt=11) [flip(2)] apply(A,apply(B,B)) = apply(apply(l2,B),A).
% 0.73/1.10 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Demodulators:
% 0.73/1.10 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Passive:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 UNIT CONFLICT from 22 and 17 at 0.00 seconds.
% 0.73/1.10
% 0.73/1.10 ---------------- PROOF ----------------
% 0.73/1.10 % SZS output start Refutation
% See solution above
% 0.73/1.10 ------------ end of proof -------------
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 ------------- memory usage ------------
% 0.73/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.10 type (bytes each) gets frees in use avail bytes
% 0.73/1.10 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.73/1.10 term ( 16) 1097 757 340 22 7.0 K
% 0.73/1.10 gen_ptr ( 8) 1208 83 1125 8 8.9 K
% 0.73/1.10 context ( 808) 601 599 2 2 3.2 K
% 0.73/1.10 trail ( 12) 50 50 0 5 0.1 K
% 0.73/1.10 bt_node ( 68) 203 200 3 7 0.7 K
% 0.73/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.10 ac_match_free_vars_pos (4020)
% 0.73/1.10 0 0 0 0 0.0 K
% 0.73/1.10 discrim ( 12) 252 0 252 0 3.0 K
% 0.73/1.10 flat ( 40) 1363 1363 0 21 0.8 K
% 0.73/1.10 discrim_pos ( 12) 11 11 0 1 0.0 K
% 0.73/1.10 fpa_head ( 12) 159 0 159 0 1.9 K
% 0.73/1.10 fpa_tree ( 28) 203 203 0 23 0.6 K
% 0.73/1.10 fpa_pos ( 36) 25 25 0 1 0.0 K
% 0.73/1.10 literal ( 12) 61 39 22 0 0.3 K
% 0.73/1.10 clause ( 24) 61 39 22 0 0.5 K
% 0.73/1.10 list ( 12) 62 6 56 3 0.7 K
% 0.73/1.10 list_pos ( 20) 69 3 66 0 1.3 K
% 0.73/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.10
% 0.73/1.10 -------------- statistics -------------
% 0.73/1.10 Clauses input 3
% 0.73/1.10 Usable input 0
% 0.73/1.10 Sos input 3
% 0.73/1.10 Demodulators input 0
% 0.73/1.10 Passive input 0
% 0.73/1.10
% 0.73/1.10 Processed BS (before search) 5
% 0.73/1.10 Forward subsumed BS 1
% 0.73/1.10 Kept BS 4
% 0.73/1.10 New demodulators BS 1
% 0.73/1.10 Back demodulated BS 0
% 0.73/1.10
% 0.73/1.10 Clauses or pairs given 29
% 0.73/1.10 Clauses generated 31
% 0.73/1.10 Forward subsumed 13
% 0.73/1.10 Deleted by weight 0
% 0.73/1.10 Deleted by variable count 0
% 0.73/1.10 Kept 18
% 0.73/1.10 New demodulators 2
% 0.73/1.10 Back demodulated 0
% 0.73/1.10 Ordered paramod prunes 0
% 0.73/1.10 Basic paramod prunes 7
% 0.73/1.10 Prime paramod prunes 0
% 0.73/1.10 Semantic prunes 0
% 0.73/1.10
% 0.73/1.10 Rewrite attmepts 325
% 0.73/1.10 Rewrites 0
% 0.73/1.10
% 0.73/1.10 FPA overloads 0
% 0.73/1.10 FPA underloads 0
% 0.73/1.10
% 0.73/1.10 Usable size 0
% 0.73/1.10 Sos size 21
% 0.73/1.10 Demodulators size 3
% 0.73/1.10 Passive size 0
% 0.73/1.10 Disabled size 0
% 0.73/1.10
% 0.73/1.10 Proofs found 1
% 0.73/1.10
% 0.73/1.10 ----------- times (seconds) ----------- Tue May 31 14:36:11 2022
% 0.73/1.10
% 0.73/1.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.73/1.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.73/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.10 input time 0.00
% 0.73/1.10 paramodulation time 0.00
% 0.73/1.10 demodulation time 0.00
% 0.73/1.10 orient time 0.00
% 0.73/1.10 weigh time 0.00
% 0.73/1.10 forward subsume time 0.00
% 0.73/1.10 back demod find time 0.00
% 0.73/1.10 conflict time 0.00
% 0.73/1.10 LRPO time 0.00
% 0.73/1.10 store clause time 0.00
% 0.73/1.10 disable clause time 0.00
% 0.73/1.10 prime paramod time 0.00
% 0.73/1.10 semantics time 0.00
% 0.73/1.10
% 0.73/1.10 EQP interrupted
%------------------------------------------------------------------------------