TSTP Solution File: LAT040-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT040-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:51 EDT 2022
% Result : Unsatisfiable 1.92s 2.17s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 18 RR)
% Number of literals : 34 ( 33 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; 3 con; 0-2 aty)
% Number of variables : 37 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
yy != zz,
file('LAT040-1.p',unknown),
[] ).
cnf(2,plain,
zz != yy,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(5,axiom,
meet(A,A) = A,
file('LAT040-1.p',unknown),
[] ).
cnf(10,axiom,
join(A,meet(A,B)) = A,
file('LAT040-1.p',unknown),
[] ).
cnf(12,axiom,
meet(A,B) = meet(B,A),
file('LAT040-1.p',unknown),
[] ).
cnf(13,axiom,
join(A,B) = join(B,A),
file('LAT040-1.p',unknown),
[] ).
cnf(15,axiom,
meet(meet(A,B),C) = meet(A,meet(B,C)),
file('LAT040-1.p',unknown),
[] ).
cnf(18,axiom,
join(A,meet(B,C)) = meet(join(A,B),join(A,C)),
file('LAT040-1.p',unknown),
[] ).
cnf(19,plain,
meet(join(A,B),join(A,C)) = join(A,meet(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18])]),
[iquote('copy,18,flip.1')] ).
cnf(22,axiom,
meet(A,join(B,C)) = join(meet(A,B),meet(A,C)),
file('LAT040-1.p',unknown),
[] ).
cnf(23,axiom,
join(xx,yy) = join(xx,zz),
file('LAT040-1.p',unknown),
[] ).
cnf(24,plain,
join(xx,zz) = join(xx,yy),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[23])]),
[iquote('copy,23,flip.1')] ).
cnf(26,axiom,
meet(xx,yy) = meet(xx,zz),
file('LAT040-1.p',unknown),
[] ).
cnf(28,plain,
meet(xx,zz) = meet(xx,yy),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[26])]),
[iquote('copy,26,flip.1')] ).
cnf(29,plain,
join(meet(join(A,B),A),meet(join(A,B),C)) = join(A,meet(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),22]),
[iquote('back_demod,19,demod,22')] ).
cnf(31,plain,
join(A,meet(B,A)) = A,
inference(para_from,[status(thm),theory(equality)],[12,10]),
[iquote('para_from,12.1.1,10.1.1.2')] ).
cnf(34,plain,
join(meet(A,B),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,10])]),
[iquote('para_into,13.1.1,10.1.1,flip.1')] ).
cnf(35,plain,
join(zz,xx) = join(xx,yy),
inference(para_into,[status(thm),theory(equality)],[24,13]),
[iquote('para_into,24.1.1,13.1.1')] ).
cnf(38,plain,
meet(zz,xx) = meet(xx,yy),
inference(para_into,[status(thm),theory(equality)],[28,12]),
[iquote('para_into,27.1.1,12.1.1')] ).
cnf(39,plain,
join(zz,meet(xx,yy)) = zz,
inference(para_into,[status(thm),theory(equality)],[31,28]),
[iquote('para_into,31.1.1.2,27.1.1')] ).
cnf(43,plain,
meet(xx,meet(zz,A)) = meet(xx,meet(yy,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,28]),15])]),
[iquote('para_into,14.1.1.1,27.1.1,demod,15,flip.1')] ).
cnf(52,plain,
join(A,meet(B,meet(C,A))) = A,
inference(para_from,[status(thm),theory(equality)],[15,31]),
[iquote('para_from,14.1.1,31.1.1.2')] ).
cnf(63,plain,
join(zz,meet(yy,xx)) = zz,
inference(para_into,[status(thm),theory(equality)],[39,12]),
[iquote('para_into,39.1.1.2,12.1.1')] ).
cnf(113,plain,
join(meet(A,zz),meet(A,xx)) = join(meet(A,xx),meet(A,yy)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[22,35]),22])]),
[iquote('para_into,21.1.1.2,35.1.1,demod,22,flip.1')] ).
cnf(132,plain,
join(A,meet(B,meet(C,meet(D,A)))) = A,
inference(para_into,[status(thm),theory(equality)],[52,15]),
[iquote('para_into,52.1.1.2.2,14.1.1')] ).
cnf(198,plain,
meet(join(A,B),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,52]),132]),
[iquote('para_into,29.1.1,52.1.1,demod,132')] ).
cnf(215,plain,
meet(join(xx,yy),zz) = zz,
inference(para_into,[status(thm),theory(equality)],[198,35]),
[iquote('para_into,198.1.1.1,35.1.1')] ).
cnf(223,plain,
meet(join(yy,xx),zz) = zz,
inference(para_into,[status(thm),theory(equality)],[215,13]),
[iquote('para_into,215.1.1.1,13.1.1')] ).
cnf(237,plain,
join(meet(zz,yy),meet(xx,yy)) = zz,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[223,12]),22,38]),
[iquote('para_into,223.1.1,12.1.1,demod,22,38')] ).
cnf(248,plain,
meet(xx,meet(yy,zz)) = meet(xx,yy),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[43,5]),28])]),
[iquote('para_into,43.1.1.2,4.1.1,demod,28,flip.1')] ).
cnf(432,plain,
join(meet(yy,zz),meet(xx,yy)) = zz,
inference(para_into,[status(thm),theory(equality)],[237,12]),
[iquote('para_into,237.1.1.1,12.1.1')] ).
cnf(473,plain,
meet(yy,zz) = zz,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[248,31]),432])]),
[iquote('para_from,248.1.1,31.1.1.2,demod,432,flip.1')] ).
cnf(1670,plain,
zz = yy,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[113,473]),63,5,34]),
[iquote('para_into,113.1.1.1,473.1.1,demod,63,5,34')] ).
cnf(1672,plain,
$false,
inference(binary,[status(thm)],[1670,2]),
[iquote('binary,1670.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 08:24:01 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.92/2.17 ----- Otter 3.3f, August 2004 -----
% 1.92/2.17 The process was started by sandbox on n006.cluster.edu,
% 1.92/2.17 Wed Jul 27 08:24:02 2022
% 1.92/2.17 The command was "./otter". The process ID is 24105.
% 1.92/2.17
% 1.92/2.17 set(prolog_style_variables).
% 1.92/2.17 set(auto).
% 1.92/2.17 dependent: set(auto1).
% 1.92/2.17 dependent: set(process_input).
% 1.92/2.17 dependent: clear(print_kept).
% 1.92/2.17 dependent: clear(print_new_demod).
% 1.92/2.17 dependent: clear(print_back_demod).
% 1.92/2.17 dependent: clear(print_back_sub).
% 1.92/2.17 dependent: set(control_memory).
% 1.92/2.17 dependent: assign(max_mem, 12000).
% 1.92/2.17 dependent: assign(pick_given_ratio, 4).
% 1.92/2.17 dependent: assign(stats_level, 1).
% 1.92/2.17 dependent: assign(max_seconds, 10800).
% 1.92/2.17 clear(print_given).
% 1.92/2.17
% 1.92/2.17 list(usable).
% 1.92/2.17 0 [] A=A.
% 1.92/2.17 0 [] meet(X,X)=X.
% 1.92/2.17 0 [] join(X,X)=X.
% 1.92/2.17 0 [] meet(X,join(X,Y))=X.
% 1.92/2.17 0 [] join(X,meet(X,Y))=X.
% 1.92/2.17 0 [] meet(X,Y)=meet(Y,X).
% 1.92/2.17 0 [] join(X,Y)=join(Y,X).
% 1.92/2.17 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 1.92/2.17 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 1.92/2.17 0 [] join(X,meet(Y,Z))=meet(join(X,Y),join(X,Z)).
% 1.92/2.17 0 [] meet(X,join(Y,Z))=join(meet(X,Y),meet(X,Z)).
% 1.92/2.17 0 [] join(xx,yy)=join(xx,zz).
% 1.92/2.17 0 [] meet(xx,yy)=meet(xx,zz).
% 1.92/2.17 0 [] yy!=zz.
% 1.92/2.17 end_of_list.
% 1.92/2.17
% 1.92/2.17 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.92/2.17
% 1.92/2.17 All clauses are units, and equality is present; the
% 1.92/2.17 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.92/2.17
% 1.92/2.17 dependent: set(knuth_bendix).
% 1.92/2.17 dependent: set(anl_eq).
% 1.92/2.17 dependent: set(para_from).
% 1.92/2.17 dependent: set(para_into).
% 1.92/2.17 dependent: clear(para_from_right).
% 1.92/2.17 dependent: clear(para_into_right).
% 1.92/2.17 dependent: set(para_from_vars).
% 1.92/2.17 dependent: set(eq_units_both_ways).
% 1.92/2.17 dependent: set(dynamic_demod_all).
% 1.92/2.17 dependent: set(dynamic_demod).
% 1.92/2.17 dependent: set(order_eq).
% 1.92/2.17 dependent: set(back_demod).
% 1.92/2.17 dependent: set(lrpo).
% 1.92/2.17
% 1.92/2.17 ------------> process usable:
% 1.92/2.17 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] zz!=yy.
% 1.92/2.17
% 1.92/2.17 ------------> process sos:
% 1.92/2.17 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.92/2.17 ** KEPT (pick-wt=5): 4 [] meet(A,A)=A.
% 1.92/2.17 ---> New Demodulator: 5 [new_demod,4] meet(A,A)=A.
% 1.92/2.17 ** KEPT (pick-wt=5): 6 [] join(A,A)=A.
% 1.92/2.17 ---> New Demodulator: 7 [new_demod,6] join(A,A)=A.
% 1.92/2.17 ** KEPT (pick-wt=7): 8 [] meet(A,join(A,B))=A.
% 1.92/2.17 ---> New Demodulator: 9 [new_demod,8] meet(A,join(A,B))=A.
% 1.92/2.17 ** KEPT (pick-wt=7): 10 [] join(A,meet(A,B))=A.
% 1.92/2.17 ---> New Demodulator: 11 [new_demod,10] join(A,meet(A,B))=A.
% 1.92/2.17 ** KEPT (pick-wt=7): 12 [] meet(A,B)=meet(B,A).
% 1.92/2.17 ** KEPT (pick-wt=7): 13 [] join(A,B)=join(B,A).
% 1.92/2.17 ** KEPT (pick-wt=11): 14 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.92/2.17 ---> New Demodulator: 15 [new_demod,14] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.92/2.17 ** KEPT (pick-wt=11): 16 [] join(join(A,B),C)=join(A,join(B,C)).
% 1.92/2.17 ---> New Demodulator: 17 [new_demod,16] join(join(A,B),C)=join(A,join(B,C)).
% 1.92/2.17 ** KEPT (pick-wt=13): 19 [copy,18,flip.1] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.92/2.17 ---> New Demodulator: 20 [new_demod,19] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.92/2.17 ** KEPT (pick-wt=13): 21 [] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.92/2.17 ---> New Demodulator: 22 [new_demod,21] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.92/2.17 ** KEPT (pick-wt=7): 24 [copy,23,flip.1] join(xx,zz)=join(xx,yy).
% 1.92/2.17 ---> New Demodulator: 25 [new_demod,24] join(xx,zz)=join(xx,yy).
% 1.92/2.17 ** KEPT (pick-wt=7): 27 [copy,26,flip.1] meet(xx,zz)=meet(xx,yy).
% 1.92/2.17 ---> New Demodulator: 28 [new_demod,27] meet(xx,zz)=meet(xx,yy).
% 1.92/2.17 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.92/2.17 >>>> Starting back demodulation with 5.
% 1.92/2.17 >>>> Starting back demodulation with 7.
% 1.92/2.17 >>>> Starting back demodulation with 9.
% 1.92/2.17 >>>> Starting back demodulation with 11.
% 1.92/2.17 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] meet(A,B)=meet(B,A).
% 1.92/2.17 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] join(A,B)=join(B,A).
% 1.92/2.17 >>>> Starting back demodulation with 15.
% 1.92/2.17 >>>> Starting back demodulation with 17.
% 1.92/2.17 >>>> Starting back demodulation with 20.
% 1.92/2.17 >>>> Starting back demodulation with 22.
% 1.92/2.17 >> back demodulating 19 with 22.
% 1.92/2.17 >> back demodulating 8 with 22.
% 1.92/2.17 >>>> Starting back demodulation with 25.
% 1.92/2.17 >>>> Starting back demodulation with 28.
% 1.92/2.17 >>>> Starting back demodulation with 30.
% 1.92/2.17
% 1.92/2.17 ======= end of input processing =======
% 1.92/2.17
% 1.92/2.17 =========== start of search ===========
% 1.92/2.17
% 1.92/2.17 -------- PROOF --------
% 1.92/2.17
% 1.92/2.17 ----> UNIT CONFLICT at 0.06 sec ----> 1672 [binary,1670.1,2.1] $F.
% 1.92/2.17
% 1.92/2.17 Length of proof is 23. Level of proof is 10.
% 1.92/2.17
% 1.92/2.17 ---------------- PROOF ----------------
% 1.92/2.17 % SZS status Unsatisfiable
% 1.92/2.17 % SZS output start Refutation
% See solution above
% 1.92/2.17 ------------ end of proof -------------
% 1.92/2.17
% 1.92/2.17
% 1.92/2.17 Search stopped by max_proofs option.
% 1.92/2.17
% 1.92/2.17
% 1.92/2.17 Search stopped by max_proofs option.
% 1.92/2.17
% 1.92/2.17 ============ end of search ============
% 1.92/2.17
% 1.92/2.17 -------------- statistics -------------
% 1.92/2.17 clauses given 126
% 1.92/2.17 clauses generated 6417
% 1.92/2.17 clauses kept 940
% 1.92/2.17 clauses forward subsumed 5888
% 1.92/2.17 clauses back subsumed 17
% 1.92/2.17 Kbytes malloced 3906
% 1.92/2.17
% 1.92/2.17 ----------- times (seconds) -----------
% 1.92/2.17 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 1.92/2.17 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.17 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.17
% 1.92/2.17 That finishes the proof of the theorem.
% 1.92/2.17
% 1.92/2.17 Process 24105 finished Wed Jul 27 08:24:03 2022
% 1.92/2.17 Otter interrupted
% 1.92/2.17 PROOF FOUND
%------------------------------------------------------------------------------