%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT028-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:49 EDT 2022
% Result : Unsatisfiable 1.97s 2.21s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(a,b) != meet2(a,b),
file('LAT028-1.p',unknown),
[] ).
cnf(2,plain,
meet2(a,b) != meet(a,b),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
meet(A,A) = A,
file('LAT028-1.p',unknown),
[] ).
cnf(6,axiom,
join(A,A) = A,
file('LAT028-1.p',unknown),
[] ).
cnf(8,axiom,
meet(A,B) = meet(B,A),
file('LAT028-1.p',unknown),
[] ).
cnf(9,axiom,
join(A,B) = join(B,A),
file('LAT028-1.p',unknown),
[] ).
cnf(10,axiom,
meet(meet(join(A,B),join(C,B)),B) = B,
file('LAT028-1.p',unknown),
[] ).
cnf(12,axiom,
join(join(meet(A,B),meet(C,B)),B) = B,
file('LAT028-1.p',unknown),
[] ).
cnf(14,axiom,
meet2(A,A) = A,
file('LAT028-1.p',unknown),
[] ).
cnf(16,axiom,
meet2(A,B) = meet2(B,A),
file('LAT028-1.p',unknown),
[] ).
cnf(17,axiom,
meet2(meet2(join(A,B),join(C,B)),B) = B,
file('LAT028-1.p',unknown),
[] ).
cnf(19,axiom,
join(join(meet2(A,B),meet2(C,B)),B) = B,
file('LAT028-1.p',unknown),
[] ).
cnf(30,plain,
meet(join(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[10,4]),
[iquote('para_into,10.1.1.1,4.1.1')] ).
cnf(34,plain,
meet(join(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[30,9]),
[iquote('para_into,30.1.1.1,9.1.1')] ).
cnf(36,plain,
meet(A,join(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[30,8]),
[iquote('para_into,30.1.1,8.1.1')] ).
cnf(46,plain,
join(meet(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[12,6]),
[iquote('para_into,12.1.1.1,6.1.1')] ).
cnf(52,plain,
meet(A,join(A,B)) = A,
inference(para_into,[status(thm),theory(equality)],[34,8]),
[iquote('para_into,34.1.1,8.1.1')] ).
cnf(60,plain,
join(meet(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[46,8]),
[iquote('para_into,46.1.1.1,8.1.1')] ).
cnf(62,plain,
join(A,meet(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[46,9]),
[iquote('para_into,46.1.1,9.1.1')] ).
cnf(84,plain,
meet2(join(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[17,14]),
[iquote('para_into,17.1.1.1,14.1.1')] ).
cnf(90,plain,
join(A,meet(A,B)) = A,
inference(para_into,[status(thm),theory(equality)],[60,9]),
[iquote('para_into,60.1.1,9.1.1')] ).
cnf(97,plain,
join(join(A,B),A) = join(A,B),
inference(para_into,[status(thm),theory(equality)],[62,52]),
[iquote('para_into,62.1.1.2,52.1.1')] ).
cnf(100,plain,
meet2(meet2(join(A,meet(B,C)),C),meet(B,C)) = meet(B,C),
inference(para_from,[status(thm),theory(equality)],[62,17]),
[iquote('para_from,62.1.1,17.1.1.1.2')] ).
cnf(126,plain,
join(A,meet2(B,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,84]),97]),
[iquote('para_into,19.1.1.1.1,84.1.1,demod,97')] ).
cnf(154,plain,
join(A,meet2(A,B)) = A,
inference(para_into,[status(thm),theory(equality)],[126,16]),
[iquote('para_into,126.1.1.2,16.1.1')] ).
cnf(162,plain,
meet(meet(join(A,meet2(B,C)),C),meet2(B,C)) = meet2(B,C),
inference(para_from,[status(thm),theory(equality)],[126,10]),
[iquote('para_from,126.1.1,10.1.1.1.2')] ).
cnf(204,plain,
meet(meet2(A,B),A) = meet2(A,B),
inference(para_from,[status(thm),theory(equality)],[154,36]),
[iquote('para_from,154.1.1,36.1.1.2')] ).
cnf(731,plain,
meet2(meet2(A,B),meet(A,B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[100,90]),
[iquote('para_into,100.1.1.1.1,90.1.1')] ).
cnf(751,plain,
meet(meet(A,B),meet2(A,B)) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[731,204]),731]),
[iquote('para_from,730.1.1,204.1.1.1,demod,731')] ).
cnf(770,plain,
meet2(A,B) = meet(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[162,154]),751])]),
[iquote('para_into,162.1.1.1.1,154.1.1,demod,751,flip.1')] ).
cnf(772,plain,
$false,
inference(binary,[status(thm)],[770,2]),
[iquote('binary,770.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT028-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:36:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.97/2.21 ----- Otter 3.3f, August 2004 -----
% 1.97/2.21 The process was started by sandbox on n025.cluster.edu,
% 1.97/2.21 Wed Jul 27 08:36:15 2022
% 1.97/2.21 The command was "./otter". The process ID is 21268.
% 1.97/2.21
% 1.97/2.21 set(prolog_style_variables).
% 1.97/2.21 set(auto).
% 1.97/2.21 dependent: set(auto1).
% 1.97/2.21 dependent: set(process_input).
% 1.97/2.21 dependent: clear(print_kept).
% 1.97/2.21 dependent: clear(print_new_demod).
% 1.97/2.21 dependent: clear(print_back_demod).
% 1.97/2.21 dependent: clear(print_back_sub).
% 1.97/2.21 dependent: set(control_memory).
% 1.97/2.21 dependent: assign(max_mem, 12000).
% 1.97/2.21 dependent: assign(pick_given_ratio, 4).
% 1.97/2.21 dependent: assign(stats_level, 1).
% 1.97/2.21 dependent: assign(max_seconds, 10800).
% 1.97/2.21 clear(print_given).
% 1.97/2.21
% 1.97/2.21 list(usable).
% 1.97/2.21 0 [] A=A.
% 1.97/2.21 0 [] meet(X,X)=X.
% 1.97/2.21 0 [] join(X,X)=X.
% 1.97/2.21 0 [] meet(X,Y)=meet(Y,X).
% 1.97/2.21 0 [] join(X,Y)=join(Y,X).
% 1.97/2.21 0 [] meet(meet(join(X,Y),join(Z,Y)),Y)=Y.
% 1.97/2.21 0 [] join(join(meet(X,Y),meet(Z,Y)),Y)=Y.
% 1.97/2.21 0 [] meet2(X,X)=X.
% 1.97/2.21 0 [] meet2(X,Y)=meet2(Y,X).
% 1.97/2.21 0 [] meet2(meet2(join(X,Y),join(Z,Y)),Y)=Y.
% 1.97/2.21 0 [] join(join(meet2(X,Y),meet2(Z,Y)),Y)=Y.
% 1.97/2.21 0 [] meet(a,b)!=meet2(a,b).
% 1.97/2.21 end_of_list.
% 1.97/2.21
% 1.97/2.21 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.97/2.21
% 1.97/2.21 All clauses are units, and equality is present; the
% 1.97/2.21 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.97/2.21
% 1.97/2.21 dependent: set(knuth_bendix).
% 1.97/2.21 dependent: set(anl_eq).
% 1.97/2.21 dependent: set(para_from).
% 1.97/2.21 dependent: set(para_into).
% 1.97/2.21 dependent: clear(para_from_right).
% 1.97/2.21 dependent: clear(para_into_right).
% 1.97/2.21 dependent: set(para_from_vars).
% 1.97/2.21 dependent: set(eq_units_both_ways).
% 1.97/2.21 dependent: set(dynamic_demod_all).
% 1.97/2.21 dependent: set(dynamic_demod).
% 1.97/2.21 dependent: set(order_eq).
% 1.97/2.21 dependent: set(back_demod).
% 1.97/2.21 dependent: set(lrpo).
% 1.97/2.21
% 1.97/2.21 ------------> process usable:
% 1.97/2.21 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] meet2(a,b)!=meet(a,b).
% 1.97/2.21
% 1.97/2.21 ------------> process sos:
% 1.97/2.21 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.97/2.21 ** KEPT (pick-wt=5): 4 [] meet(A,A)=A.
% 1.97/2.21 ---> New Demodulator: 5 [new_demod,4] meet(A,A)=A.
% 1.97/2.21 ** KEPT (pick-wt=5): 6 [] join(A,A)=A.
% 1.97/2.21 ---> New Demodulator: 7 [new_demod,6] join(A,A)=A.
% 1.97/2.21 ** KEPT (pick-wt=7): 8 [] meet(A,B)=meet(B,A).
% 1.97/2.21 ** KEPT (pick-wt=7): 9 [] join(A,B)=join(B,A).
% 1.97/2.21 ** KEPT (pick-wt=11): 10 [] meet(meet(join(A,B),join(C,B)),B)=B.
% 1.97/2.21 ---> New Demodulator: 11 [new_demod,10] meet(meet(join(A,B),join(C,B)),B)=B.
% 1.97/2.21 ** KEPT (pick-wt=11): 12 [] join(join(meet(A,B),meet(C,B)),B)=B.
% 1.97/2.21 ---> New Demodulator: 13 [new_demod,12] join(join(meet(A,B),meet(C,B)),B)=B.
% 1.97/2.21 ** KEPT (pick-wt=5): 14 [] meet2(A,A)=A.
% 1.97/2.21 ---> New Demodulator: 15 [new_demod,14] meet2(A,A)=A.
% 1.97/2.21 ** KEPT (pick-wt=7): 16 [] meet2(A,B)=meet2(B,A).
% 1.97/2.21 ** KEPT (pick-wt=11): 17 [] meet2(meet2(join(A,B),join(C,B)),B)=B.
% 1.97/2.21 ---> New Demodulator: 18 [new_demod,17] meet2(meet2(join(A,B),join(C,B)),B)=B.
% 1.97/2.21 ** KEPT (pick-wt=11): 19 [] join(join(meet2(A,B),meet2(C,B)),B)=B.
% 1.97/2.21 ---> New Demodulator: 20 [new_demod,19] join(join(meet2(A,B),meet2(C,B)),B)=B.
% 1.97/2.21 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.97/2.21 >>>> Starting back demodulation with 5.
% 1.97/2.21 >>>> Starting back demodulation with 7.
% 1.97/2.21 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] meet(A,B)=meet(B,A).
% 1.97/2.21 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] join(A,B)=join(B,A).
% 1.97/2.21 >>>> Starting back demodulation with 11.
% 1.97/2.21 >>>> Starting back demodulation with 13.
% 1.97/2.21 >>>> Starting back demodulation with 15.
% 1.97/2.21 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] meet2(A,B)=meet2(B,A).
% 1.97/2.21 >>>> Starting back demodulation with 18.
% 1.97/2.21 >>>> Starting back demodulation with 20.
% 1.97/2.21
% 1.97/2.21 ======= end of input processing =======
% 1.97/2.21
% 1.97/2.21 =========== start of search ===========
% 1.97/2.21
% 1.97/2.21
% 1.97/2.21 Resetting weight limit to 11.
% 1.97/2.21
% 1.97/2.21
% 1.97/2.21 Resetting weight limit to 11.
% 1.97/2.21
% 1.97/2.21 sos_size=291
% 1.97/2.21
% 1.97/2.21 -------- PROOF --------
% 1.97/2.21
% 1.97/2.21 ----> UNIT CONFLICT at 0.11 sec ----> 772 [binary,770.1,2.1] $F.
% 1.97/2.21
% 1.97/2.21 Length of proof is 19. Level of proof is 9.
% 1.97/2.21
% 1.97/2.21 ---------------- PROOF ----------------
% 1.97/2.21 % SZS status Unsatisfiable
% 1.97/2.21 % SZS output start Refutation
% See solution above
% 1.97/2.21 ------------ end of proof -------------
% 1.97/2.21
% 1.97/2.21
% 1.97/2.21 Search stopped by max_proofs option.
% 1.97/2.21
% 1.97/2.21
% 1.97/2.21 Search stopped by max_proofs option.
% 1.97/2.21
% 1.97/2.21 ============ end of search ============
% 1.97/2.21
% 1.97/2.21 -------------- statistics -------------
% 1.97/2.21 clauses given 149
% 1.97/2.21 clauses generated 13923
% 1.97/2.21 clauses kept 390
% 1.97/2.21 clauses forward subsumed 9579
% 1.97/2.21 clauses back subsumed 0
% 1.97/2.21 Kbytes malloced 4882
% 1.97/2.21
% 1.97/2.21 ----------- times (seconds) -----------
% 1.97/2.21 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 1.97/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.21
% 1.97/2.21 That finishes the proof of the theorem.
% 1.97/2.21
% 1.97/2.21 Process 21268 finished Wed Jul 27 08:36:17 2022
% 1.97/2.21 Otter interrupted
% 1.97/2.21 PROOF FOUND
%------------------------------------------------------------------------------