TSTP Solution File: LAT012-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n004.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:15 EDT 2022
% Result : Unsatisfiable 0.88s 1.26s
% Output : Refutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 2 RR)
% Number of literals : 30 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,meet(B,meet(A,C))),A),
file('LAT012-1.p',unknown),
[] ).
cnf(2,plain,
equal(meet(A,join(B,join(A,C))),A),
file('LAT012-1.p',unknown),
[] ).
cnf(3,plain,
equal(join(join(meet(A,B),meet(B,C)),B),B),
file('LAT012-1.p',unknown),
[] ).
cnf(4,plain,
equal(meet(meet(join(A,B),join(B,C)),B),B),
file('LAT012-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(meet(b,a),meet(a,b)),
file('LAT012-1.p',unknown),
[] ).
cnf(6,plain,
equal(join(A,meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(7,plain,
equal(meet(A,join(B,A)),A),
inference(para,[status(thm),theory(equality)],[1,2]),
[iquote('para(1,2)')] ).
cnf(8,plain,
equal(join(join(A,B),B),join(A,B)),
inference(para,[status(thm),theory(equality)],[7,6]),
[iquote('para(7,6)')] ).
cnf(9,plain,
equal(meet(meet(A,B),B),meet(A,B)),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(11,plain,
equal(join(meet(A,B),B),B),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(12,plain,
equal(meet(A,A),A),
inference(para,[status(thm),theory(equality)],[11,7]),
[iquote('para(11,7)')] ).
cnf(14,plain,
equal(meet(A,join(A,B)),A),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(16,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),11]),
[iquote('para(2,3),demod([11])')] ).
cnf(18,plain,
equal(join(A,meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(20,plain,
equal(meet(join(A,B),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),9]),
[iquote('para(1,4),demod([9])')] ).
cnf(23,plain,
equal(join(join(A,B),A),join(A,B)),
inference(para,[status(thm),theory(equality)],[14,6]),
[iquote('para(14,6)')] ).
cnf(24,plain,
equal(meet(meet(A,B),A),meet(A,B)),
inference(para,[status(thm),theory(equality)],[18,7]),
[iquote('para(18,7)')] ).
cnf(27,plain,
equal(meet(meet(A,join(meet(B,A),C)),meet(B,A)),meet(B,A)),
inference(para,[status(thm),theory(equality)],[6,4]),
[iquote('para(6,4)')] ).
cnf(29,plain,
equal(join(join(A,meet(join(B,A),C)),join(B,A)),join(B,A)),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(33,plain,
equal(meet(join(A,B),A),A),
inference(para,[status(thm),theory(equality)],[23,20]),
[iquote('para(23,20)')] ).
cnf(86,plain,
equal(join(join(meet(A,B),meet(A,C)),A),A),
inference(para,[status(thm),theory(equality)],[24,3]),
[iquote('para(24,3)')] ).
cnf(87,plain,
equal(join(meet(A,B),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,86]),8]),
[iquote('para(12,86),demod([8])')] ).
cnf(231,plain,
equal(join(join(A,B),join(B,A)),join(B,A)),
inference(para,[status(thm),theory(equality)],[33,29]),
[iquote('para(33,29)')] ).
cnf(267,plain,
equal(meet(join(A,B),join(C,join(B,A))),join(A,B)),
inference(para,[status(thm),theory(equality)],[231,2]),
[iquote('para(231,2)')] ).
cnf(268,plain,
equal(meet(join(A,B),join(B,A)),join(A,B)),
inference(para,[status(thm),theory(equality)],[16,267]),
[iquote('para(16,267)')] ).
cnf(269,plain,
equal(join(A,B),join(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[268,6]),231]),
[iquote('para(268,6),demod([231])')] ).
cnf(1001,plain,
equal(meet(meet(A,B),meet(B,A)),meet(B,A)),
inference(para,[status(thm),theory(equality)],[87,27]),
[iquote('para(87,27)')] ).
cnf(1003,plain,
equal(join(meet(A,B),meet(B,A)),meet(B,A)),
inference(para,[status(thm),theory(equality)],[1001,87]),
[iquote('para(1001,87)')] ).
cnf(1004,plain,
equal(meet(A,B),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1003,269]),1003]),
[iquote('para(1003,269),demod([1003])')] ).
cnf(1005,plain,
$false,
inference(conflict,[status(thm)],[1004,5]),
[iquote('conflict(1004,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n004.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 13:28:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.88/1.26 ----- EQP 0.9e, May 2009 -----
% 0.88/1.26 The job began on n004.cluster.edu, Wed Jun 29 13:28:24 2022
% 0.88/1.26 The command was "./eqp09e".
% 0.88/1.26
% 0.88/1.26 set(prolog_style_variables).
% 0.88/1.26 set(lrpo).
% 0.88/1.26 set(basic_paramod).
% 0.88/1.26 set(functional_subsume).
% 0.88/1.26 set(ordered_paramod).
% 0.88/1.26 set(prime_paramod).
% 0.88/1.26 set(para_pairs).
% 0.88/1.26 assign(pick_given_ratio,4).
% 0.88/1.26 clear(print_kept).
% 0.88/1.26 clear(print_new_demod).
% 0.88/1.26 clear(print_back_demod).
% 0.88/1.26 clear(print_given).
% 0.88/1.26 assign(max_mem,64000).
% 0.88/1.26 end_of_commands.
% 0.88/1.26
% 0.88/1.26 Usable:
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Sos:
% 0.88/1.26 0 (wt=-1) [] join(A,meet(B,meet(A,C))) = A.
% 0.88/1.26 0 (wt=-1) [] meet(A,join(B,join(A,C))) = A.
% 0.88/1.26 0 (wt=-1) [] join(join(meet(A,B),meet(B,C)),B) = B.
% 0.88/1.26 0 (wt=-1) [] meet(meet(join(A,B),join(B,C)),B) = B.
% 0.88/1.26 0 (wt=-1) [] -(meet(b,a) = meet(a,b)).
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Demodulators:
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Passive:
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Starting to process input.
% 0.88/1.26
% 0.88/1.26 ** KEPT: 1 (wt=9) [] join(A,meet(B,meet(A,C))) = A.
% 0.88/1.26 1 is a new demodulator.
% 0.88/1.26
% 0.88/1.26 ** KEPT: 2 (wt=9) [] meet(A,join(B,join(A,C))) = A.
% 0.88/1.26 2 is a new demodulator.
% 0.88/1.26
% 0.88/1.26 ** KEPT: 3 (wt=11) [] join(join(meet(A,B),meet(B,C)),B) = B.
% 0.88/1.26 3 is a new demodulator.
% 0.88/1.26
% 0.88/1.26 ** KEPT: 4 (wt=11) [] meet(meet(join(A,B),join(B,C)),B) = B.
% 0.88/1.26 4 is a new demodulator.
% 0.88/1.26
% 0.88/1.26 ** KEPT: 5 (wt=7) [] -(meet(b,a) = meet(a,b)).
% 0.88/1.26 ---------------- PROOF FOUND ----------------
% 0.88/1.26 % SZS status Unsatisfiable
% 0.88/1.26
% 0.88/1.26
% 0.88/1.26 After processing input:
% 0.88/1.26
% 0.88/1.26 Usable:
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Sos:
% 0.88/1.26 5 (wt=7) [] -(meet(b,a) = meet(a,b)).
% 0.88/1.26 1 (wt=9) [] join(A,meet(B,meet(A,C))) = A.
% 0.88/1.26 2 (wt=9) [] meet(A,join(B,join(A,C))) = A.
% 0.88/1.26 3 (wt=11) [] join(join(meet(A,B),meet(B,C)),B) = B.
% 0.88/1.26 4 (wt=11) [] meet(meet(join(A,B),join(B,C)),B) = B.
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Demodulators:
% 0.88/1.26 1 (wt=9) [] join(A,meet(B,meet(A,C))) = A.
% 0.88/1.26 2 (wt=9) [] meet(A,join(B,join(A,C))) = A.
% 0.88/1.26 3 (wt=11) [] join(join(meet(A,B),meet(B,C)),B) = B.
% 0.88/1.26 4 (wt=11) [] meet(meet(join(A,B),join(B,C)),B) = B.
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 Passive:
% 0.88/1.26 end_of_list.
% 0.88/1.26
% 0.88/1.26 UNIT CONFLICT from 1004 and 5 at 0.07 seconds.
% 0.88/1.26
% 0.88/1.26 ---------------- PROOF ----------------
% 0.88/1.26 % SZS output start Refutation
% See solution above
% 0.88/1.26 ------------ end of proof -------------
% 0.88/1.26
% 0.88/1.26
% 0.88/1.26 ------------- memory usage ------------
% 0.88/1.26 Memory dynamically allocated (tp_alloc): 1953.
% 0.88/1.26 type (bytes each) gets frees in use avail bytes
% 0.88/1.26 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.88/1.26 term ( 16) 124480 104420 20060 17 388.2 K
% 0.88/1.26 gen_ptr ( 8) 101158 21733 79425 29 620.7 K
% 0.88/1.26 context ( 808) 93346 93344 2 2 3.2 K
% 0.88/1.26 trail ( 12) 13741 13741 0 8 0.1 K
% 0.88/1.26 bt_node ( 68) 52053 52050 3 24 1.8 K
% 0.88/1.26 ac_position (285432) 0 0 0 0 0.0 K
% 0.88/1.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.88/1.26 ac_match_free_vars_pos (4020)
% 0.88/1.26 0 0 0 0 0.0 K
% 0.88/1.26 discrim ( 12) 17686 0 17686 0 207.3 K
% 0.88/1.26 flat ( 40) 209149 209149 0 31 1.2 K
% 0.88/1.26 discrim_pos ( 12) 4142 4142 0 1 0.0 K
% 0.88/1.26 fpa_head ( 12) 3279 0 3279 0 38.4 K
% 0.88/1.26 fpa_tree ( 28) 3474 3474 0 13 0.4 K
% 0.88/1.26 fpa_pos ( 36) 2005 2005 0 1 0.0 K
% 0.88/1.26 literal ( 12) 5863 4859 1004 1 11.8 K
% 0.88/1.26 clause ( 24) 5863 4859 1004 1 23.6 K
% 0.88/1.26 list ( 12) 1060 1004 56 3 0.7 K
% 0.88/1.26 list_pos ( 20) 4015 5 4010 0 78.3 K
% 0.88/1.26 pair_index ( 40) 2 0 2 0 0.1 K
% 0.88/1.26
% 0.88/1.26 -------------- statistics -------------
% 0.88/1.26 Clauses input 5
% 0.88/1.26 Usable input 0
% 0.88/1.26 Sos input 5
% 0.88/1.26 Demodulators input 0
% 0.88/1.26 Passive input 0
% 0.88/1.26
% 0.88/1.26 Processed BS (before search) 5
% 0.88/1.26 Forward subsumed BS 0
% 0.88/1.26 Kept BS 5
% 0.88/1.26 New demodulators BS 4
% 0.88/1.26 Back demodulated BS 0
% 0.88/1.26
% 0.88/1.26 Clauses or pairs given 10971
% 0.88/1.26 Clauses generated 4810
% 0.88/1.26 Forward subsumed 3811
% 0.88/1.26 Deleted by weight 0
% 0.88/1.26 Deleted by variable count 0
% 0.88/1.26 Kept 999
% 0.88/1.26 New demodulators 997
% 0.88/1.26 Back demodulated 0
% 0.88/1.26 Ordered paramod prunes 0
% 0.88/1.26 Basic paramod prunes 45027
% 0.88/1.26 Prime paramod prunes 36
% 0.88/1.26 Semantic prunes 0
% 0.88/1.26
% 0.88/1.26 Rewrite attmepts 30336
% 0.88/1.26 Rewrites 4065
% 0.88/1.26
% 0.88/1.26 FPA overloads 0
% 0.88/1.26 FPA underloads 0
% 0.88/1.26
% 0.88/1.26 Usable size 0
% 0.88/1.26 Sos size 1003
% 0.88/1.26 Demodulators size 1001
% 0.88/1.26 Passive size 0
% 0.88/1.26 Disabled size 0
% 0.88/1.26
% 0.88/1.26 Proofs found 1
% 0.88/1.26
% 0.88/1.26 ----------- times (seconds) ----------- Wed Jun 29 13:28:24 2022
% 0.88/1.26
% 0.88/1.26 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.88/1.26 system CPU time 0.14 (0 hr, 0 min, 0 sec)
% 0.88/1.26 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.88/1.26 input time 0.00
% 0.88/1.26 paramodulation time 0.03
% 0.88/1.26 demodulation time 0.00
% 0.88/1.26 orient time 0.01
% 0.88/1.26 weigh time 0.00
% 0.88/1.26 forward subsume time 0.00
% 0.88/1.26 back demod find time 0.00
% 0.88/1.26 conflict time 0.00
% 0.88/1.26 LRPO time 0.00
% 0.88/1.26 store clause time 0.00
% 0.88/1.26 disable clause time 0.00
% 0.88/1.26 prime paramod time 0.01
% 0.88/1.26 semantics time 0.00
% 0.88/1.26
% 0.88/1.26 EQP interrupted
%------------------------------------------------------------------------------