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