TSTP Solution File: COL075-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL075-2 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:22 EDT 2022
% Result : Unsatisfiable 0.80s 1.19s
% Output : Refutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 0 equ; 2 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; 2 con; 0-2 aty)
% Number of variables : 25 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(apply(apply(k,A),B),A),
file('COL075-2.p',unknown),
[] ).
cnf(2,plain,
equal(apply(apply(apply(abstraction,A),B),C),apply(apply(A,apply(k,C)),apply(B,C))),
file('COL075-2.p',unknown),
[] ).
cnf(3,plain,
equal(apply(apply(A,apply(k,B)),apply(C,B)),apply(apply(apply(abstraction,A),C),B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(apply(apply(A,b(A)),c(A)),apply(b(A),b(A))),
file('COL075-2.p',unknown),
[] ).
cnf(10,plain,
equal(apply(apply(A,apply(k,B)),C),apply(apply(apply(abstraction,A),apply(k,C)),B)),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(13,plain,
equal(apply(apply(apply(abstraction,apply(abstraction,A)),B),C),apply(apply(A,apply(k,apply(B,C))),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),demod([1])')] ).
cnf(14,plain,
equal(apply(apply(A,apply(k,apply(B,C))),C),apply(apply(apply(abstraction,apply(abstraction,A)),B),C)),
inference(flip,[status(thm),theory(equality)],[13]),
[iquote('flip(13)')] ).
cnf(26,plain,
equal(apply(apply(apply(abstraction,apply(abstraction,apply(k,A))),B),C),apply(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,14]),1]),
[iquote('para(1,14),flip(1)')] ).
cnf(55,plain,
equal(apply(apply(apply(apply(abstraction,A),k),B),C),apply(apply(apply(abstraction,apply(A,apply(k,B))),apply(k,C)),B)),
inference(para,[status(thm),theory(equality)],[3,10]),
[iquote('para(3,10)')] ).
cnf(808,plain,
~ equal(apply(apply(apply(abstraction,apply(A,apply(k,b(apply(apply(abstraction,A),k))))),apply(k,c(apply(apply(abstraction,A),k)))),b(apply(apply(abstraction,A),k))),apply(b(apply(apply(abstraction,A),k)),b(apply(apply(abstraction,A),k)))),
inference(para,[status(thm),theory(equality)],[55,4]),
[iquote('para(55,4)')] ).
cnf(809,plain,
$false,
inference(conflict,[status(thm)],[808,26]),
[iquote('conflict(808,26)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL075-2 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n025.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 12:27:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.80/1.19 ----- EQP 0.9e, May 2009 -----
% 0.80/1.19 The job began on n025.cluster.edu, Tue May 31 12:27:28 2022
% 0.80/1.19 The command was "./eqp09e".
% 0.80/1.19
% 0.80/1.19 set(prolog_style_variables).
% 0.80/1.19 set(lrpo).
% 0.80/1.19 set(basic_paramod).
% 0.80/1.19 set(functional_subsume).
% 0.80/1.19 set(ordered_paramod).
% 0.80/1.19 set(prime_paramod).
% 0.80/1.19 set(para_pairs).
% 0.80/1.19 assign(pick_given_ratio,4).
% 0.80/1.19 clear(print_kept).
% 0.80/1.19 clear(print_new_demod).
% 0.80/1.19 clear(print_back_demod).
% 0.80/1.19 clear(print_given).
% 0.80/1.19 assign(max_mem,64000).
% 0.80/1.19 end_of_commands.
% 0.80/1.19
% 0.80/1.19 Usable:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Sos:
% 0.80/1.19 0 (wt=-1) [] apply(apply(k,A),B) = A.
% 0.80/1.19 0 (wt=-1) [] apply(apply(apply(abstraction,A),B),C) = apply(apply(A,apply(k,C)),apply(B,C)).
% 0.80/1.19 0 (wt=-1) [] -(apply(apply(A,b(A)),c(A)) = apply(b(A),b(A))).
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Demodulators:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Passive:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Starting to process input.
% 0.80/1.19
% 0.80/1.19 ** KEPT: 1 (wt=7) [] apply(apply(k,A),B) = A.
% 0.80/1.19 1 is a new demodulator.
% 0.80/1.19
% 0.80/1.19 ** KEPT: 2 (wt=17) [] apply(apply(apply(abstraction,A),B),C) = apply(apply(A,apply(k,C)),apply(B,C)).
% 0.80/1.19
% 0.80/1.19 ** KEPT: 3 (wt=17) [flip(2)] apply(apply(A,apply(k,B)),apply(C,B)) = apply(apply(apply(abstraction,A),C),B).
% 0.80/1.19 clause forward subsumed: 0 (wt=17) [flip(3)] apply(apply(apply(abstraction,A),C),B) = apply(apply(A,apply(k,B)),apply(C,B)).
% 0.80/1.19
% 0.80/1.19 ** KEPT: 4 (wt=13) [] -(apply(apply(A,b(A)),c(A)) = apply(b(A),b(A))).
% 0.80/1.19 ---------------- PROOF FOUND ----------------
% 0.80/1.19 % SZS status Unsatisfiable
% 0.80/1.19
% 0.80/1.19
% 0.80/1.19 After processing input:
% 0.80/1.19
% 0.80/1.19 Usable:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Sos:
% 0.80/1.19 1 (wt=7) [] apply(apply(k,A),B) = A.
% 0.80/1.19 4 (wt=13) [] -(apply(apply(A,b(A)),c(A)) = apply(b(A),b(A))).
% 0.80/1.19 2 (wt=17) [] apply(apply(apply(abstraction,A),B),C) = apply(apply(A,apply(k,C)),apply(B,C)).
% 0.80/1.19 3 (wt=17) [flip(2)] apply(apply(A,apply(k,B)),apply(C,B)) = apply(apply(apply(abstraction,A),C),B).
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Demodulators:
% 0.80/1.19 1 (wt=7) [] apply(apply(k,A),B) = A.
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Passive:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 UNIT CONFLICT from 808 and 26 at 0.08 seconds.
% 0.80/1.19
% 0.80/1.19 ---------------- PROOF ----------------
% 0.80/1.19 % SZS output start Refutation
% See solution above
% 0.80/1.19 ------------ end of proof -------------
% 0.80/1.19
% 0.80/1.19
% 0.80/1.19 ------------- memory usage ------------
% 0.80/1.19 Memory dynamically allocated (tp_alloc): 2929.
% 0.80/1.19 type (bytes each) gets frees in use avail bytes
% 0.80/1.19 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.80/1.19 term ( 16) 74968 43769 31199 43 607.0 K
% 0.80/1.19 gen_ptr ( 8) 171710 3507 168203 10 1314.2 K
% 0.80/1.19 context ( 808) 69066 69064 2 4 4.7 K
% 0.80/1.19 trail ( 12) 3551 3551 0 5 0.1 K
% 0.80/1.19 bt_node ( 68) 27827 27822 5 18 1.5 K
% 0.80/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.80/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.80/1.19 ac_match_free_vars_pos (4020)
% 0.80/1.19 0 0 0 0 0.0 K
% 0.80/1.19 discrim ( 12) 21573 0 21573 0 252.8 K
% 0.80/1.19 flat ( 40) 183891 183891 0 77 3.0 K
% 0.80/1.19 discrim_pos ( 12) 1229 1229 0 1 0.0 K
% 0.80/1.19 fpa_head ( 12) 4060 0 4060 0 47.6 K
% 0.80/1.19 fpa_tree ( 28) 14768 14768 0 57 1.6 K
% 0.80/1.19 fpa_pos ( 36) 889 889 0 1 0.0 K
% 0.80/1.19 literal ( 12) 2757 1949 808 0 9.5 K
% 0.80/1.19 clause ( 24) 2757 1949 808 0 18.9 K
% 0.80/1.19 list ( 12) 140 84 56 3 0.7 K
% 0.80/1.19 list_pos ( 20) 2505 3 2502 0 48.9 K
% 0.80/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.80/1.19
% 0.80/1.19 -------------- statistics -------------
% 0.80/1.19 Clauses input 3
% 0.80/1.19 Usable input 0
% 0.80/1.19 Sos input 3
% 0.80/1.19 Demodulators input 0
% 0.80/1.19 Passive input 0
% 0.80/1.19
% 0.80/1.19 Processed BS (before search) 5
% 0.80/1.19 Forward subsumed BS 1
% 0.80/1.19 Kept BS 4
% 0.80/1.19 New demodulators BS 1
% 0.80/1.19 Back demodulated BS 0
% 0.80/1.19
% 0.80/1.19 Clauses or pairs given 1368
% 0.80/1.19 Clauses generated 1555
% 0.80/1.19 Forward subsumed 751
% 0.80/1.19 Deleted by weight 0
% 0.80/1.19 Deleted by variable count 0
% 0.80/1.19 Kept 804
% 0.80/1.19 New demodulators 80
% 0.80/1.19 Back demodulated 0
% 0.80/1.19 Ordered paramod prunes 0
% 0.80/1.19 Basic paramod prunes 8896
% 0.80/1.19 Prime paramod prunes 0
% 0.80/1.19 Semantic prunes 0
% 0.80/1.19
% 0.80/1.19 Rewrite attmepts 40054
% 0.80/1.19 Rewrites 798
% 0.80/1.19
% 0.80/1.19 FPA overloads 0
% 0.80/1.19 FPA underloads 0
% 0.80/1.19
% 0.80/1.19 Usable size 0
% 0.80/1.19 Sos size 807
% 0.80/1.19 Demodulators size 81
% 0.80/1.19 Passive size 0
% 0.80/1.19 Disabled size 0
% 0.80/1.19
% 0.80/1.19 Proofs found 1
% 0.80/1.19
% 0.80/1.19 ----------- times (seconds) ----------- Tue May 31 12:27:29 2022
% 0.80/1.19
% 0.80/1.19 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.80/1.19 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.80/1.19 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.80/1.19 input time 0.00
% 0.80/1.19 paramodulation time 0.01
% 0.80/1.19 demodulation time 0.01
% 0.80/1.19 orient time 0.01
% 0.80/1.19 weigh time 0.00
% 0.80/1.19 forward subsume time 0.00
% 0.80/1.19 back demod find time 0.00
% 0.80/1.19 conflict time 0.01
% 0.80/1.19 LRPO time 0.01
% 0.80/1.19 store clause time 0.02
% 0.80/1.19 disable clause time 0.00
% 0.80/1.19 prime paramod time 0.00
% 0.80/1.19 semantics time 0.00
% 0.80/1.19
% 0.80/1.19 EQP interrupted
%------------------------------------------------------------------------------