TSTP Solution File: LAT039-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT039-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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.34s 1.88s
% Output : Refutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 9 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
join(xx,meet(yy,zz)) != meet(yy,join(xx,zz)),
file('LAT039-1.p',unknown),
[] ).
cnf(2,plain,
meet(yy,join(xx,zz)) != join(xx,meet(yy,zz)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(18,axiom,
join(A,meet(B,C)) = meet(join(A,B),join(A,C)),
file('LAT039-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('LAT039-1.p',unknown),
[] ).
cnf(24,axiom,
join(xx,yy) = yy,
file('LAT039-1.p',unknown),
[] ).
cnf(25,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(27,plain,
join(meet(yy,xx),meet(yy,zz)) != join(xx,meet(yy,zz)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),22]),
[iquote('back_demod,2,demod,22')] ).
cnf(191,plain,
join(meet(yy,xx),meet(yy,A)) = join(xx,meet(yy,A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[25,24]),24]),
[iquote('para_into,25.1.1.1.1,23.1.1,demod,24')] ).
cnf(193,plain,
$false,
inference(binary,[status(thm)],[191,27]),
[iquote('binary,191.1,27.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LAT039-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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:57:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.34/1.88 ----- Otter 3.3f, August 2004 -----
% 1.34/1.88 The process was started by sandbox2 on n016.cluster.edu,
% 1.34/1.88 Wed Jul 27 08:57:07 2022
% 1.34/1.88 The command was "./otter". The process ID is 20221.
% 1.34/1.88
% 1.34/1.88 set(prolog_style_variables).
% 1.34/1.88 set(auto).
% 1.34/1.88 dependent: set(auto1).
% 1.34/1.88 dependent: set(process_input).
% 1.34/1.88 dependent: clear(print_kept).
% 1.34/1.88 dependent: clear(print_new_demod).
% 1.34/1.88 dependent: clear(print_back_demod).
% 1.34/1.88 dependent: clear(print_back_sub).
% 1.34/1.88 dependent: set(control_memory).
% 1.34/1.88 dependent: assign(max_mem, 12000).
% 1.34/1.88 dependent: assign(pick_given_ratio, 4).
% 1.34/1.88 dependent: assign(stats_level, 1).
% 1.34/1.88 dependent: assign(max_seconds, 10800).
% 1.34/1.88 clear(print_given).
% 1.34/1.88
% 1.34/1.88 list(usable).
% 1.34/1.88 0 [] A=A.
% 1.34/1.88 0 [] meet(X,X)=X.
% 1.34/1.88 0 [] join(X,X)=X.
% 1.34/1.88 0 [] meet(X,join(X,Y))=X.
% 1.34/1.88 0 [] join(X,meet(X,Y))=X.
% 1.34/1.88 0 [] meet(X,Y)=meet(Y,X).
% 1.34/1.88 0 [] join(X,Y)=join(Y,X).
% 1.34/1.88 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 1.34/1.88 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 1.34/1.88 0 [] join(X,meet(Y,Z))=meet(join(X,Y),join(X,Z)).
% 1.34/1.88 0 [] meet(X,join(Y,Z))=join(meet(X,Y),meet(X,Z)).
% 1.34/1.88 0 [] join(xx,yy)=yy.
% 1.34/1.88 0 [] join(xx,meet(yy,zz))!=meet(yy,join(xx,zz)).
% 1.34/1.88 end_of_list.
% 1.34/1.88
% 1.34/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.34/1.88
% 1.34/1.88 All clauses are units, and equality is present; the
% 1.34/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.34/1.88
% 1.34/1.88 dependent: set(knuth_bendix).
% 1.34/1.88 dependent: set(anl_eq).
% 1.34/1.88 dependent: set(para_from).
% 1.34/1.88 dependent: set(para_into).
% 1.34/1.88 dependent: clear(para_from_right).
% 1.34/1.88 dependent: clear(para_into_right).
% 1.34/1.88 dependent: set(para_from_vars).
% 1.34/1.88 dependent: set(eq_units_both_ways).
% 1.34/1.88 dependent: set(dynamic_demod_all).
% 1.34/1.88 dependent: set(dynamic_demod).
% 1.34/1.88 dependent: set(order_eq).
% 1.34/1.88 dependent: set(back_demod).
% 1.34/1.88 dependent: set(lrpo).
% 1.34/1.88
% 1.34/1.88 ------------> process usable:
% 1.34/1.88 ** KEPT (pick-wt=11): 2 [copy,1,flip.1] meet(yy,join(xx,zz))!=join(xx,meet(yy,zz)).
% 1.34/1.88
% 1.34/1.88 ------------> process sos:
% 1.34/1.88 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.34/1.88 ** KEPT (pick-wt=5): 4 [] meet(A,A)=A.
% 1.34/1.88 ---> New Demodulator: 5 [new_demod,4] meet(A,A)=A.
% 1.34/1.88 ** KEPT (pick-wt=5): 6 [] join(A,A)=A.
% 1.34/1.88 ---> New Demodulator: 7 [new_demod,6] join(A,A)=A.
% 1.34/1.88 ** KEPT (pick-wt=7): 8 [] meet(A,join(A,B))=A.
% 1.34/1.88 ---> New Demodulator: 9 [new_demod,8] meet(A,join(A,B))=A.
% 1.34/1.88 ** KEPT (pick-wt=7): 10 [] join(A,meet(A,B))=A.
% 1.34/1.88 ---> New Demodulator: 11 [new_demod,10] join(A,meet(A,B))=A.
% 1.34/1.88 ** KEPT (pick-wt=7): 12 [] meet(A,B)=meet(B,A).
% 1.34/1.88 ** KEPT (pick-wt=7): 13 [] join(A,B)=join(B,A).
% 1.34/1.88 ** KEPT (pick-wt=11): 14 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.34/1.88 ---> New Demodulator: 15 [new_demod,14] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.34/1.88 ** KEPT (pick-wt=11): 16 [] join(join(A,B),C)=join(A,join(B,C)).
% 1.34/1.88 ---> New Demodulator: 17 [new_demod,16] join(join(A,B),C)=join(A,join(B,C)).
% 1.34/1.88 ** KEPT (pick-wt=13): 19 [copy,18,flip.1] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.34/1.88 ---> New Demodulator: 20 [new_demod,19] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.34/1.88 ** KEPT (pick-wt=13): 21 [] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.34/1.88 ---> New Demodulator: 22 [new_demod,21] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.34/1.88 ** KEPT (pick-wt=5): 23 [] join(xx,yy)=yy.
% 1.34/1.88 ---> New Demodulator: 24 [new_demod,23] join(xx,yy)=yy.
% 1.34/1.88 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.34/1.88 >>>> Starting back demodulation with 5.
% 1.34/1.88 >>>> Starting back demodulation with 7.
% 1.34/1.88 >>>> Starting back demodulation with 9.
% 1.34/1.88 >>>> Starting back demodulation with 11.
% 1.34/1.88 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] meet(A,B)=meet(B,A).
% 1.34/1.88 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] join(A,B)=join(B,A).
% 1.34/1.88 >>>> Starting back demodulation with 15.
% 1.34/1.88 >>>> Starting back demodulation with 17.
% 1.34/1.88 >>>> Starting back demodulation with 20.
% 1.34/1.88 >>>> Starting back demodulation with 22.
% 1.34/1.88 >> back demodulating 19 with 22.
% 1.34/1.88 >> back demodulating 8 with 22.
% 1.34/1.88 >> back demodulating 2 with 22.
% 1.34/1.88 >>>> Starting back demodulation with 24.
% 1.34/1.88 >>>> Starting back demodulation with 26.
% 1.34/1.88
% 1.34/1.88 ======= end of input processing =======
% 1.34/1.88
% 1.34/1.88 =========== start of search ===========
% 1.34/1.88
% 1.34/1.88 -------- PROOF --------
% 1.34/1.88
% 1.34/1.88 ----> UNIT CONFLICT at 0.01 sec ----> 193 [binary,191.1,27.1] $F.
% 1.34/1.88
% 1.34/1.88 Length of proof is 5. Level of proof is 3.
% 1.34/1.88
% 1.34/1.88 ---------------- PROOF ----------------
% 1.34/1.88 % SZS status Unsatisfiable
% 1.34/1.88 % SZS output start Refutation
% See solution above
% 1.34/1.88 ------------ end of proof -------------
% 1.34/1.88
% 1.34/1.88
% 1.34/1.88 Search stopped by max_proofs option.
% 1.34/1.88
% 1.34/1.88
% 1.34/1.88 Search stopped by max_proofs option.
% 1.34/1.88
% 1.34/1.88 ============ end of search ============
% 1.34/1.88
% 1.34/1.88 -------------- statistics -------------
% 1.34/1.88 clauses given 26
% 1.34/1.88 clauses generated 314
% 1.34/1.88 clauses kept 104
% 1.34/1.88 clauses forward subsumed 242
% 1.34/1.88 clauses back subsumed 0
% 1.34/1.88 Kbytes malloced 1953
% 1.34/1.88
% 1.34/1.88 ----------- times (seconds) -----------
% 1.34/1.88 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.34/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.34/1.88 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.34/1.88
% 1.34/1.88 That finishes the proof of the theorem.
% 1.34/1.88
% 1.34/1.88 Process 20221 finished Wed Jul 27 08:57:09 2022
% 1.34/1.88 Otter interrupted
% 1.34/1.88 PROOF FOUND
%------------------------------------------------------------------------------