TSTP Solution File: LAT037-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT037-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:50 EDT 2022
% Result : Unsatisfiable 1.93s 2.14s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 14 RR)
% Number of literals : 21 ( 20 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
yy != zz,
file('LAT037-1.p',unknown),
[] ).
cnf(3,plain,
zz != yy,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[2])]),
[iquote('copy,2,flip.1')] ).
cnf(13,axiom,
meet(A,B) = meet(B,A),
file('LAT037-1.p',unknown),
[] ).
cnf(14,axiom,
join(A,B) = join(B,A),
file('LAT037-1.p',unknown),
[] ).
cnf(22,axiom,
meet(A,join(B,C)) = join(meet(A,B),meet(A,C)),
file('LAT037-1.p',unknown),
[] ).
cnf(27,axiom,
join(A,n0) = A,
file('LAT037-1.p',unknown),
[] ).
cnf(29,axiom,
meet(A,n1) = A,
file('LAT037-1.p',unknown),
[] ).
cnf(32,axiom,
join(xx,yy) = n1,
file('LAT037-1.p',unknown),
[] ).
cnf(34,axiom,
join(xx,zz) = n1,
file('LAT037-1.p',unknown),
[] ).
cnf(36,axiom,
meet(xx,yy) = n0,
file('LAT037-1.p',unknown),
[] ).
cnf(38,axiom,
meet(xx,zz) = n0,
file('LAT037-1.p',unknown),
[] ).
cnf(50,plain,
meet(yy,xx) = n0,
inference(para_into,[status(thm),theory(equality)],[36,13]),
[iquote('para_into,36.1.1,13.1.1')] ).
cnf(51,plain,
meet(zz,xx) = n0,
inference(para_into,[status(thm),theory(equality)],[38,13]),
[iquote('para_into,38.1.1,13.1.1')] ).
cnf(55,plain,
join(zz,xx) = n1,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,34])]),
[iquote('para_into,14.1.1,34.1.1,flip.1')] ).
cnf(57,plain,
join(yy,xx) = n1,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,32])]),
[iquote('para_into,14.1.1,32.1.1,flip.1')] ).
cnf(119,plain,
join(meet(A,yy),meet(A,xx)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[22,57]),29])]),
[iquote('para_into,22.1.1.2,57.1.1,demod,29,flip.1')] ).
cnf(121,plain,
join(meet(A,zz),meet(A,xx)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[22,55]),29])]),
[iquote('para_into,22.1.1.2,55.1.1,demod,29,flip.1')] ).
cnf(356,plain,
meet(zz,yy) = zz,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[119,51]),27]),
[iquote('para_into,119.1.1.2,51.1.1,demod,27')] ).
cnf(366,plain,
meet(yy,zz) = zz,
inference(para_into,[status(thm),theory(equality)],[356,13]),
[iquote('para_into,356.1.1,13.1.1')] ).
cnf(470,plain,
zz = yy,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[121,366]),50,27]),
[iquote('para_into,121.1.1.1,366.1.1,demod,50,27')] ).
cnf(472,plain,
$false,
inference(binary,[status(thm)],[470,3]),
[iquote('binary,470.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT037-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 08:50:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.93/2.13 ----- Otter 3.3f, August 2004 -----
% 1.93/2.13 The process was started by sandbox on n026.cluster.edu,
% 1.93/2.13 Wed Jul 27 08:50:24 2022
% 1.93/2.13 The command was "./otter". The process ID is 26805.
% 1.93/2.13
% 1.93/2.13 set(prolog_style_variables).
% 1.93/2.13 set(auto).
% 1.93/2.13 dependent: set(auto1).
% 1.93/2.13 dependent: set(process_input).
% 1.93/2.13 dependent: clear(print_kept).
% 1.93/2.13 dependent: clear(print_new_demod).
% 1.93/2.13 dependent: clear(print_back_demod).
% 1.93/2.13 dependent: clear(print_back_sub).
% 1.93/2.13 dependent: set(control_memory).
% 1.93/2.13 dependent: assign(max_mem, 12000).
% 1.93/2.13 dependent: assign(pick_given_ratio, 4).
% 1.93/2.13 dependent: assign(stats_level, 1).
% 1.93/2.13 dependent: assign(max_seconds, 10800).
% 1.93/2.13 clear(print_given).
% 1.93/2.13
% 1.93/2.13 list(usable).
% 1.93/2.13 0 [] A=A.
% 1.93/2.13 0 [] meet(X,X)=X.
% 1.93/2.13 0 [] join(X,X)=X.
% 1.93/2.13 0 [] meet(X,join(X,Y))=X.
% 1.93/2.13 0 [] join(X,meet(X,Y))=X.
% 1.93/2.13 0 [] meet(X,Y)=meet(Y,X).
% 1.93/2.13 0 [] join(X,Y)=join(Y,X).
% 1.93/2.13 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 1.93/2.13 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 1.93/2.13 0 [] join(X,meet(Y,Z))=meet(join(X,Y),join(X,Z)).
% 1.93/2.13 0 [] meet(X,join(Y,Z))=join(meet(X,Y),meet(X,Z)).
% 1.93/2.13 0 [] meet(X,n0)=n0.
% 1.93/2.13 0 [] join(X,n0)=X.
% 1.93/2.13 0 [] meet(X,n1)=X.
% 1.93/2.13 0 [] join(X,n1)=n1.
% 1.93/2.13 0 [] meet(X,Z)!=X|meet(Z,join(X,Y))=join(X,meet(Y,Z)).
% 1.93/2.13 0 [] join(xx,yy)=n1.
% 1.93/2.13 0 [] join(xx,zz)=n1.
% 1.93/2.13 0 [] meet(xx,yy)=n0.
% 1.93/2.13 0 [] meet(xx,zz)=n0.
% 1.93/2.13 0 [] yy!=zz.
% 1.93/2.13 end_of_list.
% 1.93/2.13
% 1.93/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.93/2.13
% 1.93/2.13 This is a Horn set with equality. The strategy will be
% 1.93/2.13 Knuth-Bendix and hyper_res, with positive clauses in
% 1.93/2.13 sos and nonpositive clauses in usable.
% 1.93/2.13
% 1.93/2.13 dependent: set(knuth_bendix).
% 1.93/2.13 dependent: set(anl_eq).
% 1.93/2.13 dependent: set(para_from).
% 1.93/2.13 dependent: set(para_into).
% 1.93/2.13 dependent: clear(para_from_right).
% 1.93/2.13 dependent: clear(para_into_right).
% 1.93/2.13 dependent: set(para_from_vars).
% 1.93/2.13 dependent: set(eq_units_both_ways).
% 1.93/2.13 dependent: set(dynamic_demod_all).
% 1.93/2.13 dependent: set(dynamic_demod).
% 1.93/2.13 dependent: set(order_eq).
% 1.93/2.13 dependent: set(back_demod).
% 1.93/2.13 dependent: set(lrpo).
% 1.93/2.13 dependent: set(hyper_res).
% 1.93/2.13 dependent: clear(order_hyper).
% 1.93/2.13
% 1.93/2.13 ------------> process usable:
% 1.93/2.13 ** KEPT (pick-wt=16): 1 [] meet(A,B)!=A|meet(B,join(A,C))=join(A,meet(C,B)).
% 1.93/2.13 ** KEPT (pick-wt=3): 3 [copy,2,flip.1] zz!=yy.
% 1.93/2.13
% 1.93/2.13 ------------> process sos:
% 1.93/2.13 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.93/2.13 ** KEPT (pick-wt=5): 5 [] meet(A,A)=A.
% 1.93/2.13 ---> New Demodulator: 6 [new_demod,5] meet(A,A)=A.
% 1.93/2.13 ** KEPT (pick-wt=5): 7 [] join(A,A)=A.
% 1.93/2.13 ---> New Demodulator: 8 [new_demod,7] join(A,A)=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 9 [] meet(A,join(A,B))=A.
% 1.93/2.13 ---> New Demodulator: 10 [new_demod,9] meet(A,join(A,B))=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 11 [] join(A,meet(A,B))=A.
% 1.93/2.13 ---> New Demodulator: 12 [new_demod,11] join(A,meet(A,B))=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 13 [] meet(A,B)=meet(B,A).
% 1.93/2.13 ** KEPT (pick-wt=7): 14 [] join(A,B)=join(B,A).
% 1.93/2.13 ** KEPT (pick-wt=11): 15 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.93/2.13 ---> New Demodulator: 16 [new_demod,15] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.93/2.13 ** KEPT (pick-wt=11): 17 [] join(join(A,B),C)=join(A,join(B,C)).
% 1.93/2.13 ---> New Demodulator: 18 [new_demod,17] join(join(A,B),C)=join(A,join(B,C)).
% 1.93/2.13 ** KEPT (pick-wt=13): 20 [copy,19,flip.1] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.93/2.13 ---> New Demodulator: 21 [new_demod,20] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.93/2.13 ** KEPT (pick-wt=13): 22 [] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.93/2.13 ---> New Demodulator: 23 [new_demod,22] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.93/2.13 ** KEPT (pick-wt=5): 24 [] meet(A,n0)=n0.
% 1.93/2.13 ---> New Demodulator: 25 [new_demod,24] meet(A,n0)=n0.
% 1.93/2.13 ** KEPT (pick-wt=5): 26 [] join(A,n0)=A.
% 1.93/2.13 ---> New Demodulator: 27 [new_demod,26] join(A,n0)=A.
% 1.93/2.13 ** KEPT (pick-wt=5): 28 [] meet(A,n1)=A.
% 1.93/2.13 ---> New Demodulator: 29 [new_demod,28] meet(A,n1)=A.
% 1.93/2.13 ** KEPT (pick-wt=5): 30 [] join(A,n1)=n1.
% 1.93/2.13 ---> New Demodulator: 31 [new_demod,30] join(A,n1)=n1.
% 1.93/2.13 ** KEPT (pick-wt=5): 32 [] join(xx,yy)=n1.
% 1.93/2.13 ---> New Demodulator: 33 [new_demod,32] join(xx,yy)=n1.
% 1.93/2.13 ** KEPT (pick-wt=5): 34 [] join(xx,zz)=n1.
% 1.93/2.13 ---> New Demodulator: 35 [new_demod,34] join(xx,zz)=n1.
% 1.93/2.13 ** KEPT (pick-wt=5): 36 [] meet(xx,yy)=n0.
% 1.93/2.13 ---> New Demodulator: 37 [new_demod,36] meet(xx,yy)=n0.
% 1.93/2.13 ** KEPT (pick-wt=5): 38 [] meet(xx,zz)=n0.
% 1.93/2.13 ---> New Demodulator: 39 [new_demod,38] meet(xx,zz)=n0.
% 1.93/2.13 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.93/2.14 >>>> Starting back demodulation with 6.
% 1.93/2.14 >>>> Starting back demodulation with 8.
% 1.93/2.14 >>>> Starting back demodulation with 10.
% 1.93/2.14 >>>> Starting back demodulation with 12.
% 1.93/2.14 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] meet(A,B)=meet(B,A).
% 1.93/2.14 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] join(A,B)=join(B,A).
% 1.93/2.14 >>>> Starting back demodulation with 16.
% 1.93/2.14 >>>> Starting back demodulation with 18.
% 1.93/2.14 >>>> Starting back demodulation with 21.
% 1.93/2.14 >>>> Starting back demodulation with 23.
% 1.93/2.14 >> back demodulating 20 with 23.
% 1.93/2.14 >> back demodulating 9 with 23.
% 1.93/2.14 >> back demodulating 1 with 23.
% 1.93/2.14 >>>> Starting back demodulation with 25.
% 1.93/2.14 >>>> Starting back demodulation with 27.
% 1.93/2.14 >>>> Starting back demodulation with 29.
% 1.93/2.14 >>>> Starting back demodulation with 31.
% 1.93/2.14 >>>> Starting back demodulation with 33.
% 1.93/2.14 >>>> Starting back demodulation with 35.
% 1.93/2.14 >>>> Starting back demodulation with 37.
% 1.93/2.14 >>>> Starting back demodulation with 39.
% 1.93/2.14 >>>> Starting back demodulation with 41.
% 1.93/2.14
% 1.93/2.14 ======= end of input processing =======
% 1.93/2.14
% 1.93/2.14 =========== start of search ===========
% 1.93/2.14
% 1.93/2.14 -------- PROOF --------
% 1.93/2.14
% 1.93/2.14 ----> UNIT CONFLICT at 0.01 sec ----> 472 [binary,470.1,3.1] $F.
% 1.93/2.14
% 1.93/2.14 Length of proof is 10. Level of proof is 5.
% 1.93/2.14
% 1.93/2.14 ---------------- PROOF ----------------
% 1.93/2.14 % SZS status Unsatisfiable
% 1.93/2.14 % SZS output start Refutation
% See solution above
% 1.93/2.14 ------------ end of proof -------------
% 1.93/2.14
% 1.93/2.14
% 1.93/2.14 Search stopped by max_proofs option.
% 1.93/2.14
% 1.93/2.14
% 1.93/2.14 Search stopped by max_proofs option.
% 1.93/2.14
% 1.93/2.14 ============ end of search ============
% 1.93/2.14
% 1.93/2.14 -------------- statistics -------------
% 1.93/2.14 clauses given 65
% 1.93/2.14 clauses generated 1459
% 1.93/2.14 clauses kept 284
% 1.93/2.14 clauses forward subsumed 1249
% 1.93/2.14 clauses back subsumed 3
% 1.93/2.14 Kbytes malloced 1953
% 1.93/2.14
% 1.93/2.14 ----------- times (seconds) -----------
% 1.93/2.14 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.93/2.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.14 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.14
% 1.93/2.14 That finishes the proof of the theorem.
% 1.93/2.14
% 1.93/2.14 Process 26805 finished Wed Jul 27 08:50:26 2022
% 1.93/2.14 Otter interrupted
% 1.93/2.14 PROOF FOUND
%------------------------------------------------------------------------------