TSTP Solution File: LAT090-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT090-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:56 EDT 2022
% Result : Unsatisfiable 1.78s 2.00s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 2 RR)
% Number of literals : 26 ( 25 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 40 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
join(a,a) != a,
file('LAT090-1.p',unknown),
[] ).
cnf(3,axiom,
join(meet(A,B),meet(A,join(A,B))) = A,
file('LAT090-1.p',unknown),
[] ).
cnf(5,axiom,
join(meet(A,A),meet(B,join(A,A))) = A,
file('LAT090-1.p',unknown),
[] ).
cnf(7,axiom,
join(meet(A,B),meet(B,join(A,B))) = B,
file('LAT090-1.p',unknown),
[] ).
cnf(9,axiom,
meet(meet(join(A,B),join(C,A)),A) = A,
file('LAT090-1.p',unknown),
[] ).
cnf(11,axiom,
join(join(meet(A,B),meet(C,A)),A) = A,
file('LAT090-1.p',unknown),
[] ).
cnf(13,plain,
join(meet(meet(A,B),meet(A,join(A,B))),meet(meet(A,B),A)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.2.2,3.1.1')] ).
cnf(15,plain,
join(meet(meet(A,A),meet(B,join(A,A))),meet(meet(A,A),A)) = meet(A,A),
inference(para_from,[status(thm),theory(equality)],[5,3]),
[iquote('para_from,5.1.1,3.1.1.2.2')] ).
cnf(19,plain,
join(meet(meet(A,A),meet(B,join(A,A))),meet(meet(B,join(A,A)),A)) = meet(B,join(A,A)),
inference(para_into,[status(thm),theory(equality)],[7,5]),
[iquote('para_into,7.1.1.2.2,5.1.1')] ).
cnf(43,plain,
join(join(meet(A,B),A),A) = A,
inference(para_into,[status(thm),theory(equality)],[11,9]),
[iquote('para_into,11.1.1.1.2,9.1.1')] ).
cnf(46,plain,
meet(meet(join(A,B),A),A) = A,
inference(para_from,[status(thm),theory(equality)],[11,9]),
[iquote('para_from,11.1.1,9.1.1.1.2')] ).
cnf(63,plain,
join(meet(join(meet(A,B),A),A),meet(A,A)) = A,
inference(para_from,[status(thm),theory(equality)],[43,7]),
[iquote('para_from,43.1.1,7.1.1.2.2')] ).
cnf(73,plain,
meet(meet(A,meet(B,A)),meet(B,A)) = meet(B,A),
inference(para_into,[status(thm),theory(equality)],[46,7]),
[iquote('para_into,45.1.1.1.1,7.1.1')] ).
cnf(122,plain,
meet(meet(A,A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,46]),46,46]),
[iquote('para_into,73.1.1.1.2,45.1.1,demod,46,46')] ).
cnf(132,plain,
join(meet(meet(A,A),meet(B,join(A,A))),A) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),122]),
[iquote('back_demod,15,demod,122')] ).
cnf(149,plain,
join(meet(A,meet(meet(A,A),join(meet(A,A),A))),meet(A,meet(A,A))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[122,13]),122,122]),
[iquote('para_from,121.1.1,13.1.1.2.1,demod,122,122')] ).
cnf(153,plain,
join(A,meet(A,join(meet(A,A),A))) = A,
inference(para_from,[status(thm),theory(equality)],[122,7]),
[iquote('para_from,121.1.1,7.1.1.1')] ).
cnf(157,plain,
meet(meet(A,join(B,A)),A) = A,
inference(para_from,[status(thm),theory(equality)],[153,9]),
[iquote('para_from,153.1.1,9.1.1.1.1')] ).
cnf(170,plain,
meet(A,meet(A,A)) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[157,63]),122]),
[iquote('para_into,157.1.1.1.2,63.1.1,demod,122')] ).
cnf(187,plain,
join(meet(A,meet(meet(A,A),join(meet(A,A),A))),meet(A,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[149]),170]),
[iquote('back_demod,149,demod,170')] ).
cnf(204,plain,
meet(A,join(A,A)) = meet(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,157]),132])]),
[iquote('para_into,19.1.1.2,157.1.1,demod,132,flip.1')] ).
cnf(218,plain,
meet(meet(A,A),meet(A,A)) = meet(A,A),
inference(para_from,[status(thm),theory(equality)],[170,73]),
[iquote('para_from,169.1.1,73.1.1.1')] ).
cnf(234,plain,
join(meet(A,A),A) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[204,19]),204,218,122,204]),
[iquote('para_from,203.1.1,19.1.1.2.1,demod,204,218,122,204')] ).
cnf(238,plain,
meet(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[204,43]),234,234]),
[iquote('para_from,203.1.1,43.1.1.1.1,demod,234,234')] ).
cnf(247,plain,
join(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[187]),238,238,204,238,238,238]),
[iquote('back_demod,187,demod,238,238,204,238,238,238')] ).
cnf(249,plain,
$false,
inference(binary,[status(thm)],[247,1]),
[iquote('binary,247.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT090-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 08:20:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.78/2.00 ----- Otter 3.3f, August 2004 -----
% 1.78/2.00 The process was started by sandbox2 on n007.cluster.edu,
% 1.78/2.00 Wed Jul 27 08:20:01 2022
% 1.78/2.00 The command was "./otter". The process ID is 4698.
% 1.78/2.00
% 1.78/2.00 set(prolog_style_variables).
% 1.78/2.00 set(auto).
% 1.78/2.00 dependent: set(auto1).
% 1.78/2.00 dependent: set(process_input).
% 1.78/2.00 dependent: clear(print_kept).
% 1.78/2.00 dependent: clear(print_new_demod).
% 1.78/2.00 dependent: clear(print_back_demod).
% 1.78/2.00 dependent: clear(print_back_sub).
% 1.78/2.00 dependent: set(control_memory).
% 1.78/2.00 dependent: assign(max_mem, 12000).
% 1.78/2.00 dependent: assign(pick_given_ratio, 4).
% 1.78/2.00 dependent: assign(stats_level, 1).
% 1.78/2.00 dependent: assign(max_seconds, 10800).
% 1.78/2.00 clear(print_given).
% 1.78/2.00
% 1.78/2.00 list(usable).
% 1.78/2.00 0 [] A=A.
% 1.78/2.00 0 [] join(meet(A,B),meet(A,join(A,B)))=A.
% 1.78/2.00 0 [] join(meet(A,A),meet(B,join(A,A)))=A.
% 1.78/2.00 0 [] join(meet(A,B),meet(B,join(A,B)))=B.
% 1.78/2.00 0 [] meet(meet(join(A,B),join(C,A)),A)=A.
% 1.78/2.00 0 [] join(join(meet(A,B),meet(C,A)),A)=A.
% 1.78/2.00 0 [] join(a,a)!=a.
% 1.78/2.00 end_of_list.
% 1.78/2.00
% 1.78/2.00 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.78/2.00
% 1.78/2.00 All clauses are units, and equality is present; the
% 1.78/2.00 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.78/2.00
% 1.78/2.00 dependent: set(knuth_bendix).
% 1.78/2.00 dependent: set(anl_eq).
% 1.78/2.00 dependent: set(para_from).
% 1.78/2.00 dependent: set(para_into).
% 1.78/2.00 dependent: clear(para_from_right).
% 1.78/2.00 dependent: clear(para_into_right).
% 1.78/2.00 dependent: set(para_from_vars).
% 1.78/2.00 dependent: set(eq_units_both_ways).
% 1.78/2.00 dependent: set(dynamic_demod_all).
% 1.78/2.00 dependent: set(dynamic_demod).
% 1.78/2.00 dependent: set(order_eq).
% 1.78/2.00 dependent: set(back_demod).
% 1.78/2.00 dependent: set(lrpo).
% 1.78/2.00
% 1.78/2.00 ------------> process usable:
% 1.78/2.00 ** KEPT (pick-wt=5): 1 [] join(a,a)!=a.
% 1.78/2.00
% 1.78/2.00 ------------> process sos:
% 1.78/2.00 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.78/2.00 ** KEPT (pick-wt=11): 3 [] join(meet(A,B),meet(A,join(A,B)))=A.
% 1.78/2.00 ---> New Demodulator: 4 [new_demod,3] join(meet(A,B),meet(A,join(A,B)))=A.
% 1.78/2.00 ** KEPT (pick-wt=11): 5 [] join(meet(A,A),meet(B,join(A,A)))=A.
% 1.78/2.00 ---> New Demodulator: 6 [new_demod,5] join(meet(A,A),meet(B,join(A,A)))=A.
% 1.78/2.00 ** KEPT (pick-wt=11): 7 [] join(meet(A,B),meet(B,join(A,B)))=B.
% 1.78/2.00 ---> New Demodulator: 8 [new_demod,7] join(meet(A,B),meet(B,join(A,B)))=B.
% 1.78/2.00 ** KEPT (pick-wt=11): 9 [] meet(meet(join(A,B),join(C,A)),A)=A.
% 1.78/2.00 ---> New Demodulator: 10 [new_demod,9] meet(meet(join(A,B),join(C,A)),A)=A.
% 1.78/2.00 ** KEPT (pick-wt=11): 11 [] join(join(meet(A,B),meet(C,A)),A)=A.
% 1.78/2.00 ---> New Demodulator: 12 [new_demod,11] join(join(meet(A,B),meet(C,A)),A)=A.
% 1.78/2.00 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.78/2.00 >>>> Starting back demodulation with 4.
% 1.78/2.00 >>>> Starting back demodulation with 6.
% 1.78/2.00 >>>> Starting back demodulation with 8.
% 1.78/2.00 >>>> Starting back demodulation with 10.
% 1.78/2.00 >>>> Starting back demodulation with 12.
% 1.78/2.00
% 1.78/2.00 ======= end of input processing =======
% 1.78/2.00
% 1.78/2.00 =========== start of search ===========
% 1.78/2.00
% 1.78/2.00 -------- PROOF --------
% 1.78/2.00
% 1.78/2.00 ----> UNIT CONFLICT at 0.01 sec ----> 249 [binary,247.1,1.1] $F.
% 1.78/2.00
% 1.78/2.00 Length of proof is 19. Level of proof is 10.
% 1.78/2.00
% 1.78/2.00 ---------------- PROOF ----------------
% 1.78/2.00 % SZS status Unsatisfiable
% 1.78/2.00 % SZS output start Refutation
% See solution above
% 1.78/2.00 ------------ end of proof -------------
% 1.78/2.00
% 1.78/2.00
% 1.78/2.00 Search stopped by max_proofs option.
% 1.78/2.00
% 1.78/2.00
% 1.78/2.00 Search stopped by max_proofs option.
% 1.78/2.00
% 1.78/2.00 ============ end of search ============
% 1.78/2.00
% 1.78/2.00 -------------- statistics -------------
% 1.78/2.00 clauses given 18
% 1.78/2.00 clauses generated 209
% 1.78/2.00 clauses kept 125
% 1.78/2.00 clauses forward subsumed 107
% 1.78/2.00 clauses back subsumed 0
% 1.78/2.00 Kbytes malloced 2929
% 1.78/2.00
% 1.78/2.00 ----------- times (seconds) -----------
% 1.78/2.00 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.78/2.00 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/2.00 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.78/2.00
% 1.78/2.00 That finishes the proof of the theorem.
% 1.78/2.00
% 1.78/2.00 Process 4698 finished Wed Jul 27 08:20:02 2022
% 1.78/2.00 Otter interrupted
% 1.78/2.00 PROOF FOUND
%------------------------------------------------------------------------------