TSTP Solution File: LAT026-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT026-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 : 300s
% DateTime : Wed Jul 27 13:01:48 EDT 2022
% Result : Unsatisfiable 3.37s 3.57s
% Output : Refutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 3 RR)
% Number of literals : 45 ( 44 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 116 ( 43 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(meet(a,b),c) != meet(a,meet(b,c)),
file('LAT026-1.p',unknown),
[] ).
cnf(3,axiom,
meet(A,A) = A,
file('LAT026-1.p',unknown),
[] ).
cnf(5,axiom,
join(A,A) = A,
file('LAT026-1.p',unknown),
[] ).
cnf(7,axiom,
meet(A,B) = meet(B,A),
file('LAT026-1.p',unknown),
[] ).
cnf(8,axiom,
join(A,B) = join(B,A),
file('LAT026-1.p',unknown),
[] ).
cnf(9,axiom,
meet(meet(join(A,B),join(C,B)),B) = B,
file('LAT026-1.p',unknown),
[] ).
cnf(11,axiom,
join(join(meet(A,B),meet(C,B)),B) = B,
file('LAT026-1.p',unknown),
[] ).
cnf(13,axiom,
meet(A,join(B,join(A,C))) = A,
file('LAT026-1.p',unknown),
[] ).
cnf(15,plain,
meet(c,meet(a,b)) != meet(a,meet(b,c)),
inference(para_from,[status(thm),theory(equality)],[7,1]),
[iquote('para_from,7.1.1,1.1.1')] ).
cnf(17,plain,
meet(meet(join(A,B),join(C,A)),A) = A,
inference(para_into,[status(thm),theory(equality)],[9,8]),
[iquote('para_into,9.1.1.1.1,8.1.1')] ).
cnf(21,plain,
meet(meet(join(A,B),join(B,C)),B) = B,
inference(para_into,[status(thm),theory(equality)],[9,8]),
[iquote('para_into,9.1.1.1.2,8.1.1')] ).
cnf(25,plain,
meet(join(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[9,3]),
[iquote('para_into,9.1.1.1,3.1.1')] ).
cnf(27,plain,
meet(A,meet(join(B,A),join(C,A))) = A,
inference(para_into,[status(thm),theory(equality)],[9,7]),
[iquote('para_into,9.1.1,7.1.1')] ).
cnf(29,plain,
meet(join(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[25,8]),
[iquote('para_into,25.1.1.1,8.1.1')] ).
cnf(34,plain,
meet(A,join(A,B)) = A,
inference(para_into,[status(thm),theory(equality)],[29,7]),
[iquote('para_into,29.1.1,7.1.1')] ).
cnf(41,plain,
join(join(meet(A,B),meet(C,A)),A) = A,
inference(para_into,[status(thm),theory(equality)],[11,7]),
[iquote('para_into,11.1.1.1.1,7.1.1')] ).
cnf(49,plain,
join(join(meet(A,B),meet(B,C)),B) = B,
inference(para_into,[status(thm),theory(equality)],[11,7]),
[iquote('para_into,11.1.1.1.2,7.1.1')] ).
cnf(51,plain,
join(meet(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[11,5]),
[iquote('para_into,11.1.1.1,5.1.1')] ).
cnf(53,plain,
join(A,join(meet(B,A),meet(C,A))) = A,
inference(para_into,[status(thm),theory(equality)],[11,8]),
[iquote('para_into,11.1.1,8.1.1')] ).
cnf(63,plain,
join(meet(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[51,7]),
[iquote('para_into,51.1.1.1,7.1.1')] ).
cnf(65,plain,
join(A,meet(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[51,8]),
[iquote('para_into,51.1.1,8.1.1')] ).
cnf(73,plain,
join(A,meet(A,B)) = A,
inference(para_into,[status(thm),theory(equality)],[63,8]),
[iquote('para_into,63.1.1,8.1.1')] ).
cnf(85,plain,
meet(meet(A,join(B,meet(C,A))),meet(C,A)) = meet(C,A),
inference(para_from,[status(thm),theory(equality)],[65,9]),
[iquote('para_from,65.1.1,9.1.1.1.1')] ).
cnf(93,plain,
meet(meet(A,B),join(C,A)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[13,63]),
[iquote('para_into,13.1.1.2.2,63.1.1')] ).
cnf(196,plain,
meet(meet(A,B),meet(join(C,meet(A,B)),B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[27,65]),
[iquote('para_into,27.1.1.2.2,65.1.1')] ).
cnf(238,plain,
meet(meet(A,join(B,join(meet(A,C),meet(D,A)))),join(meet(A,C),meet(D,A))) = join(meet(A,C),meet(D,A)),
inference(para_from,[status(thm),theory(equality)],[41,17]),
[iquote('para_from,41.1.1,17.1.1.1.1')] ).
cnf(262,plain,
meet(meet(join(A,join(meet(B,C),meet(C,D))),C),join(meet(B,C),meet(C,D))) = join(meet(B,C),meet(C,D)),
inference(para_from,[status(thm),theory(equality)],[49,21]),
[iquote('para_from,49.1.1,21.1.1.1.2')] ).
cnf(326,plain,
meet(meet(meet(A,B),C),A) = meet(meet(A,B),C),
inference(para_into,[status(thm),theory(equality)],[93,73]),
[iquote('para_into,93.1.1.2,73.1.1')] ).
cnf(329,plain,
meet(meet(meet(A,B),C),B) = meet(meet(A,B),C),
inference(para_into,[status(thm),theory(equality)],[93,65]),
[iquote('para_into,93.1.1.2,65.1.1')] ).
cnf(336,plain,
join(join(A,B),meet(B,C)) = join(A,B),
inference(para_from,[status(thm),theory(equality)],[93,65]),
[iquote('para_from,93.1.1,65.1.1.2')] ).
cnf(1431,plain,
meet(meet(A,B),meet(B,A)) = meet(B,A),
inference(para_into,[status(thm),theory(equality)],[85,73]),
[iquote('para_into,85.1.1.1.2,73.1.1')] ).
cnf(1580,plain,
meet(meet(A,B),join(C,meet(B,A))) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1431,93]),1431]),
[iquote('para_from,1430.1.1,93.1.1.1,demod,1431')] ).
cnf(1624,plain,
meet(meet(A,B),C) = meet(meet(B,A),C),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[326,7]),329]),
[iquote('para_into,326.1.1.1.1,7.1.1,demod,329')] ).
cnf(1625,plain,
join(A,join(meet(B,A),meet(meet(A,C),D))) = A,
inference(para_from,[status(thm),theory(equality)],[326,53]),
[iquote('para_from,326.1.1,53.1.1.2.2')] ).
cnf(1638,plain,
meet(A,meet(B,C)) = meet(meet(C,B),A),
inference(para_into,[status(thm),theory(equality)],[1624,7]),
[iquote('para_into,1624.1.1,7.1.1')] ).
cnf(1639,plain,
meet(meet(A,B),C) = meet(C,meet(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1638])]),
[iquote('copy,1638,flip.1')] ).
cnf(1652,plain,
join(A,join(meet(meet(B,A),C),meet(D,A))) = A,
inference(para_from,[status(thm),theory(equality)],[329,53]),
[iquote('para_from,328.1.1,53.1.1.2.1')] ).
cnf(1710,plain,
meet(meet(A,B),meet(join(C,A),B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[196,336]),
[iquote('para_into,196.1.1.2.1,336.1.1')] ).
cnf(1736,plain,
join(meet(A,B),meet(meet(B,C),A)) = meet(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1625,238]),34])]),
[iquote('para_from,1625.1.1,238.1.1.1.2,demod,34,flip.1')] ).
cnf(1751,plain,
join(meet(meet(A,B),C),meet(C,B)) = meet(B,C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1652,262]),1580])]),
[iquote('para_from,1652.1.1,262.1.1.1.1,demod,1580,flip.1')] ).
cnf(1872,plain,
meet(meet(join(A,B),C),B) = meet(C,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1736,1710]),1751])]),
[iquote('para_into,1736.1.1.2,1710.1.1,demod,1751,flip.1')] ).
cnf(1895,plain,
meet(meet(A,B),meet(C,A)) = meet(B,meet(C,A)),
inference(para_into,[status(thm),theory(equality)],[1872,65]),
[iquote('para_into,1872.1.1.1.1,65.1.1')] ).
cnf(1896,plain,
meet(A,meet(B,join(C,A))) = meet(B,A),
inference(para_into,[status(thm),theory(equality)],[1872,1639]),
[iquote('para_into,1872.1.1,1639.1.1')] ).
cnf(1924,plain,
meet(A,meet(B,C)) = meet(B,meet(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1896,73]),1895]),
[iquote('para_into,1896.1.1.2.2,73.1.1,demod,1895')] ).
cnf(1925,plain,
$false,
inference(binary,[status(thm)],[1924,15]),
[iquote('binary,1924.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT026-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 08:46:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 3.37/3.56 ----- Otter 3.3f, August 2004 -----
% 3.37/3.56 The process was started by sandbox2 on n023.cluster.edu,
% 3.37/3.56 Wed Jul 27 08:46:48 2022
% 3.37/3.56 The command was "./otter". The process ID is 24713.
% 3.37/3.56
% 3.37/3.56 set(prolog_style_variables).
% 3.37/3.56 set(auto).
% 3.37/3.56 dependent: set(auto1).
% 3.37/3.56 dependent: set(process_input).
% 3.37/3.56 dependent: clear(print_kept).
% 3.37/3.56 dependent: clear(print_new_demod).
% 3.37/3.56 dependent: clear(print_back_demod).
% 3.37/3.56 dependent: clear(print_back_sub).
% 3.37/3.56 dependent: set(control_memory).
% 3.37/3.56 dependent: assign(max_mem, 12000).
% 3.37/3.56 dependent: assign(pick_given_ratio, 4).
% 3.37/3.56 dependent: assign(stats_level, 1).
% 3.37/3.56 dependent: assign(max_seconds, 10800).
% 3.37/3.56 clear(print_given).
% 3.37/3.56
% 3.37/3.56 list(usable).
% 3.37/3.56 0 [] A=A.
% 3.37/3.56 0 [] meet(X,X)=X.
% 3.37/3.56 0 [] join(X,X)=X.
% 3.37/3.56 0 [] meet(X,Y)=meet(Y,X).
% 3.37/3.56 0 [] join(X,Y)=join(Y,X).
% 3.37/3.56 0 [] meet(meet(join(X,Y),join(Z,Y)),Y)=Y.
% 3.37/3.56 0 [] join(join(meet(X,Y),meet(Z,Y)),Y)=Y.
% 3.37/3.56 0 [] meet(X,join(Y,join(X,Z)))=X.
% 3.37/3.56 0 [] meet(meet(a,b),c)!=meet(a,meet(b,c)).
% 3.37/3.56 end_of_list.
% 3.37/3.56
% 3.37/3.56 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 3.37/3.56
% 3.37/3.56 All clauses are units, and equality is present; the
% 3.37/3.56 strategy will be Knuth-Bendix with positive clauses in sos.
% 3.37/3.56
% 3.37/3.56 dependent: set(knuth_bendix).
% 3.37/3.56 dependent: set(anl_eq).
% 3.37/3.56 dependent: set(para_from).
% 3.37/3.56 dependent: set(para_into).
% 3.37/3.56 dependent: clear(para_from_right).
% 3.37/3.56 dependent: clear(para_into_right).
% 3.37/3.56 dependent: set(para_from_vars).
% 3.37/3.56 dependent: set(eq_units_both_ways).
% 3.37/3.56 dependent: set(dynamic_demod_all).
% 3.37/3.56 dependent: set(dynamic_demod).
% 3.37/3.56 dependent: set(order_eq).
% 3.37/3.56 dependent: set(back_demod).
% 3.37/3.56 dependent: set(lrpo).
% 3.37/3.56
% 3.37/3.56 ------------> process usable:
% 3.37/3.56 ** KEPT (pick-wt=11): 1 [] meet(meet(a,b),c)!=meet(a,meet(b,c)).
% 3.37/3.56
% 3.37/3.56 ------------> process sos:
% 3.37/3.56 ** KEPT (pick-wt=3): 2 [] A=A.
% 3.37/3.56 ** KEPT (pick-wt=5): 3 [] meet(A,A)=A.
% 3.37/3.56 ---> New Demodulator: 4 [new_demod,3] meet(A,A)=A.
% 3.37/3.56 ** KEPT (pick-wt=5): 5 [] join(A,A)=A.
% 3.37/3.56 ---> New Demodulator: 6 [new_demod,5] join(A,A)=A.
% 3.37/3.56 ** KEPT (pick-wt=7): 7 [] meet(A,B)=meet(B,A).
% 3.37/3.56 ** KEPT (pick-wt=7): 8 [] join(A,B)=join(B,A).
% 3.37/3.56 ** KEPT (pick-wt=11): 9 [] meet(meet(join(A,B),join(C,B)),B)=B.
% 3.37/3.56 ---> New Demodulator: 10 [new_demod,9] meet(meet(join(A,B),join(C,B)),B)=B.
% 3.37/3.57 ** KEPT (pick-wt=11): 11 [] join(join(meet(A,B),meet(C,B)),B)=B.
% 3.37/3.57 ---> New Demodulator: 12 [new_demod,11] join(join(meet(A,B),meet(C,B)),B)=B.
% 3.37/3.57 ** KEPT (pick-wt=9): 13 [] meet(A,join(B,join(A,C)))=A.
% 3.37/3.57 ---> New Demodulator: 14 [new_demod,13] meet(A,join(B,join(A,C)))=A.
% 3.37/3.57 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 3.37/3.57 >>>> Starting back demodulation with 4.
% 3.37/3.57 >>>> Starting back demodulation with 6.
% 3.37/3.57 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] meet(A,B)=meet(B,A).
% 3.37/3.57 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] join(A,B)=join(B,A).
% 3.37/3.57 >>>> Starting back demodulation with 10.
% 3.37/3.57 >>>> Starting back demodulation with 12.
% 3.37/3.57 >>>> Starting back demodulation with 14.
% 3.37/3.57
% 3.37/3.57 ======= end of input processing =======
% 3.37/3.57
% 3.37/3.57 =========== start of search ===========
% 3.37/3.57
% 3.37/3.57
% 3.37/3.57 Resetting weight limit to 13.
% 3.37/3.57
% 3.37/3.57
% 3.37/3.57 Resetting weight limit to 13.
% 3.37/3.57
% 3.37/3.57 sos_size=584
% 3.37/3.57
% 3.37/3.57 -------- PROOF --------
% 3.37/3.57
% 3.37/3.57 ----> UNIT CONFLICT at 1.45 sec ----> 1925 [binary,1924.1,15.1] $F.
% 3.37/3.57
% 3.37/3.57 Length of proof is 36. Level of proof is 9.
% 3.37/3.57
% 3.37/3.57 ---------------- PROOF ----------------
% 3.37/3.57 % SZS status Unsatisfiable
% 3.37/3.57 % SZS output start Refutation
% See solution above
% 3.37/3.57 ------------ end of proof -------------
% 3.37/3.57
% 3.37/3.57
% 3.37/3.57 Search stopped by max_proofs option.
% 3.37/3.57
% 3.37/3.57
% 3.37/3.57 Search stopped by max_proofs option.
% 3.37/3.57
% 3.37/3.57 ============ end of search ============
% 3.37/3.57
% 3.37/3.57 -------------- statistics -------------
% 3.37/3.57 clauses given 489
% 3.37/3.57 clauses generated 309862
% 3.37/3.57 clauses kept 989
% 3.37/3.57 clauses forward subsumed 187014
% 3.37/3.57 clauses back subsumed 4
% 3.37/3.57 Kbytes malloced 6835
% 3.37/3.57
% 3.37/3.57 ----------- times (seconds) -----------
% 3.37/3.57 user CPU time 1.45 (0 hr, 0 min, 1 sec)
% 3.37/3.57 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.37/3.57 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.37/3.57
% 3.37/3.57 That finishes the proof of the theorem.
% 3.37/3.57
% 3.37/3.57 Process 24713 finished Wed Jul 27 08:46:51 2022
% 3.37/3.57 Otter interrupted
% 3.37/3.57 PROOF FOUND
%------------------------------------------------------------------------------