TSTP Solution File: LAT032-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT032-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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.82s 2.00s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 5 RR)
% Number of literals : 28 ( 27 equ; 4 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 : 61 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(xx,join(yy,zz)) != join(meet(xx,yy),meet(xx,zz)),
file('LAT032-1.p',unknown),
[] ).
cnf(7,axiom,
meet(A,join(A,B)) = A,
file('LAT032-1.p',unknown),
[] ).
cnf(9,axiom,
join(A,meet(A,B)) = A,
file('LAT032-1.p',unknown),
[] ).
cnf(11,axiom,
meet(A,B) = meet(B,A),
file('LAT032-1.p',unknown),
[] ).
cnf(12,axiom,
join(A,B) = join(B,A),
file('LAT032-1.p',unknown),
[] ).
cnf(14,axiom,
meet(meet(A,B),C) = meet(A,meet(B,C)),
file('LAT032-1.p',unknown),
[] ).
cnf(15,axiom,
join(join(A,B),C) = join(A,join(B,C)),
file('LAT032-1.p',unknown),
[] ).
cnf(17,axiom,
join(A,meet(B,C)) = meet(join(A,B),join(A,C)),
file('LAT032-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)],[17])]),
[iquote('copy,17,flip.1')] ).
cnf(20,plain,
meet(join(A,B),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,7])]),
[iquote('para_into,11.1.1,7.1.1,flip.1')] ).
cnf(22,plain,
join(A,meet(B,A)) = A,
inference(para_from,[status(thm),theory(equality)],[11,9]),
[iquote('para_from,11.1.1,9.1.1.2')] ).
cnf(24,plain,
meet(join(yy,zz),xx) != join(meet(xx,yy),meet(xx,zz)),
inference(para_from,[status(thm),theory(equality)],[11,1]),
[iquote('para_from,11.1.1,1.1.1')] ).
cnf(25,plain,
join(meet(A,B),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,9])]),
[iquote('para_into,12.1.1,9.1.1,flip.1')] ).
cnf(31,plain,
meet(join(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[20,12]),
[iquote('para_into,20.1.1.1,12.1.1')] ).
cnf(34,plain,
join(meet(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[22,12]),
[iquote('para_into,22.1.1,12.1.1')] ).
cnf(40,plain,
meet(A,meet(B,A)) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[25,7]),14]),
[iquote('para_from,25.1.1,7.1.1.2,demod,14')] ).
cnf(67,plain,
join(meet(A,B),join(B,C)) = join(B,C),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,34])]),
[iquote('para_into,15.1.1.1,34.1.1,flip.1')] ).
cnf(73,plain,
join(A,join(meet(B,A),C)) = join(A,C),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,22])]),
[iquote('para_into,15.1.1.1,22.1.1,flip.1')] ).
cnf(122,plain,
meet(join(A,B),join(B,C)) = join(B,meet(A,C)),
inference(para_into,[status(thm),theory(equality)],[19,12]),
[iquote('para_into,18.1.1.1,12.1.1')] ).
cnf(134,plain,
join(A,meet(B,C)) = join(A,meet(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,11]),19]),
[iquote('para_into,18.1.1,11.1.1,demod,19')] ).
cnf(140,plain,
meet(join(A,meet(B,C)),D) = meet(join(A,B),meet(join(A,C),D)),
inference(para_from,[status(thm),theory(equality)],[19,14]),
[iquote('para_from,18.1.1,13.1.1.1')] ).
cnf(193,plain,
meet(join(zz,yy),xx) != join(meet(xx,yy),meet(xx,zz)),
inference(para_into,[status(thm),theory(equality)],[24,12]),
[iquote('para_into,24.1.1.1,12.1.1')] ).
cnf(384,plain,
join(meet(A,B),join(meet(B,A),C)) = join(meet(B,A),C),
inference(para_into,[status(thm),theory(equality)],[67,40]),
[iquote('para_into,67.1.1.1,40.1.1')] ).
cnf(445,plain,
join(meet(A,B),C) = join(meet(B,A),C),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,40]),384]),
[iquote('para_into,73.1.1.2.1,40.1.1,demod,384')] ).
cnf(1215,plain,
join(meet(A,B),meet(C,D)) = join(meet(B,A),meet(D,C)),
inference(para_into,[status(thm),theory(equality)],[445,134]),
[iquote('para_into,445.1.1,134.1.1')] ).
cnf(1639,plain,
meet(join(A,B),C) = join(meet(B,C),meet(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[122,34]),140,31]),
[iquote('para_into,122.1.1.2,34.1.1,demod,140,31')] ).
cnf(1861,plain,
join(meet(yy,xx),meet(zz,xx)) != join(meet(xx,yy),meet(xx,zz)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[193]),1639]),
[iquote('back_demod,193,demod,1639')] ).
cnf(1862,plain,
$false,
inference(binary,[status(thm)],[1861,1215]),
[iquote('binary,1861.1,1215.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT032-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Wed Jul 27 08:23:53 EDT 2022
% 0.14/0.33 % CPUTime :
% 1.82/2.00 ----- Otter 3.3f, August 2004 -----
% 1.82/2.00 The process was started by sandbox2 on n021.cluster.edu,
% 1.82/2.00 Wed Jul 27 08:23:53 2022
% 1.82/2.00 The command was "./otter". The process ID is 9037.
% 1.82/2.00
% 1.82/2.00 set(prolog_style_variables).
% 1.82/2.00 set(auto).
% 1.82/2.00 dependent: set(auto1).
% 1.82/2.00 dependent: set(process_input).
% 1.82/2.00 dependent: clear(print_kept).
% 1.82/2.00 dependent: clear(print_new_demod).
% 1.82/2.00 dependent: clear(print_back_demod).
% 1.82/2.00 dependent: clear(print_back_sub).
% 1.82/2.00 dependent: set(control_memory).
% 1.82/2.00 dependent: assign(max_mem, 12000).
% 1.82/2.00 dependent: assign(pick_given_ratio, 4).
% 1.82/2.00 dependent: assign(stats_level, 1).
% 1.82/2.00 dependent: assign(max_seconds, 10800).
% 1.82/2.00 clear(print_given).
% 1.82/2.00
% 1.82/2.00 list(usable).
% 1.82/2.00 0 [] A=A.
% 1.82/2.00 0 [] meet(X,X)=X.
% 1.82/2.00 0 [] join(X,X)=X.
% 1.82/2.00 0 [] meet(X,join(X,Y))=X.
% 1.82/2.00 0 [] join(X,meet(X,Y))=X.
% 1.82/2.00 0 [] meet(X,Y)=meet(Y,X).
% 1.82/2.00 0 [] join(X,Y)=join(Y,X).
% 1.82/2.00 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 1.82/2.00 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 1.82/2.00 0 [] join(X,meet(Y,Z))=meet(join(X,Y),join(X,Z)).
% 1.82/2.00 0 [] meet(xx,join(yy,zz))!=join(meet(xx,yy),meet(xx,zz)).
% 1.82/2.00 end_of_list.
% 1.82/2.00
% 1.82/2.00 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.82/2.00
% 1.82/2.00 All clauses are units, and equality is present; the
% 1.82/2.00 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.82/2.00
% 1.82/2.00 dependent: set(knuth_bendix).
% 1.82/2.00 dependent: set(anl_eq).
% 1.82/2.00 dependent: set(para_from).
% 1.82/2.00 dependent: set(para_into).
% 1.82/2.00 dependent: clear(para_from_right).
% 1.82/2.00 dependent: clear(para_into_right).
% 1.82/2.00 dependent: set(para_from_vars).
% 1.82/2.00 dependent: set(eq_units_both_ways).
% 1.82/2.00 dependent: set(dynamic_demod_all).
% 1.82/2.00 dependent: set(dynamic_demod).
% 1.82/2.00 dependent: set(order_eq).
% 1.82/2.00 dependent: set(back_demod).
% 1.82/2.00 dependent: set(lrpo).
% 1.82/2.00
% 1.82/2.00 ------------> process usable:
% 1.82/2.00 ** KEPT (pick-wt=13): 1 [] meet(xx,join(yy,zz))!=join(meet(xx,yy),meet(xx,zz)).
% 1.82/2.00
% 1.82/2.00 ------------> process sos:
% 1.82/2.00 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.82/2.00 ** KEPT (pick-wt=5): 3 [] meet(A,A)=A.
% 1.82/2.00 ---> New Demodulator: 4 [new_demod,3] meet(A,A)=A.
% 1.82/2.00 ** KEPT (pick-wt=5): 5 [] join(A,A)=A.
% 1.82/2.00 ---> New Demodulator: 6 [new_demod,5] join(A,A)=A.
% 1.82/2.00 ** KEPT (pick-wt=7): 7 [] meet(A,join(A,B))=A.
% 1.82/2.00 ---> New Demodulator: 8 [new_demod,7] meet(A,join(A,B))=A.
% 1.82/2.00 ** KEPT (pick-wt=7): 9 [] join(A,meet(A,B))=A.
% 1.82/2.00 ---> New Demodulator: 10 [new_demod,9] join(A,meet(A,B))=A.
% 1.82/2.00 ** KEPT (pick-wt=7): 11 [] meet(A,B)=meet(B,A).
% 1.82/2.00 ** KEPT (pick-wt=7): 12 [] join(A,B)=join(B,A).
% 1.82/2.00 ** KEPT (pick-wt=11): 13 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.82/2.00 ---> New Demodulator: 14 [new_demod,13] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.82/2.00 ** KEPT (pick-wt=11): 15 [] join(join(A,B),C)=join(A,join(B,C)).
% 1.82/2.00 ---> New Demodulator: 16 [new_demod,15] join(join(A,B),C)=join(A,join(B,C)).
% 1.82/2.00 ** KEPT (pick-wt=13): 18 [copy,17,flip.1] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.82/2.00 ---> New Demodulator: 19 [new_demod,18] meet(join(A,B),join(A,C))=join(A,meet(B,C)).
% 1.82/2.00 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.82/2.00 >>>> Starting back demodulation with 4.
% 1.82/2.00 >>>> Starting back demodulation with 6.
% 1.82/2.00 >>>> Starting back demodulation with 8.
% 1.82/2.00 >>>> Starting back demodulation with 10.
% 1.82/2.00 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] meet(A,B)=meet(B,A).
% 1.82/2.00 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] join(A,B)=join(B,A).
% 1.82/2.00 >>>> Starting back demodulation with 14.
% 1.82/2.00 >>>> Starting back demodulation with 16.
% 1.82/2.00 >>>> Starting back demodulation with 19.
% 1.82/2.00
% 1.82/2.00 ======= end of input processing =======
% 1.82/2.00
% 1.82/2.00 =========== start of search ===========
% 1.82/2.00
% 1.82/2.00 -------- PROOF --------
% 1.82/2.00
% 1.82/2.00 ----> UNIT CONFLICT at 0.10 sec ----> 1862 [binary,1861.1,1215.1] $F.
% 1.82/2.00
% 1.82/2.00 Length of proof is 19. Level of proof is 6.
% 1.82/2.00
% 1.82/2.00 ---------------- PROOF ----------------
% 1.82/2.00 % SZS status Unsatisfiable
% 1.82/2.00 % SZS output start Refutation
% See solution above
% 1.82/2.00 ------------ end of proof -------------
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Search stopped by max_proofs option.
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Search stopped by max_proofs option.
% 1.82/2.00
% 1.82/2.00 ============ end of search ============
% 1.82/2.00
% 1.82/2.00 -------------- statistics -------------
% 1.82/2.00 clauses given 87
% 1.82/2.00 clauses generated 6958
% 1.82/2.00 clauses kept 1107
% 1.82/2.00 clauses forward subsumed 6598
% 1.82/2.00 clauses back subsumed 0
% 1.82/2.00 Kbytes malloced 3906
% 1.82/2.00
% 1.82/2.00 ----------- times (seconds) -----------
% 1.82/2.00 user CPU time 0.10 (0 hr, 0 min, 0 sec)
% 1.82/2.00 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.00 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.82/2.00
% 1.82/2.00 That finishes the proof of the theorem.
% 1.82/2.00
% 1.82/2.00 Process 9037 finished Wed Jul 27 08:23:54 2022
% 1.82/2.00 Otter interrupted
% 1.82/2.00 PROOF FOUND
%------------------------------------------------------------------------------