TSTP Solution File: LAT027-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT027-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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 3.39s 3.53s
% Output : Refutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 3 RR)
% Number of literals : 51 ( 50 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 : 134 ( 52 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
join(join(a,b),c) != join(a,join(b,c)),
file('LAT027-1.p',unknown),
[] ).
cnf(3,axiom,
meet(A,A) = A,
file('LAT027-1.p',unknown),
[] ).
cnf(5,axiom,
join(A,A) = A,
file('LAT027-1.p',unknown),
[] ).
cnf(7,axiom,
meet(A,B) = meet(B,A),
file('LAT027-1.p',unknown),
[] ).
cnf(8,axiom,
join(A,B) = join(B,A),
file('LAT027-1.p',unknown),
[] ).
cnf(9,axiom,
meet(meet(join(A,B),join(C,B)),B) = B,
file('LAT027-1.p',unknown),
[] ).
cnf(11,axiom,
join(join(meet(A,B),meet(C,B)),B) = B,
file('LAT027-1.p',unknown),
[] ).
cnf(13,axiom,
meet(A,join(B,join(A,C))) = A,
file('LAT027-1.p',unknown),
[] ).
cnf(15,plain,
join(c,join(a,b)) != join(a,join(b,c)),
inference(para_from,[status(thm),theory(equality)],[8,1]),
[iquote('para_from,8.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(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(31,plain,
meet(A,join(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[25,7]),
[iquote('para_into,25.1.1,7.1.1')] ).
cnf(33,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(37,plain,
join(join(A,meet(B,join(C,A))),join(C,A)) = join(C,A),
inference(para_into,[status(thm),theory(equality)],[11,31]),
[iquote('para_into,11.1.1.1.1,31.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(43,plain,
join(join(meet(A,join(B,C)),B),join(B,C)) = join(B,C),
inference(para_into,[status(thm),theory(equality)],[11,33]),
[iquote('para_into,11.1.1.1.2,33.1.1')] ).
cnf(45,plain,
join(join(meet(A,join(B,C)),C),join(B,C)) = join(B,C),
inference(para_into,[status(thm),theory(equality)],[11,31]),
[iquote('para_into,11.1.1.1.2,31.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(99,plain,
meet(A,join(B,join(C,A))) = A,
inference(para_into,[status(thm),theory(equality)],[13,8]),
[iquote('para_into,13.1.1.2.2,8.1.1')] ).
cnf(101,plain,
meet(A,join(join(A,B),C)) = A,
inference(para_into,[status(thm),theory(equality)],[13,8]),
[iquote('para_into,13.1.1.2,8.1.1')] ).
cnf(105,plain,
join(join(A,join(B,C)),B) = join(A,join(B,C)),
inference(para_from,[status(thm),theory(equality)],[13,65]),
[iquote('para_from,13.1.1,65.1.1.2')] ).
cnf(122,plain,
join(A,join(B,join(C,A))) = join(B,join(C,A)),
inference(para_from,[status(thm),theory(equality)],[99,51]),
[iquote('para_from,99.1.1,51.1.1.1')] ).
cnf(126,plain,
meet(meet(A,B),join(A,C)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[101,63]),
[iquote('para_into,101.1.1.2.1,63.1.1')] ).
cnf(128,plain,
meet(meet(A,B),join(B,C)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[101,51]),
[iquote('para_into,101.1.1.2.1,51.1.1')] ).
cnf(166,plain,
meet(A,meet(join(A,B),join(C,A))) = A,
inference(para_into,[status(thm),theory(equality)],[17,7]),
[iquote('para_into,17.1.1,7.1.1')] ).
cnf(184,plain,
meet(A,meet(join(B,A),join(A,C))) = A,
inference(para_into,[status(thm),theory(equality)],[21,7]),
[iquote('para_into,21.1.1,7.1.1')] ).
cnf(202,plain,
join(join(A,meet(B,meet(join(C,A),join(A,D)))),meet(join(C,A),join(A,D))) = meet(join(C,A),join(A,D)),
inference(para_into,[status(thm),theory(equality)],[41,21]),
[iquote('para_into,41.1.1.1.1,21.1.1')] ).
cnf(204,plain,
join(join(A,meet(B,meet(join(A,C),join(D,A)))),meet(join(A,C),join(D,A))) = meet(join(A,C),join(D,A)),
inference(para_into,[status(thm),theory(equality)],[41,17]),
[iquote('para_into,41.1.1.1.1,17.1.1')] ).
cnf(284,plain,
join(join(A,B),join(B,meet(C,join(A,B)))) = join(A,B),
inference(para_into,[status(thm),theory(equality)],[53,31]),
[iquote('para_into,53.1.1.2.1,31.1.1')] ).
cnf(434,plain,
join(join(A,B),meet(A,C)) = join(A,B),
inference(para_from,[status(thm),theory(equality)],[126,65]),
[iquote('para_from,126.1.1,65.1.1.2')] ).
cnf(466,plain,
join(join(A,B),meet(C,A)) = join(A,B),
inference(para_from,[status(thm),theory(equality)],[128,65]),
[iquote('para_from,128.1.1,65.1.1.2')] ).
cnf(489,plain,
join(join(A,B),join(B,A)) = join(B,A),
inference(para_into,[status(thm),theory(equality)],[37,33]),
[iquote('para_into,37.1.1.1.2,33.1.1')] ).
cnf(621,plain,
join(join(A,B),join(B,join(A,C))) = join(B,join(A,C)),
inference(para_into,[status(thm),theory(equality)],[43,13]),
[iquote('para_into,43.1.1.1.1,13.1.1')] ).
cnf(764,plain,
join(join(meet(A,B),C),join(A,C)) = join(A,C),
inference(para_into,[status(thm),theory(equality)],[45,126]),
[iquote('para_into,45.1.1.1.1,126.1.1')] ).
cnf(1471,plain,
join(join(A,B),meet(C,join(B,A))) = join(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[489,466]),489]),
[iquote('para_from,488.1.1,466.1.1.1,demod,489')] ).
cnf(1473,plain,
join(join(A,B),meet(join(B,A),C)) = join(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[489,434]),489]),
[iquote('para_from,488.1.1,434.1.1.1,demod,489')] ).
cnf(1511,plain,
meet(A,meet(join(B,join(A,C)),join(A,D))) = A,
inference(para_from,[status(thm),theory(equality)],[105,184]),
[iquote('para_from,105.1.1,184.1.1.2.1')] ).
cnf(1517,plain,
meet(A,meet(join(A,B),join(C,join(A,D)))) = A,
inference(para_from,[status(thm),theory(equality)],[105,166]),
[iquote('para_from,105.1.1,166.1.1.2.2')] ).
cnf(1712,plain,
meet(join(A,join(B,C)),join(B,A)) = join(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1511,204]),1471])]),
[iquote('para_from,1511.1.1,204.1.1.1.2,demod,1471,flip.1')] ).
cnf(1714,plain,
meet(join(A,B),join(B,join(A,C))) = join(B,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1517,202]),1473])]),
[iquote('para_from,1517.1.1,202.1.1.1.2,demod,1473,flip.1')] ).
cnf(1761,plain,
meet(join(A,join(B,C)),join(A,C)) = join(C,A),
inference(para_into,[status(thm),theory(equality)],[1712,122]),
[iquote('para_into,1712.1.1.1,122.1.1')] ).
cnf(1766,plain,
join(join(meet(A,B),C),A) = join(C,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1714,764]),1761])]),
[iquote('para_into,1714.1.1.2,764.1.1,demod,1761,flip.1')] ).
cnf(1784,plain,
join(join(A,B),join(C,A)) = join(C,join(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1714,284]),621]),
[iquote('para_from,1714.1.1,284.1.1.2.2,demod,621')] ).
cnf(1797,plain,
join(join(A,B),join(C,A)) = join(B,join(C,A)),
inference(para_into,[status(thm),theory(equality)],[1766,25]),
[iquote('para_into,1766.1.1.1.1,25.1.1')] ).
cnf(1804,plain,
join(A,join(B,C)) = join(B,join(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1784]),1797]),
[iquote('back_demod,1784,demod,1797')] ).
cnf(1805,plain,
$false,
inference(binary,[status(thm)],[1804,15]),
[iquote('binary,1804.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT027-1 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 08:06:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.39/3.53 ----- Otter 3.3f, August 2004 -----
% 3.39/3.53 The process was started by sandbox on n011.cluster.edu,
% 3.39/3.53 Wed Jul 27 08:06:55 2022
% 3.39/3.53 The command was "./otter". The process ID is 1362.
% 3.39/3.53
% 3.39/3.53 set(prolog_style_variables).
% 3.39/3.53 set(auto).
% 3.39/3.53 dependent: set(auto1).
% 3.39/3.53 dependent: set(process_input).
% 3.39/3.53 dependent: clear(print_kept).
% 3.39/3.53 dependent: clear(print_new_demod).
% 3.39/3.53 dependent: clear(print_back_demod).
% 3.39/3.53 dependent: clear(print_back_sub).
% 3.39/3.53 dependent: set(control_memory).
% 3.39/3.53 dependent: assign(max_mem, 12000).
% 3.39/3.53 dependent: assign(pick_given_ratio, 4).
% 3.39/3.53 dependent: assign(stats_level, 1).
% 3.39/3.53 dependent: assign(max_seconds, 10800).
% 3.39/3.53 clear(print_given).
% 3.39/3.53
% 3.39/3.53 list(usable).
% 3.39/3.53 0 [] A=A.
% 3.39/3.53 0 [] meet(X,X)=X.
% 3.39/3.53 0 [] join(X,X)=X.
% 3.39/3.53 0 [] meet(X,Y)=meet(Y,X).
% 3.39/3.53 0 [] join(X,Y)=join(Y,X).
% 3.39/3.53 0 [] meet(meet(join(X,Y),join(Z,Y)),Y)=Y.
% 3.39/3.53 0 [] join(join(meet(X,Y),meet(Z,Y)),Y)=Y.
% 3.39/3.53 0 [] meet(X,join(Y,join(X,Z)))=X.
% 3.39/3.53 0 [] join(join(a,b),c)!=join(a,join(b,c)).
% 3.39/3.53 end_of_list.
% 3.39/3.53
% 3.39/3.53 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 3.39/3.53
% 3.39/3.53 All clauses are units, and equality is present; the
% 3.39/3.53 strategy will be Knuth-Bendix with positive clauses in sos.
% 3.39/3.53
% 3.39/3.53 dependent: set(knuth_bendix).
% 3.39/3.53 dependent: set(anl_eq).
% 3.39/3.53 dependent: set(para_from).
% 3.39/3.53 dependent: set(para_into).
% 3.39/3.53 dependent: clear(para_from_right).
% 3.39/3.53 dependent: clear(para_into_right).
% 3.39/3.53 dependent: set(para_from_vars).
% 3.39/3.53 dependent: set(eq_units_both_ways).
% 3.39/3.53 dependent: set(dynamic_demod_all).
% 3.39/3.53 dependent: set(dynamic_demod).
% 3.39/3.53 dependent: set(order_eq).
% 3.39/3.53 dependent: set(back_demod).
% 3.39/3.53 dependent: set(lrpo).
% 3.39/3.53
% 3.39/3.53 ------------> process usable:
% 3.39/3.53 ** KEPT (pick-wt=11): 1 [] join(join(a,b),c)!=join(a,join(b,c)).
% 3.39/3.53
% 3.39/3.53 ------------> process sos:
% 3.39/3.53 ** KEPT (pick-wt=3): 2 [] A=A.
% 3.39/3.53 ** KEPT (pick-wt=5): 3 [] meet(A,A)=A.
% 3.39/3.53 ---> New Demodulator: 4 [new_demod,3] meet(A,A)=A.
% 3.39/3.53 ** KEPT (pick-wt=5): 5 [] join(A,A)=A.
% 3.39/3.53 ---> New Demodulator: 6 [new_demod,5] join(A,A)=A.
% 3.39/3.53 ** KEPT (pick-wt=7): 7 [] meet(A,B)=meet(B,A).
% 3.39/3.53 ** KEPT (pick-wt=7): 8 [] join(A,B)=join(B,A).
% 3.39/3.53 ** KEPT (pick-wt=11): 9 [] meet(meet(join(A,B),join(C,B)),B)=B.
% 3.39/3.53 ---> New Demodulator: 10 [new_demod,9] meet(meet(join(A,B),join(C,B)),B)=B.
% 3.39/3.53 ** KEPT (pick-wt=11): 11 [] join(join(meet(A,B),meet(C,B)),B)=B.
% 3.39/3.53 ---> New Demodulator: 12 [new_demod,11] join(join(meet(A,B),meet(C,B)),B)=B.
% 3.39/3.53 ** KEPT (pick-wt=9): 13 [] meet(A,join(B,join(A,C)))=A.
% 3.39/3.53 ---> New Demodulator: 14 [new_demod,13] meet(A,join(B,join(A,C)))=A.
% 3.39/3.53 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 3.39/3.53 >>>> Starting back demodulation with 4.
% 3.39/3.53 >>>> Starting back demodulation with 6.
% 3.39/3.53 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] meet(A,B)=meet(B,A).
% 3.39/3.53 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] join(A,B)=join(B,A).
% 3.39/3.53 >>>> Starting back demodulation with 10.
% 3.39/3.53 >>>> Starting back demodulation with 12.
% 3.39/3.53 >>>> Starting back demodulation with 14.
% 3.39/3.53
% 3.39/3.53 ======= end of input processing =======
% 3.39/3.53
% 3.39/3.53 =========== start of search ===========
% 3.39/3.53
% 3.39/3.53
% 3.39/3.53 Resetting weight limit to 13.
% 3.39/3.53
% 3.39/3.53
% 3.39/3.53 Resetting weight limit to 13.
% 3.39/3.53
% 3.39/3.53 sos_size=584
% 3.39/3.53
% 3.39/3.53 -------- PROOF --------
% 3.39/3.53
% 3.39/3.53 ----> UNIT CONFLICT at 1.37 sec ----> 1805 [binary,1804.1,15.1] $F.
% 3.39/3.53
% 3.39/3.53 Length of proof is 42. Level of proof is 10.
% 3.39/3.53
% 3.39/3.53 ---------------- PROOF ----------------
% 3.39/3.53 % SZS status Unsatisfiable
% 3.39/3.53 % SZS output start Refutation
% See solution above
% 3.39/3.53 ------------ end of proof -------------
% 3.39/3.53
% 3.39/3.53
% 3.39/3.53 Search stopped by max_proofs option.
% 3.39/3.53
% 3.39/3.53
% 3.39/3.53 Search stopped by max_proofs option.
% 3.39/3.53
% 3.39/3.53 ============ end of search ============
% 3.39/3.53
% 3.39/3.53 -------------- statistics -------------
% 3.39/3.53 clauses given 464
% 3.39/3.53 clauses generated 290775
% 3.39/3.53 clauses kept 918
% 3.39/3.53 clauses forward subsumed 177536
% 3.39/3.53 clauses back subsumed 4
% 3.39/3.53 Kbytes malloced 6835
% 3.39/3.53
% 3.39/3.53 ----------- times (seconds) -----------
% 3.39/3.53 user CPU time 1.37 (0 hr, 0 min, 1 sec)
% 3.39/3.53 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 3.39/3.53 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 3.39/3.53
% 3.39/3.53 That finishes the proof of the theorem.
% 3.39/3.53
% 3.39/3.53 Process 1362 finished Wed Jul 27 08:06:59 2022
% 3.39/3.53 Otter interrupted
% 3.39/3.53 PROOF FOUND
%------------------------------------------------------------------------------