TSTP Solution File: LAT040-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LAT040-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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:24 EDT 2022
% Result : Unsatisfiable 0.69s 1.14s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 12 RR)
% Number of literals : 27 ( 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; 3 con; 0-2 aty)
% Number of variables : 28 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(meet(A,A),A),
file('LAT040-1.p',unknown),
[] ).
cnf(4,plain,
equal(join(A,meet(A,B)),A),
file('LAT040-1.p',unknown),
[] ).
cnf(5,plain,
equal(meet(A,B),meet(B,A)),
file('LAT040-1.p',unknown),
[] ).
cnf(6,plain,
equal(join(A,B),join(B,A)),
file('LAT040-1.p',unknown),
[] ).
cnf(7,plain,
equal(meet(meet(A,B),C),meet(A,meet(B,C))),
file('LAT040-1.p',unknown),
[] ).
cnf(10,plain,
equal(meet(A,join(B,C)),join(meet(A,B),meet(A,C))),
file('LAT040-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(xx,zz),join(xx,yy)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(13,plain,
equal(meet(xx,zz),meet(xx,yy)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
~ equal(zz,yy),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(join(A,meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[5,4]),
[iquote('para(5,4)')] ).
cnf(16,plain,
equal(join(meet(A,B),A),A),
inference(para,[status(thm),theory(equality)],[6,4]),
[iquote('para(6,4)')] ).
cnf(18,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(19,plain,
equal(join(zz,xx),join(xx,yy)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,6]),1]),
[iquote('para(12,6),flip(1)')] ).
cnf(21,plain,
equal(meet(zz,xx),meet(xx,yy)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),1]),
[iquote('para(13,5),flip(1)')] ).
cnf(25,plain,
equal(join(meet(A,B),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,6]),1]),
[iquote('para(15,6),flip(1)')] ).
cnf(43,plain,
equal(join(meet(A,xx),meet(A,zz)),join(meet(A,xx),meet(A,yy))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,10]),10]),1]),
[iquote('para(12,10),demod([10]),flip(1)')] ).
cnf(46,plain,
equal(join(A,meet(B,meet(C,A))),A),
inference(para,[status(thm),theory(equality)],[7,15]),
[iquote('para(7,15)')] ).
cnf(55,plain,
equal(meet(zz,meet(xx,yy)),meet(xx,yy)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,18]),21]),
[iquote('para(21,18),demod([21])')] ).
cnf(57,plain,
equal(join(meet(A,zz),meet(A,xx)),join(meet(A,xx),meet(A,yy))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,10]),10]),1]),
[iquote('para(19,10),demod([10]),flip(1)')] ).
cnf(65,plain,
equal(meet(xx,meet(yy,zz)),meet(xx,yy)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[55,5]),7]),1]),
[iquote('para(55,5),demod([7]),flip(1)')] ).
cnf(86,plain,
equal(join(meet(yy,zz),meet(xx,yy)),meet(yy,zz)),
inference(para,[status(thm),theory(equality)],[65,15]),
[iquote('para(65,15)')] ).
cnf(222,plain,
equal(meet(yy,zz),yy),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,86]),57,1,16]),1]),
[iquote('para(5,86),demod([57,1,16]),flip(1)')] ).
cnf(223,plain,
equal(meet(zz,yy),yy),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[222,5]),1]),
[iquote('para(222,5),flip(1)')] ).
cnf(238,plain,
equal(join(zz,meet(A,yy)),zz),
inference(para,[status(thm),theory(equality)],[222,46]),
[iquote('para(222,46)')] ).
cnf(251,plain,
equal(join(meet(A,yy),zz),zz),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[238,6]),1]),
[iquote('para(238,6),flip(1)')] ).
cnf(326,plain,
equal(zz,yy),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,43]),21,251,21,223,25]),
[iquote('para(1,43),demod([21,251,21,223,25])')] ).
cnf(327,plain,
$false,
inference(conflict,[status(thm)],[326,14]),
[iquote('conflict(326,14)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 29 17:43:13 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.69/1.14 ----- EQP 0.9e, May 2009 -----
% 0.69/1.14 The job began on n028.cluster.edu, Wed Jun 29 17:43:14 2022
% 0.69/1.14 The command was "./eqp09e".
% 0.69/1.14
% 0.69/1.14 set(prolog_style_variables).
% 0.69/1.14 set(lrpo).
% 0.69/1.14 set(basic_paramod).
% 0.69/1.14 set(functional_subsume).
% 0.69/1.14 set(ordered_paramod).
% 0.69/1.14 set(prime_paramod).
% 0.69/1.14 set(para_pairs).
% 0.69/1.14 assign(pick_given_ratio,4).
% 0.69/1.14 clear(print_kept).
% 0.69/1.14 clear(print_new_demod).
% 0.69/1.14 clear(print_back_demod).
% 0.69/1.14 clear(print_given).
% 0.69/1.14 assign(max_mem,64000).
% 0.69/1.14 end_of_commands.
% 0.69/1.14
% 0.69/1.14 Usable:
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Sos:
% 0.69/1.14 0 (wt=-1) [] meet(A,A) = A.
% 0.69/1.14 0 (wt=-1) [] join(A,A) = A.
% 0.69/1.14 0 (wt=-1) [] meet(A,join(A,B)) = A.
% 0.69/1.14 0 (wt=-1) [] join(A,meet(A,B)) = A.
% 0.69/1.14 0 (wt=-1) [] meet(A,B) = meet(B,A).
% 0.69/1.14 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.69/1.14 0 (wt=-1) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.69/1.14 0 (wt=-1) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.69/1.14 0 (wt=-1) [] join(A,meet(B,C)) = meet(join(A,B),join(A,C)).
% 0.69/1.14 0 (wt=-1) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.69/1.14 0 (wt=-1) [] join(xx,yy) = join(xx,zz).
% 0.69/1.14 0 (wt=-1) [] meet(xx,yy) = meet(xx,zz).
% 0.69/1.14 0 (wt=-1) [] -(yy = zz).
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Demodulators:
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Passive:
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Starting to process input.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 1 (wt=5) [] meet(A,A) = A.
% 0.69/1.14 1 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 2 (wt=5) [] join(A,A) = A.
% 0.69/1.14 2 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 3 (wt=7) [] meet(A,join(A,B)) = A.
% 0.69/1.14 3 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 4 (wt=7) [] join(A,meet(A,B)) = A.
% 0.69/1.14 4 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 5 (wt=7) [] meet(A,B) = meet(B,A).
% 0.69/1.14 clause forward subsumed: 0 (wt=7) [flip(5)] meet(B,A) = meet(A,B).
% 0.69/1.14
% 0.69/1.14 ** KEPT: 6 (wt=7) [] join(A,B) = join(B,A).
% 0.69/1.14 clause forward subsumed: 0 (wt=7) [flip(6)] join(B,A) = join(A,B).
% 0.69/1.14
% 0.69/1.14 ** KEPT: 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.69/1.14 7 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.69/1.14 8 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 9 (wt=13) [flip(1)] meet(join(A,B),join(A,C)) = join(A,meet(B,C)).
% 0.69/1.14 9 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 10 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.69/1.14 10 is a new demodulator.
% 0.69/1.14 -> 10 back demodulating 9.
% 0.69/1.14
% 0.69/1.14 ** 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)).
% 0.69/1.14 11 is a new demodulator.
% 0.69/1.14 -> 10 back demodulating 3.
% 0.69/1.14 clause forward subsumed: 0 (wt=3) [back_demod(3),demod([10,1,4])] A = A.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 12 (wt=7) [flip(1)] join(xx,zz) = join(xx,yy).
% 0.69/1.14 12 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 13 (wt=7) [flip(1)] meet(xx,zz) = meet(xx,yy).
% 0.69/1.14 13 is a new demodulator.
% 0.69/1.14
% 0.69/1.14 ** KEPT: 14 (wt=3) [flip(1)] -(zz = yy).
% 0.69/1.14 ---------------- PROOF FOUND ----------------
% 0.69/1.14 % SZS status Unsatisfiable
% 0.69/1.14
% 0.69/1.14
% 0.69/1.14 After processing input:
% 0.69/1.14
% 0.69/1.14 Usable:
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Sos:
% 0.69/1.14 14 (wt=3) [flip(1)] -(zz = yy).
% 0.69/1.14 1 (wt=5) [] meet(A,A) = A.
% 0.69/1.14 2 (wt=5) [] join(A,A) = A.
% 0.69/1.14 4 (wt=7) [] join(A,meet(A,B)) = A.
% 0.69/1.14 5 (wt=7) [] meet(A,B) = meet(B,A).
% 0.69/1.14 6 (wt=7) [] join(A,B) = join(B,A).
% 0.69/1.14 12 (wt=7) [flip(1)] join(xx,zz) = join(xx,yy).
% 0.69/1.14 13 (wt=7) [flip(1)] meet(xx,zz) = meet(xx,yy).
% 0.69/1.14 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.69/1.14 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.69/1.14 10 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.69/1.14 11 (wt=17) [back_demod(9),demod([10])] join(meet(join(A,B),A),meet(join(A,B),C)) = join(A,meet(B,C)).
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Demodulators:
% 0.69/1.14 1 (wt=5) [] meet(A,A) = A.
% 0.69/1.14 2 (wt=5) [] join(A,A) = A.
% 0.69/1.14 4 (wt=7) [] join(A,meet(A,B)) = A.
% 0.69/1.14 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.69/1.14 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.69/1.14 10 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.69/1.14 11 (wt=17) [back_demod(9),demod([10])] join(meet(join(A,B),A),meet(join(A,B),C)) = join(A,meet(B,C)).
% 0.69/1.14 12 (wt=7) [flip(1)] join(xx,zz) = join(xx,yy).
% 0.69/1.14 13 (wt=7) [flip(1)] meet(xx,zz) = meet(xx,yy).
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 Passive:
% 0.69/1.14 end_of_list.
% 0.69/1.14
% 0.69/1.14 UNIT CONFLICT from 326 and 14 at 0.02 seconds.
% 0.69/1.14
% 0.69/1.14 ---------------- PROOF ----------------
% 0.69/1.14 % SZS output start Refutation
% See solution above
% 0.69/1.14 ------------ end of proof -------------
% 0.69/1.14
% 0.69/1.14
% 0.69/1.14 ------------- memory usage ------------
% 0.69/1.14 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.14 type (bytes each) gets frees in use avail bytes
% 0.69/1.14 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.69/1.14 term ( 16) 25364 20718 4646 16 89.8 K
% 0.69/1.14 gen_ptr ( 8) 22909 6436 16473 26 128.9 K
% 0.69/1.14 context ( 808) 24466 24464 2 4 4.7 K
% 0.69/1.14 trail ( 12) 1534 1534 0 5 0.1 K
% 0.69/1.14 bt_node ( 68) 10647 10644 3 6 0.6 K
% 0.69/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.14 ac_match_free_vars_pos (4020)
% 0.69/1.14 0 0 0 0 0.0 K
% 0.69/1.14 discrim ( 12) 3078 721 2357 0 27.6 K
% 0.69/1.14 flat ( 40) 45480 45480 0 31 1.2 K
% 0.69/1.14 discrim_pos ( 12) 1467 1467 0 1 0.0 K
% 0.69/1.14 fpa_head ( 12) 659 0 659 0 7.7 K
% 0.69/1.14 fpa_tree ( 28) 561 561 0 7 0.2 K
% 0.69/1.14 fpa_pos ( 36) 516 516 0 1 0.0 K
% 0.69/1.14 literal ( 12) 1874 1548 326 1 3.8 K
% 0.69/1.14 clause ( 24) 1874 1548 326 1 7.7 K
% 0.69/1.14 list ( 12) 249 193 56 4 0.7 K
% 0.69/1.14 list_pos ( 20) 1346 397 949 2 18.6 K
% 0.69/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.14
% 0.69/1.14 -------------- statistics -------------
% 0.69/1.14 Clauses input 13
% 0.69/1.14 Usable input 0
% 0.69/1.14 Sos input 13
% 0.69/1.14 Demodulators input 0
% 0.69/1.14 Passive input 0
% 0.69/1.14
% 0.69/1.14 Processed BS (before search) 17
% 0.69/1.14 Forward subsumed BS 3
% 0.69/1.14 Kept BS 14
% 0.69/1.14 New demodulators BS 11
% 0.69/1.14 Back demodulated BS 2
% 0.69/1.14
% 0.69/1.14 Clauses or pairs given 2045
% 0.69/1.14 Clauses generated 1116
% 0.69/1.14 Forward subsumed 804
% 0.69/1.14 Deleted by weight 0
% 0.69/1.14 Deleted by variable count 0
% 0.69/1.14 Kept 312
% 0.69/1.14 New demodulators 179
% 0.69/1.14 Back demodulated 82
% 0.69/1.14 Ordered paramod prunes 0
% 0.69/1.14 Basic paramod prunes 5149
% 0.69/1.14 Prime paramod prunes 19
% 0.69/1.14 Semantic prunes 0
% 0.69/1.14
% 0.69/1.14 Rewrite attmepts 9710
% 0.69/1.14 Rewrites 1231
% 0.69/1.14
% 0.69/1.14 FPA overloads 0
% 0.69/1.14 FPA underloads 0
% 0.69/1.14
% 0.69/1.14 Usable size 0
% 0.69/1.14 Sos size 241
% 0.69/1.14 Demodulators size 142
% 0.69/1.14 Passive size 0
% 0.69/1.14 Disabled size 84
% 0.69/1.14
% 0.69/1.14 Proofs found 1
% 0.69/1.14
% 0.69/1.14 ----------- times (seconds) ----------- Wed Jun 29 17:43:14 2022
% 0.69/1.14
% 0.69/1.14 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.69/1.14 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.69/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.14 input time 0.00
% 0.69/1.14 paramodulation time 0.00
% 0.69/1.14 demodulation time 0.00
% 0.69/1.14 orient time 0.00
% 0.69/1.14 weigh time 0.00
% 0.69/1.14 forward subsume time 0.00
% 0.69/1.14 back demod find time 0.00
% 0.69/1.14 conflict time 0.00
% 0.69/1.14 LRPO time 0.00
% 0.69/1.14 store clause time 0.00
% 0.69/1.14 disable clause time 0.00
% 0.69/1.14 prime paramod time 0.00
% 0.69/1.14 semantics time 0.00
% 0.69/1.14
% 0.69/1.14 EQP interrupted
%------------------------------------------------------------------------------