TSTP Solution File: LAT008-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LAT008-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:14 EDT 2022
% Result : Unsatisfiable 0.70s 1.11s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 5 RR)
% Number of literals : 34 ( 0 equ; 4 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(meet(A,join(A,B)),A),
file('LAT008-1.p',unknown),
[] ).
cnf(2,plain,
equal(meet(A,join(B,C)),join(meet(C,A),meet(B,A))),
file('LAT008-1.p',unknown),
[] ).
cnf(3,plain,
equal(join(meet(A,B),meet(C,B)),meet(B,join(C,A))),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(join(a,meet(a,b)),a),
file('LAT008-1.p',unknown),
[] ).
cnf(5,plain,
equal(join(meet(A,B),meet(B,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
[iquote('para(1,2),flip(1)')] ).
cnf(6,plain,
equal(join(A,meet(join(A,B),join(A,B))),join(A,B)),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(7,plain,
equal(meet(meet(A,B),B),meet(A,B)),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(8,plain,
equal(meet(meet(A,B),meet(B,join(C,A))),meet(A,B)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(25,plain,
equal(join(A,join(meet(B,join(A,B)),A)),join(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,6]),1]),
[iquote('para(2,6),demod([1])')] ).
cnf(26,plain,
equal(join(A,join(A,A)),join(A,A)),
inference(para,[status(thm),theory(equality)],[1,25]),
[iquote('para(1,25)')] ).
cnf(27,plain,
equal(join(meet(A,A),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,26]),5]),
[iquote('para(5,26),demod([5])')] ).
cnf(29,plain,
equal(meet(A,B),join(meet(B,A),meet(meet(B,B),A))),
inference(para,[status(thm),theory(equality)],[27,2]),
[iquote('para(27,2)')] ).
cnf(30,plain,
equal(join(meet(A,B),meet(meet(A,A),B)),meet(B,A)),
inference(flip,[status(thm),theory(equality)],[29]),
[iquote('flip(29)')] ).
cnf(35,plain,
equal(meet(meet(A,B),meet(B,A)),meet(A,B)),
inference(para,[status(thm),theory(equality)],[27,8]),
[iquote('para(27,8)')] ).
cnf(39,plain,
~ equal(join(a,join(meet(b,a),meet(meet(b,b),a))),a),
inference(para,[status(thm),theory(equality)],[29,4]),
[iquote('para(29,4)')] ).
cnf(73,plain,
equal(join(join(meet(A,B),meet(meet(A,A),B)),meet(A,A)),A),
inference(para,[status(thm),theory(equality)],[29,5]),
[iquote('para(29,5)')] ).
cnf(74,plain,
equal(join(meet(A,B),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,5]),7,5]),
[iquote('para(29,5),demod([7,5])')] ).
cnf(83,plain,
equal(join(meet(A,B),meet(B,A)),meet(B,A)),
inference(para,[status(thm),theory(equality)],[35,74]),
[iquote('para(35,74)')] ).
cnf(84,plain,
equal(meet(A,A),A),
inference(para,[status(thm),theory(equality)],[83,5]),
[iquote('para(83,5)')] ).
cnf(85,plain,
equal(join(join(meet(A,B),meet(A,B)),A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),84,84]),
[iquote('back_demod(73),demod([84,84])')] ).
cnf(94,plain,
~ equal(join(a,join(meet(b,a),meet(b,a))),a),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[39]),84]),
[iquote('back_demod(39),demod([84])')] ).
cnf(95,plain,
equal(join(meet(A,B),meet(A,B)),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),84]),
[iquote('back_demod(30),demod([84])')] ).
cnf(96,plain,
equal(meet(A,B),join(meet(B,A),meet(B,A))),
inference(flip,[status(thm),theory(equality)],[95]),
[iquote('flip(95)')] ).
cnf(102,plain,
equal(join(A,A),A),
inference(para,[status(thm),theory(equality)],[84,74]),
[iquote('para(84,74)')] ).
cnf(103,plain,
equal(meet(A,B),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[96]),102]),
[iquote('back_demod(96),demod([102])')] ).
cnf(104,plain,
~ equal(join(a,meet(b,a)),a),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[94]),102]),
[iquote('back_demod(94),demod([102])')] ).
cnf(107,plain,
equal(join(meet(A,B),A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[85]),102]),
[iquote('back_demod(85),demod([102])')] ).
cnf(118,plain,
equal(meet(meet(A,B),A),meet(A,B)),
inference(para,[status(thm),theory(equality)],[107,1]),
[iquote('para(107,1)')] ).
cnf(149,plain,
equal(meet(A,meet(A,B)),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[118,103]),1]),
[iquote('para(118,103),flip(1)')] ).
cnf(163,plain,
equal(join(A,meet(B,A)),meet(A,join(B,A))),
inference(para,[status(thm),theory(equality)],[84,3]),
[iquote('para(84,3)')] ).
cnf(164,plain,
equal(meet(A,join(B,A)),join(A,meet(B,A))),
inference(flip,[status(thm),theory(equality)],[163]),
[iquote('flip(163)')] ).
cnf(165,plain,
equal(meet(A,join(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[163,1]),149]),
[iquote('para(163,1),demod([149])')] ).
cnf(166,plain,
equal(join(A,meet(B,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[164]),165]),1]),
[iquote('back_demod(164),demod([165]),flip(1)')] ).
cnf(167,plain,
$false,
inference(conflict,[status(thm)],[166,104]),
[iquote('conflict(166,104)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT008-1 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n019.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 : Thu Jun 30 06:23:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.11 ----- EQP 0.9e, May 2009 -----
% 0.70/1.11 The job began on n019.cluster.edu, Thu Jun 30 06:23:54 2022
% 0.70/1.11 The command was "./eqp09e".
% 0.70/1.11
% 0.70/1.11 set(prolog_style_variables).
% 0.70/1.11 set(lrpo).
% 0.70/1.11 set(basic_paramod).
% 0.70/1.11 set(functional_subsume).
% 0.70/1.11 set(ordered_paramod).
% 0.70/1.11 set(prime_paramod).
% 0.70/1.11 set(para_pairs).
% 0.70/1.11 assign(pick_given_ratio,4).
% 0.70/1.11 clear(print_kept).
% 0.70/1.11 clear(print_new_demod).
% 0.70/1.11 clear(print_back_demod).
% 0.70/1.11 clear(print_given).
% 0.70/1.11 assign(max_mem,64000).
% 0.70/1.11 end_of_commands.
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 0 (wt=-1) [] meet(A,join(A,B)) = A.
% 0.70/1.11 0 (wt=-1) [] meet(A,join(B,C)) = join(meet(C,A),meet(B,A)).
% 0.70/1.11 0 (wt=-1) [] -(join(a,meet(a,b)) = a).
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Starting to process input.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 1 (wt=7) [] meet(A,join(A,B)) = A.
% 0.70/1.11 1 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 2 (wt=13) [] meet(A,join(B,C)) = join(meet(C,A),meet(B,A)).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 3 (wt=13) [flip(2)] join(meet(A,B),meet(C,B)) = meet(B,join(C,A)).
% 0.70/1.11 clause forward subsumed: 0 (wt=13) [flip(3)] meet(B,join(C,A)) = join(meet(A,B),meet(C,B)).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 4 (wt=7) [] -(join(a,meet(a,b)) = a).
% 0.70/1.11 ---------------- PROOF FOUND ----------------
% 0.70/1.11 % SZS status Unsatisfiable
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 After processing input:
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 1 (wt=7) [] meet(A,join(A,B)) = A.
% 0.70/1.11 4 (wt=7) [] -(join(a,meet(a,b)) = a).
% 0.70/1.11 2 (wt=13) [] meet(A,join(B,C)) = join(meet(C,A),meet(B,A)).
% 0.70/1.11 3 (wt=13) [flip(2)] join(meet(A,B),meet(C,B)) = meet(B,join(C,A)).
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 1 (wt=7) [] meet(A,join(A,B)) = A.
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 UNIT CONFLICT from 166 and 104 at 0.01 seconds.
% 0.70/1.11
% 0.70/1.11 ---------------- PROOF ----------------
% 0.70/1.11 % SZS output start Refutation
% See solution above
% 0.70/1.11 ------------ end of proof -------------
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 ------------- memory usage ------------
% 0.70/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.11 type (bytes each) gets frees in use avail bytes
% 0.70/1.11 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.70/1.11 term ( 16) 9038 5832 3206 16 62.3 K
% 0.70/1.11 gen_ptr ( 8) 14406 2495 11911 33 93.3 K
% 0.70/1.11 context ( 808) 5557 5555 2 2 3.2 K
% 0.70/1.11 trail ( 12) 1954 1954 0 5 0.1 K
% 0.70/1.11 bt_node ( 68) 1571 1568 3 10 0.9 K
% 0.70/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.11 ac_match_free_vars_pos (4020)
% 0.70/1.11 0 0 0 0 0.0 K
% 0.70/1.11 discrim ( 12) 2463 902 1561 5 18.4 K
% 0.70/1.11 flat ( 40) 18310 18310 0 39 1.5 K
% 0.70/1.11 discrim_pos ( 12) 284 284 0 1 0.0 K
% 0.70/1.11 fpa_head ( 12) 839 0 839 0 9.8 K
% 0.70/1.11 fpa_tree ( 28) 203 203 0 17 0.5 K
% 0.70/1.11 fpa_pos ( 36) 222 222 0 1 0.0 K
% 0.70/1.11 literal ( 12) 627 461 166 1 2.0 K
% 0.70/1.11 clause ( 24) 627 461 166 1 3.9 K
% 0.70/1.11 list ( 12) 115 58 57 2 0.7 K
% 0.70/1.11 list_pos ( 20) 709 312 397 3 7.8 K
% 0.70/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.11
% 0.70/1.11 -------------- statistics -------------
% 0.70/1.11 Clauses input 3
% 0.70/1.11 Usable input 0
% 0.70/1.11 Sos input 3
% 0.70/1.11 Demodulators input 0
% 0.70/1.11 Passive input 0
% 0.70/1.11
% 0.70/1.11 Processed BS (before search) 5
% 0.70/1.11 Forward subsumed BS 1
% 0.70/1.11 Kept BS 4
% 0.70/1.11 New demodulators BS 1
% 0.70/1.11 Back demodulated BS 0
% 0.70/1.11
% 0.70/1.11 Clauses or pairs given 254
% 0.70/1.11 Clauses generated 351
% 0.70/1.11 Forward subsumed 189
% 0.70/1.11 Deleted by weight 0
% 0.70/1.11 Deleted by variable count 0
% 0.70/1.11 Kept 162
% 0.70/1.11 New demodulators 55
% 0.70/1.11 Back demodulated 70
% 0.70/1.11 Ordered paramod prunes 0
% 0.70/1.11 Basic paramod prunes 279
% 0.70/1.11 Prime paramod prunes 1
% 0.70/1.11 Semantic prunes 0
% 0.70/1.11
% 0.70/1.11 Rewrite attmepts 3179
% 0.70/1.11 Rewrites 195
% 0.70/1.11
% 0.70/1.11 FPA overloads 0
% 0.70/1.11 FPA underloads 0
% 0.70/1.11
% 0.70/1.11 Usable size 0
% 0.70/1.11 Sos size 95
% 0.70/1.11 Demodulators size 29
% 0.70/1.11 Passive size 0
% 0.70/1.11 Disabled size 70
% 0.70/1.11
% 0.70/1.11 Proofs found 1
% 0.70/1.11
% 0.70/1.11 ----------- times (seconds) ----------- Thu Jun 30 06:23:54 2022
% 0.70/1.11
% 0.70/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.11 input time 0.00
% 0.70/1.11 paramodulation time 0.00
% 0.70/1.11 demodulation time 0.00
% 0.70/1.11 orient time 0.00
% 0.70/1.11 weigh time 0.00
% 0.70/1.11 forward subsume time 0.00
% 0.70/1.11 back demod find time 0.00
% 0.70/1.11 conflict time 0.00
% 0.70/1.11 LRPO time 0.00
% 0.70/1.11 store clause time 0.00
% 0.70/1.11 disable clause time 0.00
% 0.70/1.11 prime paramod time 0.00
% 0.70/1.11 semantics time 0.00
% 0.70/1.11
% 0.70/1.11 EQP interrupted
%------------------------------------------------------------------------------