TSTP Solution File: LAT038-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LAT038-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:34:23 EDT 2022
% Result : Unsatisfiable 1.67s 2.05s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 7 RR)
% Number of literals : 22 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(meet(A,A),A),
file('LAT038-1.p',unknown),
[] ).
cnf(4,plain,
equal(join(A,meet(A,B)),A),
file('LAT038-1.p',unknown),
[] ).
cnf(5,plain,
equal(meet(A,B),meet(B,A)),
file('LAT038-1.p',unknown),
[] ).
cnf(7,plain,
equal(meet(meet(A,B),C),meet(A,meet(B,C))),
file('LAT038-1.p',unknown),
[] ).
cnf(10,plain,
equal(meet(A,join(B,C)),join(meet(A,B),meet(A,C))),
file('LAT038-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(f(A,B),f(C,B)),f(join(A,C),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(16,plain,
equal(f(join(cc,bb),dd),f(join(aa,bb),dd)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(17,plain,
equal(meet(f(cc,dd),f(bb,dd)),meet(f(aa,dd),f(bb,dd))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(18,plain,
~ equal(f(cc,dd),f(aa,dd)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(19,plain,
equal(join(A,meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[5,4]),
[iquote('para(5,4)')] ).
cnf(22,plain,
equal(meet(A,meet(A,B)),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,7]),1]),
[iquote('para(1,7),flip(1)')] ).
cnf(24,plain,
equal(join(meet(A,B),meet(A,meet(B,C))),meet(A,B)),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(44,plain,
equal(meet(A,f(join(B,C),D)),join(meet(A,f(B,D)),meet(A,f(C,D)))),
inference(para,[status(thm),theory(equality)],[12,10]),
[iquote('para(12,10)')] ).
cnf(58,plain,
equal(join(A,meet(B,meet(C,A))),A),
inference(para,[status(thm),theory(equality)],[7,19]),
[iquote('para(7,19)')] ).
cnf(89,plain,
equal(join(meet(A,f(cc,dd)),meet(A,meet(f(aa,dd),f(bb,dd)))),meet(A,f(cc,dd))),
inference(para,[status(thm),theory(equality)],[17,24]),
[iquote('para(17,24)')] ).
cnf(387,plain,
equal(join(meet(A,f(cc,dd)),meet(A,f(bb,dd))),join(meet(A,f(aa,dd)),meet(A,f(bb,dd)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,44]),44]),1]),
[iquote('para(16,44),demod([44]),flip(1)')] ).
cnf(1061,plain,
equal(meet(f(aa,dd),f(cc,dd)),f(aa,dd)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,89]),387,1,4]),1]),
[iquote('para(22,89),demod([387,1,4]),flip(1)')] ).
cnf(1062,plain,
equal(meet(f(cc,dd),f(aa,dd)),f(aa,dd)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1061,5]),1]),
[iquote('para(1061,5),flip(1)')] ).
cnf(1076,plain,
equal(join(f(cc,dd),meet(A,f(aa,dd))),f(cc,dd)),
inference(para,[status(thm),theory(equality)],[1061,58]),
[iquote('para(1061,58)')] ).
cnf(1083,plain,
equal(join(f(cc,dd),meet(f(aa,dd),A)),f(cc,dd)),
inference(para,[status(thm),theory(equality)],[5,1076]),
[iquote('para(5,1076)')] ).
cnf(6071,plain,
equal(f(cc,dd),f(aa,dd)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,387]),17,1083,1062,17,4]),
[iquote('para(1,387),demod([17,1083,1062,17,4])')] ).
cnf(6072,plain,
$false,
inference(conflict,[status(thm)],[6071,18]),
[iquote('conflict(6071,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LAT038-1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.10 % Command : tptp2X_and_run_eqp %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Wed Jun 29 15:23:58 EDT 2022
% 0.10/0.29 % CPUTime :
% 1.67/2.05 ----- EQP 0.9e, May 2009 -----
% 1.67/2.05 The job began on n032.cluster.edu, Wed Jun 29 15:23:59 2022
% 1.67/2.05 The command was "./eqp09e".
% 1.67/2.05
% 1.67/2.05 set(prolog_style_variables).
% 1.67/2.05 set(lrpo).
% 1.67/2.05 set(basic_paramod).
% 1.67/2.05 set(functional_subsume).
% 1.67/2.05 set(ordered_paramod).
% 1.67/2.05 set(prime_paramod).
% 1.67/2.05 set(para_pairs).
% 1.67/2.05 assign(pick_given_ratio,4).
% 1.67/2.05 clear(print_kept).
% 1.67/2.05 clear(print_new_demod).
% 1.67/2.05 clear(print_back_demod).
% 1.67/2.05 clear(print_given).
% 1.67/2.05 assign(max_mem,64000).
% 1.67/2.05 end_of_commands.
% 1.67/2.05
% 1.67/2.05 Usable:
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Sos:
% 1.67/2.05 0 (wt=-1) [] meet(A,A) = A.
% 1.67/2.05 0 (wt=-1) [] join(A,A) = A.
% 1.67/2.05 0 (wt=-1) [] meet(A,join(A,B)) = A.
% 1.67/2.05 0 (wt=-1) [] join(A,meet(A,B)) = A.
% 1.67/2.05 0 (wt=-1) [] meet(A,B) = meet(B,A).
% 1.67/2.05 0 (wt=-1) [] join(A,B) = join(B,A).
% 1.67/2.05 0 (wt=-1) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.67/2.05 0 (wt=-1) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.67/2.05 0 (wt=-1) [] join(A,meet(B,C)) = meet(join(A,B),join(A,C)).
% 1.67/2.05 0 (wt=-1) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 1.67/2.05 0 (wt=-1) [] f(join(A,B),C) = join(f(A,C),f(B,C)).
% 1.67/2.05 0 (wt=-1) [] f(n0,A) = n0.
% 1.67/2.05 0 (wt=-1) [] f(A,join(B,C)) = join(f(A,B),f(A,C)).
% 1.67/2.05 0 (wt=-1) [] f(A,n0) = n0.
% 1.67/2.05 0 (wt=-1) [] f(join(aa,bb),dd) = f(join(cc,bb),dd).
% 1.67/2.05 0 (wt=-1) [] meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)).
% 1.67/2.05 0 (wt=-1) [] -(f(aa,dd) = f(cc,dd)).
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Demodulators:
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Passive:
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Starting to process input.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 1 (wt=5) [] meet(A,A) = A.
% 1.67/2.05 1 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 2 (wt=5) [] join(A,A) = A.
% 1.67/2.05 2 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 3 (wt=7) [] meet(A,join(A,B)) = A.
% 1.67/2.05 3 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 4 (wt=7) [] join(A,meet(A,B)) = A.
% 1.67/2.05 4 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 5 (wt=7) [] meet(A,B) = meet(B,A).
% 1.67/2.05 clause forward subsumed: 0 (wt=7) [flip(5)] meet(B,A) = meet(A,B).
% 1.67/2.05
% 1.67/2.05 ** KEPT: 6 (wt=7) [] join(A,B) = join(B,A).
% 1.67/2.05 clause forward subsumed: 0 (wt=7) [flip(6)] join(B,A) = join(A,B).
% 1.67/2.05
% 1.67/2.05 ** KEPT: 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.67/2.05 7 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.67/2.05 8 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 9 (wt=13) [flip(1)] meet(join(A,B),join(A,C)) = join(A,meet(B,C)).
% 1.67/2.05 9 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 10 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 1.67/2.05 10 is a new demodulator.
% 1.67/2.05 -> 10 back demodulating 9.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 11 (wt=17) [back_demod(9),demod([10])] join(meet(join(A,B),A),meet(join(A,B),C)) = join(A,meet(B,C)).
% 1.67/2.05 11 is a new demodulator.
% 1.67/2.05 -> 10 back demodulating 3.
% 1.67/2.05 clause forward subsumed: 0 (wt=3) [back_demod(3),demod([10,1,4])] A = A.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 12 (wt=13) [flip(1)] join(f(A,B),f(C,B)) = f(join(A,C),B).
% 1.67/2.05 12 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 13 (wt=5) [] f(n0,A) = n0.
% 1.67/2.05 13 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 14 (wt=13) [flip(1)] join(f(A,B),f(A,C)) = f(A,join(B,C)).
% 1.67/2.05 14 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 15 (wt=5) [] f(A,n0) = n0.
% 1.67/2.05 15 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 16 (wt=11) [flip(1)] f(join(cc,bb),dd) = f(join(aa,bb),dd).
% 1.67/2.05 16 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 17 (wt=15) [flip(1)] meet(f(cc,dd),f(bb,dd)) = meet(f(aa,dd),f(bb,dd)).
% 1.67/2.05 17 is a new demodulator.
% 1.67/2.05
% 1.67/2.05 ** KEPT: 18 (wt=7) [flip(1)] -(f(cc,dd) = f(aa,dd)).
% 1.67/2.05 ---------------- PROOF FOUND ----------------
% 1.67/2.05 % SZS status Unsatisfiable
% 1.67/2.05
% 1.67/2.05
% 1.67/2.05 After processing input:
% 1.67/2.05
% 1.67/2.05 Usable:
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Sos:
% 1.67/2.05 1 (wt=5) [] meet(A,A) = A.
% 1.67/2.05 2 (wt=5) [] join(A,A) = A.
% 1.67/2.05 13 (wt=5) [] f(n0,A) = n0.
% 1.67/2.05 15 (wt=5) [] f(A,n0) = n0.
% 1.67/2.05 4 (wt=7) [] join(A,meet(A,B)) = A.
% 1.67/2.05 5 (wt=7) [] meet(A,B) = meet(B,A).
% 1.67/2.05 6 (wt=7) [] join(A,B) = join(B,A).
% 1.67/2.05 18 (wt=7) [flip(1)] -(f(cc,dd) = f(aa,dd)).
% 1.67/2.05 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.67/2.05 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.67/2.05 16 (wt=11) [flip(1)] f(join(cc,bb),dd) = f(join(aa,bb),dd).
% 1.67/2.05 10 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 1.67/2.05 12 (wt=13) [flip(1)] join(f(A,B),f(C,B)) = f(join(A,C),B).
% 1.67/2.05 14 (wt=13) [flip(1)] join(f(A,B),f(A,C)) = f(A,join(B,C)).
% 1.67/2.05 17 (wt=15) [flip(1)] meet(f(cc,dd),f(bb,dd)) = meet(f(aa,dd),f(bb,dd)).
% 1.67/2.05 11 (wt=17) [back_demod(9),demod([10])] join(meet(join(A,B),A),meet(join(A,B),C)) = join(A,meet(B,C)).
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Demodulators:
% 1.67/2.05 1 (wt=5) [] meet(A,A) = A.
% 1.67/2.05 2 (wt=5) [] join(A,A) = A.
% 1.67/2.05 4 (wt=7) [] join(A,meet(A,B)) = A.
% 1.67/2.05 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.67/2.05 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.67/2.05 10 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 1.67/2.05 11 (wt=17) [back_demod(9),demod([10])] join(meet(join(A,B),A),meet(join(A,B),C)) = join(A,meet(B,C)).
% 1.67/2.05 12 (wt=13) [flip(1)] join(f(A,B),f(C,B)) = f(join(A,C),B).
% 1.67/2.05 13 (wt=5) [] f(n0,A) = n0.
% 1.67/2.05 14 (wt=13) [flip(1)] join(f(A,B),f(A,C)) = f(A,join(B,C)).
% 1.67/2.05 15 (wt=5) [] f(A,n0) = n0.
% 1.67/2.05 16 (wt=11) [flip(1)] f(join(cc,bb),dd) = f(join(aa,bb),dd).
% 1.67/2.05 17 (wt=15) [flip(1)] meet(f(cc,dd),f(bb,dd)) = meet(f(aa,dd),f(bb,dd)).
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 Passive:
% 1.67/2.05 end_of_list.
% 1.67/2.05
% 1.67/2.05 UNIT CONFLICT from 6071 and 18 at 0.58 seconds.
% 1.67/2.05
% 1.67/2.05 ---------------- PROOF ----------------
% 1.67/2.05 % SZS output start Refutation
% See solution above
% 1.67/2.05 ------------ end of proof -------------
% 1.67/2.05
% 1.67/2.05
% 1.67/2.05 ------------- memory usage ------------
% 1.67/2.05 Memory dynamically allocated (tp_alloc): 9277.
% 1.67/2.05 type (bytes each) gets frees in use avail bytes
% 1.67/2.05 sym_ent ( 96) 62 0 62 0 5.8 K
% 1.67/2.05 term ( 16) 1074560 938305 136255 28 2638.1 K
% 1.67/2.05 gen_ptr ( 8) 766328 198567 567761 21 4435.8 K
% 1.67/2.05 context ( 808) 1059594 1059592 2 5 5.5 K
% 1.67/2.05 trail ( 12) 69173 69173 0 8 0.1 K
% 1.67/2.05 bt_node ( 68) 458148 458145 3 16 1.3 K
% 1.67/2.05 ac_position (285432) 0 0 0 0 0.0 K
% 1.67/2.05 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.67/2.05 ac_match_free_vars_pos (4020)
% 1.67/2.05 0 0 0 0 0.0 K
% 1.67/2.05 discrim ( 12) 78910 9804 69106 0 809.8 K
% 1.67/2.05 flat ( 40) 2209975 2209975 0 47 1.8 K
% 1.67/2.05 discrim_pos ( 12) 58737 58737 0 1 0.0 K
% 1.67/2.05 fpa_head ( 12) 10395 0 10395 0 121.8 K
% 1.67/2.05 fpa_tree ( 28) 12227 12227 0 25 0.7 K
% 1.67/2.05 fpa_pos ( 36) 9210 9210 0 1 0.0 K
% 1.67/2.05 literal ( 12) 50848 44777 6071 1 71.2 K
% 1.67/2.05 clause ( 24) 50848 44777 6071 1 142.3 K
% 1.67/2.05 list ( 12) 3198 3142 56 4 0.7 K
% 1.67/2.05 list_pos ( 20) 22988 3561 19427 0 379.4 K
% 1.67/2.05 pair_index ( 40) 2 0 2 0 0.1 K
% 1.67/2.05
% 1.67/2.05 -------------- statistics -------------
% 1.67/2.05 Clauses input 17
% 1.67/2.05 Usable input 0
% 1.67/2.05 Sos input 17
% 1.67/2.05 Demodulators input 0
% 1.67/2.05 Passive input 0
% 1.67/2.05
% 1.67/2.05 Processed BS (before search) 21
% 1.67/2.05 Forward subsumed BS 3
% 1.67/2.05 Kept BS 18
% 1.67/2.05 New demodulators BS 15
% 1.67/2.05 Back demodulated BS 2
% 1.67/2.05
% 1.67/2.05 Clauses or pairs given 64500
% 1.67/2.05 Clauses generated 34152
% 1.67/2.05 Forward subsumed 28099
% 1.67/2.05 Deleted by weight 0
% 1.67/2.05 Deleted by variable count 0
% 1.67/2.05 Kept 6053
% 1.67/2.05 New demodulators 3124
% 1.67/2.05 Back demodulated 808
% 1.67/2.05 Ordered paramod prunes 0
% 1.67/2.05 Basic paramod prunes 301192
% 1.67/2.05 Prime paramod prunes 1677
% 1.67/2.05 Semantic prunes 0
% 1.67/2.05
% 1.67/2.05 Rewrite attmepts 417981
% 1.67/2.05 Rewrites 49670
% 1.67/2.05
% 1.67/2.05 FPA overloads 0
% 1.67/2.05 FPA underloads 0
% 1.67/2.05
% 1.67/2.05 Usable size 0
% 1.67/2.05 Sos size 5260
% 1.67/2.05 Demodulators size 2837
% 1.67/2.05 Passive size 0
% 1.67/2.05 Disabled size 810
% 1.67/2.05
% 1.67/2.05 Proofs found 1
% 1.67/2.05
% 1.67/2.05 ----------- times (seconds) ----------- Wed Jun 29 15:24:00 2022
% 1.67/2.05
% 1.67/2.05 user CPU time 0.58 (0 hr, 0 min, 0 sec)
% 1.67/2.05 system CPU time 0.55 (0 hr, 0 min, 0 sec)
% 1.67/2.05 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/2.05 input time 0.00
% 1.67/2.05 paramodulation time 0.14
% 1.67/2.05 demodulation time 0.07
% 1.67/2.05 orient time 0.05
% 1.67/2.05 weigh time 0.01
% 1.67/2.05 forward subsume time 0.01
% 1.67/2.05 back demod find time 0.01
% 1.67/2.05 conflict time 0.00
% 1.67/2.05 LRPO time 0.03
% 1.67/2.05 store clause time 0.15
% 1.67/2.05 disable clause time 0.02
% 1.67/2.05 prime paramod time 0.03
% 1.67/2.05 semantics time 0.00
% 1.67/2.05
% 1.67/2.05 EQP interrupted
%------------------------------------------------------------------------------