TSTP Solution File: LAT394-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LAT394-2 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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 : Sun Jul 17 04:37:23 EDT 2022
% Result : Unsatisfiable 0.79s 1.57s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 1
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 3 RR)
% Number of literals : 37 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 85 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))),B),
file('LAT394-2.p',unknown),
[] ).
cnf(2,plain,
~ equal(f(x1,f(x1,x1)),f(x0,f(x0,x0))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(f(f(f(f(A,f(f(f(B,C),f(C,D)),E)),C),F),f(f(f(f(B,C),f(C,D)),E),f(f(f(f(f(B,C),f(C,D)),E),f(f(A,A),A)),f(C,f(f(C,f(f(B,B),B)),D))))),f(f(f(B,C),f(C,D)),E)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(5,plain,
equal(f(f(A,B),f(A,f(f(A,f(f(f(f(C,A),f(A,D)),f(f(C,A),f(A,D))),f(f(C,A),f(A,D)))),f(f(A,f(f(C,C),C)),D)))),A),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(6,plain,
equal(f(A,f(f(A,B),f(f(f(A,B),f(f(f(C,A),f(C,A)),f(C,A))),D))),f(A,B)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(15,plain,
equal(f(f(A,B),f(f(f(A,B),f(B,C)),B)),f(f(A,B),f(B,C))),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(19,plain,
equal(f(f(f(f(A,B),f(B,f(f(f(B,f(f(A,A),A)),f(f(f(C,B),f(C,B)),f(C,B))),D))),E),f(B,f(f(A,A),A))),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(61,plain,
equal(f(f(A,B),f(B,f(f(B,f(f(A,A),A)),C))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(65,plain,
equal(f(f(A,B),f(B,f(f(A,A),A))),B),
inference(para,[status(thm),theory(equality)],[61,61]),
[iquote('para(61,61)')] ).
cnf(83,plain,
equal(f(f(A,B),f(A,f(f(A,f(f(C,C),C)),B))),A),
inference(para,[status(thm),theory(equality)],[65,1]),
[iquote('para(65,1)')] ).
cnf(89,plain,
equal(f(f(A,B),f(B,B)),B),
inference(para,[status(thm),theory(equality)],[83,61]),
[iquote('para(83,61)')] ).
cnf(105,plain,
equal(f(A,f(f(A,B),f(A,B))),f(A,B)),
inference(para,[status(thm),theory(equality)],[5,6]),
[iquote('para(5,6)')] ).
cnf(121,plain,
equal(f(f(A,f(A,f(f(B,B),B))),f(A,f(f(B,B),B))),A),
inference(para,[status(thm),theory(equality)],[105,83]),
[iquote('para(105,83)')] ).
cnf(143,plain,
equal(f(f(f(f(A,A),A),f(f(f(f(A,A),A),f(f(A,A),A)),f(f(f(f(A,A),A),f(f(A,A),A)),f(f(A,A),A)))),f(f(f(A,A),A),f(f(A,A),A))),f(f(f(f(A,A),A),f(f(A,A),A)),f(f(f(f(A,A),A),f(f(A,A),A)),f(f(A,A),A)))),
inference(para,[status(thm),theory(equality)],[121,65]),
[iquote('para(121,65)')] ).
cnf(159,plain,
equal(f(f(A,B),f(A,f(f(A,f(f(C,C),C)),A))),A),
inference(para,[status(thm),theory(equality)],[89,1]),
[iquote('para(89,1)')] ).
cnf(163,plain,
equal(f(A,f(f(B,A),f(f(f(B,A),f(f(C,C),C)),f(B,A)))),f(B,A)),
inference(para,[status(thm),theory(equality)],[89,159]),
[iquote('para(89,159)')] ).
cnf(175,plain,
equal(f(A,f(f(A,f(f(B,B),B)),A)),f(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[159,105]),1]),
[iquote('para(159,105),flip(1)')] ).
cnf(177,plain,
equal(f(A,f(f(B,A),f(B,A))),f(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[163]),175]),
[iquote('back_demod(163),demod([175])')] ).
cnf(182,plain,
equal(f(f(A,B),f(A,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[159]),175]),
[iquote('back_demod(159),demod([175])')] ).
cnf(184,plain,
equal(f(f(f(f(A,A),A),f(f(A,A),A)),f(f(f(f(A,A),A),f(f(A,A),A)),f(f(A,A),A))),f(f(A,A),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[143]),182]),1]),
[iquote('back_demod(143),demod([182]),flip(1)')] ).
cnf(186,plain,
equal(f(f(f(A,A),B),A),f(A,A)),
inference(para,[status(thm),theory(equality)],[89,182]),
[iquote('para(89,182)')] ).
cnf(292,plain,
equal(f(f(A,A),f(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[186,15]),182]),1]),
[iquote('para(186,15),demod([182]),flip(1)')] ).
cnf(308,plain,
equal(f(f(f(f(A,B),f(B,f(B,B))),C),f(B,B)),B),
inference(para,[status(thm),theory(equality)],[182,1]),
[iquote('para(182,1)')] ).
cnf(310,plain,
equal(f(f(f(A,f(f(A,A),A)),B),A),f(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[89,308]),292,292]),
[iquote('para(89,308),demod([292,292])')] ).
cnf(317,plain,
equal(f(f(A,f(f(A,A),A)),f(A,f(f(A,A),A))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[310,186]),292]),1]),
[iquote('para(310,186),demod([292]),flip(1)')] ).
cnf(322,plain,
equal(f(A,f(f(A,A),A)),f(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[317,182]),317]),1]),
[iquote('para(317,182),demod([317]),flip(1)')] ).
cnf(451,plain,
equal(f(f(A,B),f(A,f(f(A,A),C))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[292,1]),322]),
[iquote('para(292,1),demod([322])')] ).
cnf(461,plain,
equal(f(A,f(f(A,A),B)),f(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[451,105]),1]),
[iquote('para(451,105),flip(1)')] ).
cnf(497,plain,
equal(f(f(f(f(A,A),A),f(f(A,A),A)),B),f(f(A,A),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,4]),177,461,461,292,177,461,6,184,186,182,177,461]),1]),
[iquote('para(19,4),demod([177,461,461,292,177,461,6,184,186,182,177,461]),flip(1)')] ).
cnf(514,plain,
equal(f(A,f(f(f(B,B),B),f(f(B,B),B))),f(f(B,B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[497,177]),497,497]),
[iquote('para(497,177),demod([497,497])')] ).
cnf(530,plain,
equal(f(f(f(A,A),A),f(B,B)),B),
inference(para,[status(thm),theory(equality)],[514,182]),
[iquote('para(514,182)')] ).
cnf(532,plain,
equal(f(f(f(A,A),A),B),f(B,B)),
inference(para,[status(thm),theory(equality)],[89,530]),
[iquote('para(89,530)')] ).
cnf(616,plain,
equal(f(f(A,A),A),f(f(B,B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[532,65]),514]),
[iquote('para(532,65),demod([514])')] ).
cnf(617,plain,
equal(f(A,f(A,A)),f(f(B,B),B)),
inference(para,[status(thm),theory(equality)],[89,616]),
[iquote('para(89,616)')] ).
cnf(618,plain,
equal(f(f(A,A),A),f(B,f(B,B))),
inference(flip,[status(thm),theory(equality)],[617]),
[iquote('flip(617)')] ).
cnf(632,plain,
~ equal(f(f(A,A),A),f(x0,f(x0,x0))),
inference(para,[status(thm),theory(equality)],[617,2]),
[iquote('para(617,2)')] ).
cnf(633,plain,
$false,
inference(conflict,[status(thm)],[632,618]),
[iquote('conflict(632,618)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT394-2 : TPTP v8.1.0. Released v5.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n015.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 : Wed Jun 29 20:20:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.79/1.57 ----- EQP 0.9e, May 2009 -----
% 0.79/1.57 The job began on n015.cluster.edu, Wed Jun 29 20:20:57 2022
% 0.79/1.57 The command was "./eqp09e".
% 0.79/1.57
% 0.79/1.57 set(prolog_style_variables).
% 0.79/1.57 set(lrpo).
% 0.79/1.57 set(basic_paramod).
% 0.79/1.57 set(functional_subsume).
% 0.79/1.57 set(ordered_paramod).
% 0.79/1.57 set(prime_paramod).
% 0.79/1.57 set(para_pairs).
% 0.79/1.57 assign(pick_given_ratio,4).
% 0.79/1.57 clear(print_kept).
% 0.79/1.57 clear(print_new_demod).
% 0.79/1.57 clear(print_back_demod).
% 0.79/1.57 clear(print_given).
% 0.79/1.57 assign(max_mem,64000).
% 0.79/1.57 end_of_commands.
% 0.79/1.57
% 0.79/1.57 Usable:
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Sos:
% 0.79/1.57 0 (wt=-1) [] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = B.
% 0.79/1.57 0 (wt=-1) [] -(f(x0,f(x0,x0)) = f(x1,f(x1,x1))).
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Demodulators:
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Passive:
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Starting to process input.
% 0.79/1.57
% 0.79/1.57 ** KEPT: 1 (wt=23) [] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = B.
% 0.79/1.57 1 is a new demodulator.
% 0.79/1.57
% 0.79/1.57 ** KEPT: 2 (wt=11) [flip(1)] -(f(x1,f(x1,x1)) = f(x0,f(x0,x0))).
% 0.79/1.57 ---------------- PROOF FOUND ----------------
% 0.79/1.57 % SZS status Unsatisfiable
% 0.79/1.57
% 0.79/1.57
% 0.79/1.57 After processing input:
% 0.79/1.57
% 0.79/1.57 Usable:
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Sos:
% 0.79/1.57 2 (wt=11) [flip(1)] -(f(x1,f(x1,x1)) = f(x0,f(x0,x0))).
% 0.79/1.57 1 (wt=23) [] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = B.
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Demodulators:
% 0.79/1.57 1 (wt=23) [] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = B.
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 Passive:
% 0.79/1.57 end_of_list.
% 0.79/1.57
% 0.79/1.57 UNIT CONFLICT from 632 and 618 at 0.41 seconds.
% 0.79/1.57
% 0.79/1.57 ---------------- PROOF ----------------
% 0.79/1.57 % SZS output start Refutation
% See solution above
% 0.79/1.58 ------------ end of proof -------------
% 0.79/1.58
% 0.79/1.58
% 0.79/1.58 ------------- memory usage ------------
% 0.79/1.58 Memory dynamically allocated (tp_alloc): 14648.
% 0.79/1.58 type (bytes each) gets frees in use avail bytes
% 0.79/1.58 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.79/1.58 term ( 16) 333286 190954 142332 160 2780.6 K
% 0.79/1.58 gen_ptr ( 8) 1127042 22826 1104216 36 8627.0 K
% 0.79/1.58 context ( 808) 170020 170018 2 2 3.2 K
% 0.79/1.58 trail ( 12) 320223 320223 0 13 0.2 K
% 0.79/1.58 bt_node ( 68) 39239 39234 5 234 15.9 K
% 0.79/1.58 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.58 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.58 ac_match_free_vars_pos (4020)
% 0.79/1.58 0 0 0 0 0.0 K
% 0.79/1.58 discrim ( 12) 215378 12936 202442 0 2372.4 K
% 0.79/1.58 flat ( 40) 1762493 1762493 0 1193 46.6 K
% 0.79/1.58 discrim_pos ( 12) 1670 1670 0 1 0.0 K
% 0.79/1.58 fpa_head ( 12) 1876 0 1876 0 22.0 K
% 0.79/1.58 fpa_tree ( 28) 16270 16270 0 109 3.0 K
% 0.79/1.58 fpa_pos ( 36) 1234 1234 0 1 0.0 K
% 0.79/1.58 literal ( 12) 2373 1741 632 1 7.4 K
% 0.79/1.58 clause ( 24) 2373 1741 632 1 14.8 K
% 0.79/1.58 list ( 12) 661 605 56 3 0.7 K
% 0.79/1.58 list_pos ( 20) 2765 666 2099 0 41.0 K
% 0.79/1.58 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.58
% 0.79/1.58 -------------- statistics -------------
% 0.79/1.58 Clauses input 2
% 0.79/1.58 Usable input 0
% 0.79/1.58 Sos input 2
% 0.79/1.58 Demodulators input 0
% 0.79/1.58 Passive input 0
% 0.79/1.58
% 0.79/1.58 Processed BS (before search) 2
% 0.79/1.58 Forward subsumed BS 0
% 0.79/1.58 Kept BS 2
% 0.79/1.58 New demodulators BS 1
% 0.79/1.58 Back demodulated BS 0
% 0.79/1.58
% 0.79/1.58 Clauses or pairs given 859
% 0.79/1.58 Clauses generated 1604
% 0.79/1.58 Forward subsumed 974
% 0.79/1.58 Deleted by weight 0
% 0.79/1.58 Deleted by variable count 0
% 0.79/1.58 Kept 630
% 0.79/1.58 New demodulators 601
% 0.79/1.58 Back demodulated 132
% 0.79/1.58 Ordered paramod prunes 0
% 0.79/1.58 Basic paramod prunes 12904
% 0.79/1.58 Prime paramod prunes 108
% 0.79/1.58 Semantic prunes 0
% 0.79/1.58
% 0.79/1.58 Rewrite attmepts 108597
% 0.79/1.58 Rewrites 1503
% 0.79/1.58
% 0.79/1.58 FPA overloads 0
% 0.79/1.58 FPA underloads 0
% 0.79/1.58
% 0.79/1.58 Usable size 0
% 0.79/1.58 Sos size 499
% 0.79/1.58 Demodulators size 470
% 0.79/1.58 Passive size 0
% 0.79/1.58 Disabled size 132
% 0.79/1.58
% 0.79/1.58 Proofs found 1
% 0.79/1.58
% 0.79/1.58 ----------- times (seconds) ----------- Wed Jun 29 20:20:57 2022
% 0.79/1.58
% 0.79/1.58 user CPU time 0.41 (0 hr, 0 min, 0 sec)
% 0.79/1.58 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.79/1.58 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.58 input time 0.00
% 0.79/1.58 paramodulation time 0.06
% 0.79/1.58 demodulation time 0.07
% 0.79/1.58 orient time 0.01
% 0.79/1.58 weigh time 0.00
% 0.79/1.58 forward subsume time 0.00
% 0.79/1.58 back demod find time 0.10
% 0.79/1.58 conflict time 0.00
% 0.79/1.58 LRPO time 0.01
% 0.79/1.58 store clause time 0.13
% 0.79/1.58 disable clause time 0.00
% 0.79/1.58 prime paramod time 0.04
% 0.79/1.58 semantics time 0.00
% 0.79/1.58
% 0.79/1.58 EQP interrupted
%------------------------------------------------------------------------------