TSTP Solution File: COL059-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL059-1 : TPTP v8.1.0. Released v1.0.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:18 EDT 2022
% Result : Unsatisfiable 0.66s 1.07s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(response(response(kestrel,A),B),A),
file('COL059-1.p',unknown),
[] ).
cnf(2,plain,
equal(response(response(lark,A),B),response(A,response(B,B))),
file('COL059-1.p',unknown),
[] ).
cnf(4,plain,
equal(response(response(response(lark,lark),A),B),response(response(A,A),response(B,B))),
file('COL059-1.p',unknown),
[] ).
cnf(5,plain,
equal(response(response(A,A),response(B,B)),response(response(response(lark,lark),A),B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(8,plain,
~ equal(response(l2,l2),l2),
file('COL059-1.p',unknown),
[] ).
cnf(9,plain,
equal(response(lark,lark),l2),
file('COL059-1.p',unknown),
[] ).
cnf(12,plain,
equal(response(response(A,A),response(B,B)),response(response(l2,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),9]),
[iquote('back_demod(5),demod([9])')] ).
cnf(14,plain,
equal(response(l2,lark),l3),
file('COL059-1.p',unknown),
[] ).
cnf(17,plain,
equal(response(l3,l3),l3),
file('COL059-1.p',unknown),
[] ).
cnf(25,plain,
equal(response(lark,response(A,A)),response(l2,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,2]),1]),
[iquote('para(9,2),flip(1)')] ).
cnf(28,plain,
equal(response(lark,l2),l3),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,25]),14]),
[iquote('para(9,25),demod([14])')] ).
cnf(35,plain,
equal(response(l3,A),response(l2,response(A,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,2]),14,25]),
[iquote('para(12,2),demod([14,25])')] ).
cnf(36,plain,
equal(response(l2,response(A,A)),response(l3,A)),
inference(flip,[status(thm),theory(equality)],[35]),
[iquote('flip(35)')] ).
cnf(54,plain,
equal(response(l2,l3),l3),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,17]),17]),
[iquote('para(35,17),demod([17])')] ).
cnf(62,plain,
equal(response(l3,response(A,A)),response(l3,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,12]),54]),
[iquote('para(17,12),demod([54])')] ).
cnf(70,plain,
equal(response(lark,A),response(l2,response(kestrel,A))),
inference(para,[status(thm),theory(equality)],[1,25]),
[iquote('para(1,25)')] ).
cnf(86,plain,
equal(response(l2,response(kestrel,l2)),l3),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),70]),
[iquote('back_demod(28),demod([70])')] ).
cnf(97,plain,
equal(response(l2,response(kestrel,lark)),l2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),70]),
[iquote('back_demod(9),demod([70])')] ).
cnf(104,plain,
equal(response(l3,response(kestrel,A)),response(l2,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,36]),1]),
[iquote('para(1,36),flip(1)')] ).
cnf(106,plain,
equal(response(l3,A),response(l2,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,62]),104]),
[iquote('para(1,62),demod([104])')] ).
cnf(111,plain,
equal(response(l2,response(kestrel,A)),response(l2,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[104]),106]),
[iquote('back_demod(104),demod([106])')] ).
cnf(114,plain,
equal(l3,l2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[97]),111,14]),
[iquote('back_demod(97),demod([111,14])')] ).
cnf(115,plain,
equal(response(l2,l2),l2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),111,114]),
[iquote('back_demod(86),demod([111,114])')] ).
cnf(116,plain,
$false,
inference(conflict,[status(thm)],[115,8]),
[iquote('conflict(115,8)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : COL059-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n025.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue May 31 15:55:43 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.66/1.06 ----- EQP 0.9e, May 2009 -----
% 0.66/1.06 The job began on n025.cluster.edu, Tue May 31 15:55:44 2022
% 0.66/1.06 The command was "./eqp09e".
% 0.66/1.06
% 0.66/1.06 set(prolog_style_variables).
% 0.66/1.06 set(lrpo).
% 0.66/1.06 set(basic_paramod).
% 0.66/1.06 set(functional_subsume).
% 0.66/1.06 set(ordered_paramod).
% 0.66/1.06 set(prime_paramod).
% 0.66/1.06 set(para_pairs).
% 0.66/1.06 assign(pick_given_ratio,4).
% 0.66/1.06 clear(print_kept).
% 0.66/1.06 clear(print_new_demod).
% 0.66/1.06 clear(print_back_demod).
% 0.66/1.06 clear(print_given).
% 0.66/1.06 assign(max_mem,64000).
% 0.66/1.06 end_of_commands.
% 0.66/1.06
% 0.66/1.06 Usable:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Sos:
% 0.66/1.06 0 (wt=-1) [] response(response(kestrel,A),B) = A.
% 0.66/1.06 0 (wt=-1) [] response(response(lark,A),B) = response(A,response(B,B)).
% 0.66/1.06 0 (wt=-1) [] response(response(response(lark,lark),A),B) = response(response(A,A),response(B,B)).
% 0.66/1.06 0 (wt=-1) [] response(response(response(response(lark,lark),lark),A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06 0 (wt=-1) [] -(response(l2,l2) = l2).
% 0.66/1.06 0 (wt=-1) [] response(lark,lark) = l2.
% 0.66/1.06 0 (wt=-1) [] response(l2,lark) = l3.
% 0.66/1.06 0 (wt=-1) [] response(l3,l3) = l3.
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Demodulators:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Passive:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Starting to process input.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 1 (wt=7) [] response(response(kestrel,A),B) = A.
% 0.66/1.06 1 is a new demodulator.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 2 (wt=11) [] response(response(lark,A),B) = response(A,response(B,B)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 3 (wt=11) [flip(2)] response(A,response(B,B)) = response(response(lark,A),B).
% 0.66/1.06 clause forward subsumed: 0 (wt=11) [flip(3)] response(response(lark,A),B) = response(A,response(B,B)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 4 (wt=15) [] response(response(response(lark,lark),A),B) = response(response(A,A),response(B,B)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 5 (wt=15) [flip(4)] response(response(A,A),response(B,B)) = response(response(response(lark,lark),A),B).
% 0.66/1.06 clause forward subsumed: 0 (wt=15) [flip(5)] response(response(response(lark,lark),A),B) = response(response(A,A),response(B,B)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 6 (wt=21) [] response(response(response(response(lark,lark),lark),A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 7 (wt=21) [flip(6)] response(response(response(A,A),response(A,A)),response(x2,x2)) = response(response(response(response(lark,lark),lark),A),B).
% 0.66/1.06 clause forward subsumed: 0 (wt=21) [flip(7)] response(response(response(response(lark,lark),lark),A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 8 (wt=5) [] -(response(l2,l2) = l2).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 9 (wt=5) [] response(lark,lark) = l2.
% 0.66/1.06 9 is a new demodulator.
% 0.66/1.06 -> 9 back demodulating 7.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 10 (wt=19) [back_demod(7),demod([9])] response(response(response(A,A),response(A,A)),response(x2,x2)) = response(response(response(l2,lark),A),B).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 11 (wt=19) [flip(10)] response(response(response(l2,lark),A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06 clause forward subsumed: 0 (wt=19) [flip(11)] response(response(response(A,A),response(A,A)),response(x2,x2)) = response(response(response(l2,lark),A),B).
% 0.66/1.06 -> 9 back demodulating 6.
% 0.66/1.06 clause forward subsumed: 0 (wt=19) [back_demod(6),demod([9])] response(response(response(l2,lark),A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06 -> 9 back demodulating 5.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 12 (wt=13) [back_demod(5),demod([9])] response(response(A,A),response(B,B)) = response(response(l2,A),B).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 13 (wt=13) [flip(12)] response(response(l2,A),B) = response(response(A,A),response(B,B)).
% 0.66/1.06 clause forward subsumed: 0 (wt=13) [flip(13)] response(response(A,A),response(B,B)) = response(response(l2,A),B).
% 0.66/1.06 -> 9 back demodulating 4.
% 0.66/1.06 clause forward subsumed: 0 (wt=13) [back_demod(4),demod([9])] response(response(l2,A),B) = response(response(A,A),response(B,B)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 14 (wt=5) [] response(l2,lark) = l3.
% 0.66/1.06 14 is a new demodulator.
% 0.66/1.06 -> 14 back demodulating 11.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 15 (wt=17) [back_demod(11),demod([14])] response(response(l3,A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06
% 0.66/1.06 ** KEPT: 16 (wt=17) [flip(15)] response(response(response(A,A),response(A,A)),response(x2,x2)) = response(response(l3,A),B).
% 0.66/1.06 clause forward subsumed: 0 (wt=17) [flip(16)] response(response(l3,A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.06 -> 14 back demodulating 10.
% 0.66/1.07 clause forward subsumed: 0 (wt=17) [back_demod(10),demod([14])] response(response(response(A,A),response(A,A)),response(x2,x2)) = response(response(l3,A),B).
% 0.66/1.07
% 0.66/1.07 ** KEPT: 17 (wt=5) [] response(l3,l3) = l3.
% 0.66/1.07 17 is a new demodulator.
% 0.66/1.07 ---------------- PROOF FOUND ----------------
% 0.66/1.07 % SZS status Unsatisfiable
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 After processing input:
% 0.66/1.07
% 0.66/1.07 Usable:
% 0.66/1.07 end_of_list.
% 0.66/1.07
% 0.66/1.07 Sos:
% 0.66/1.07 8 (wt=5) [] -(response(l2,l2) = l2).
% 0.66/1.07 9 (wt=5) [] response(lark,lark) = l2.
% 0.66/1.07 14 (wt=5) [] response(l2,lark) = l3.
% 0.66/1.07 17 (wt=5) [] response(l3,l3) = l3.
% 0.66/1.07 1 (wt=7) [] response(response(kestrel,A),B) = A.
% 0.66/1.07 2 (wt=11) [] response(response(lark,A),B) = response(A,response(B,B)).
% 0.66/1.07 3 (wt=11) [flip(2)] response(A,response(B,B)) = response(response(lark,A),B).
% 0.66/1.07 12 (wt=13) [back_demod(5),demod([9])] response(response(A,A),response(B,B)) = response(response(l2,A),B).
% 0.66/1.07 13 (wt=13) [flip(12)] response(response(l2,A),B) = response(response(A,A),response(B,B)).
% 0.66/1.07 15 (wt=17) [back_demod(11),demod([14])] response(response(l3,A),B) = response(response(response(A,A),response(A,A)),response(x2,x2)).
% 0.66/1.07 16 (wt=17) [flip(15)] response(response(response(A,A),response(A,A)),response(x2,x2)) = response(response(l3,A),B).
% 0.66/1.07 end_of_list.
% 0.66/1.07
% 0.66/1.07 Demodulators:
% 0.66/1.07 1 (wt=7) [] response(response(kestrel,A),B) = A.
% 0.66/1.07 9 (wt=5) [] response(lark,lark) = l2.
% 0.66/1.07 14 (wt=5) [] response(l2,lark) = l3.
% 0.66/1.07 17 (wt=5) [] response(l3,l3) = l3.
% 0.66/1.07 end_of_list.
% 0.66/1.07
% 0.66/1.07 Passive:
% 0.66/1.07 end_of_list.
% 0.66/1.07
% 0.66/1.07 UNIT CONFLICT from 115 and 8 at 0.00 seconds.
% 0.66/1.07
% 0.66/1.07 ---------------- PROOF ----------------
% 0.66/1.07 % SZS output start Refutation
% See solution above
% 0.66/1.07 ------------ end of proof -------------
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 ------------- memory usage ------------
% 0.66/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.66/1.07 type (bytes each) gets frees in use avail bytes
% 0.66/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.66/1.07 term ( 16) 5191 3582 1609 16 31.3 K
% 0.66/1.07 gen_ptr ( 8) 7290 1402 5888 23 46.2 K
% 0.66/1.07 context ( 808) 5053 5051 2 3 3.9 K
% 0.66/1.07 trail ( 12) 184 184 0 2 0.0 K
% 0.66/1.07 bt_node ( 68) 1901 1898 3 4 0.5 K
% 0.66/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.66/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.66/1.07 ac_match_free_vars_pos (4020)
% 0.66/1.07 0 0 0 0 0.0 K
% 0.66/1.07 discrim ( 12) 1140 440 700 30 8.6 K
% 0.66/1.07 flat ( 40) 9120 9120 0 27 1.1 K
% 0.66/1.07 discrim_pos ( 12) 186 186 0 1 0.0 K
% 0.66/1.07 fpa_head ( 12) 328 0 328 0 3.8 K
% 0.66/1.07 fpa_tree ( 28) 212 212 0 9 0.2 K
% 0.66/1.07 fpa_pos ( 36) 162 162 0 1 0.0 K
% 0.66/1.07 literal ( 12) 412 297 115 1 1.4 K
% 0.66/1.07 clause ( 24) 412 297 115 1 2.7 K
% 0.66/1.07 list ( 12) 106 47 59 1 0.7 K
% 0.66/1.07 list_pos ( 20) 551 230 321 8 6.4 K
% 0.66/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.66/1.07
% 0.66/1.07 -------------- statistics -------------
% 0.66/1.07 Clauses input 8
% 0.66/1.07 Usable input 0
% 0.66/1.07 Sos input 8
% 0.66/1.07 Demodulators input 0
% 0.66/1.07 Passive input 0
% 0.66/1.07
% 0.66/1.07 Processed BS (before search) 26
% 0.66/1.07 Forward subsumed BS 9
% 0.66/1.07 Kept BS 17
% 0.66/1.07 New demodulators BS 4
% 0.66/1.07 Back demodulated BS 6
% 0.66/1.07
% 0.66/1.07 Clauses or pairs given 223
% 0.66/1.07 Clauses generated 193
% 0.66/1.07 Forward subsumed 95
% 0.66/1.07 Deleted by weight 0
% 0.66/1.07 Deleted by variable count 0
% 0.66/1.07 Kept 98
% 0.66/1.07 New demodulators 43
% 0.66/1.07 Back demodulated 44
% 0.66/1.07 Ordered paramod prunes 0
% 0.66/1.07 Basic paramod prunes 157
% 0.66/1.07 Prime paramod prunes 0
% 0.66/1.07 Semantic prunes 0
% 0.66/1.07
% 0.66/1.07 Rewrite attmepts 2408
% 0.66/1.07 Rewrites 126
% 0.66/1.07
% 0.66/1.07 FPA overloads 0
% 0.66/1.07 FPA underloads 0
% 0.66/1.07
% 0.66/1.07 Usable size 0
% 0.66/1.07 Sos size 64
% 0.66/1.07 Demodulators size 27
% 0.66/1.07 Passive size 0
% 0.66/1.07 Disabled size 50
% 0.66/1.07
% 0.66/1.07 Proofs found 1
% 0.66/1.07
% 0.66/1.07 ----------- times (seconds) ----------- Tue May 31 15:55:44 2022
% 0.66/1.07
% 0.66/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.66/1.07 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.66/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.66/1.07 input time 0.00
% 0.66/1.07 paramodulation time 0.00
% 0.66/1.07 demodulation time 0.00
% 0.66/1.07 orient time 0.00
% 0.66/1.07 weigh time 0.00
% 0.66/1.07 forward subsume time 0.00
% 0.66/1.07 back demod find time 0.00
% 0.66/1.07 conflict time 0.00
% 0.66/1.07 LRPO time 0.00
% 0.66/1.07 store clause time 0.00
% 0.66/1.07 disable clause time 0.00
% 0.66/1.07 prime paramod time 0.00
% 0.66/1.07 semantics time 0.00
% 0.66/1.07
% 0.66/1.07 EQP interrupted
%------------------------------------------------------------------------------