TSTP Solution File: LAT043-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT043-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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.82s 2.05s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 3 RR)
% Number of literals : 43 ( 42 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
complement(join(c,d)) != meet(complement(c),complement(d)),
file('LAT043-1.p',unknown),
[] ).
cnf(3,axiom,
meet(A,A) = A,
file('LAT043-1.p',unknown),
[] ).
cnf(5,axiom,
join(A,A) = A,
file('LAT043-1.p',unknown),
[] ).
cnf(10,axiom,
join(A,meet(A,B)) = A,
file('LAT043-1.p',unknown),
[] ).
cnf(11,axiom,
meet(A,B) = meet(B,A),
file('LAT043-1.p',unknown),
[] ).
cnf(12,axiom,
join(A,B) = join(B,A),
file('LAT043-1.p',unknown),
[] ).
cnf(14,axiom,
meet(meet(A,B),C) = meet(A,meet(B,C)),
file('LAT043-1.p',unknown),
[] ).
cnf(15,axiom,
join(join(A,B),C) = join(A,join(B,C)),
file('LAT043-1.p',unknown),
[] ).
cnf(17,axiom,
meet(A,join(B,C)) = join(meet(A,B),meet(A,C)),
file('LAT043-1.p',unknown),
[] ).
cnf(19,axiom,
join(complement(A),A) = n1,
file('LAT043-1.p',unknown),
[] ).
cnf(21,axiom,
meet(complement(A),A) = n0,
file('LAT043-1.p',unknown),
[] ).
cnf(23,axiom,
complement(complement(A)) = A,
file('LAT043-1.p',unknown),
[] ).
cnf(26,plain,
join(A,complement(A)) = n1,
inference(para_into,[status(thm),theory(equality)],[19,23]),
[iquote('para_into,19.1.1.1,23.1.1')] ).
cnf(27,plain,
meet(A,complement(A)) = n0,
inference(para_into,[status(thm),theory(equality)],[21,23]),
[iquote('para_into,21.1.1.1,23.1.1')] ).
cnf(32,plain,
join(A,n0) = A,
inference(para_from,[status(thm),theory(equality)],[27,10]),
[iquote('para_from,27.1.1,9.1.1.2')] ).
cnf(35,plain,
join(A,meet(B,A)) = A,
inference(para_from,[status(thm),theory(equality)],[11,10]),
[iquote('para_from,11.1.1,9.1.1.2')] ).
cnf(45,plain,
join(n0,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,32])]),
[iquote('para_into,12.1.1,31.1.1,flip.1')] ).
cnf(49,plain,
complement(join(d,c)) != meet(complement(c),complement(d)),
inference(para_from,[status(thm),theory(equality)],[12,1]),
[iquote('para_from,12.1.1,1.1.1.1')] ).
cnf(51,plain,
meet(n0,A) = n0,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[45,10])]),
[iquote('para_into,45.1.1,9.1.1,flip.1')] ).
cnf(54,plain,
meet(A,meet(complement(A),B)) = n0,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,27]),51])]),
[iquote('para_into,13.1.1.1,27.1.1,demod,51,flip.1')] ).
cnf(61,plain,
meet(A,meet(B,complement(meet(A,B)))) = n0,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,27])]),
[iquote('para_into,13.1.1,27.1.1,flip.1')] ).
cnf(77,plain,
meet(A,meet(B,complement(A))) = n0,
inference(para_into,[status(thm),theory(equality)],[54,11]),
[iquote('para_into,54.1.1.2,11.1.1')] ).
cnf(87,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,35])]),
[iquote('para_into,15.1.1.1,35.1.1,flip.1')] ).
cnf(96,plain,
join(A,join(A,B)) = join(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,5])]),
[iquote('para_into,15.1.1.1,5.1.1,flip.1')] ).
cnf(130,plain,
join(meet(A,complement(B)),meet(A,B)) = meet(A,n1),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,19])]),
[iquote('para_into,17.1.1.2,19.1.1,flip.1')] ).
cnf(164,plain,
join(A,n1) = n1,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[96,26]),26]),
[iquote('para_into,96.1.1.2,25.1.1,demod,26')] ).
cnf(176,plain,
join(meet(A,B),meet(A,n1)) = meet(A,n1),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[164,17])]),
[iquote('para_from,164.1.1,17.1.1.2,flip.1')] ).
cnf(987,plain,
meet(A,n1) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[176,3]),10])]),
[iquote('para_into,176.1.1.1,3.1.1,demod,10,flip.1')] ).
cnf(1052,plain,
join(meet(A,complement(B)),meet(A,B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[130]),987]),
[iquote('back_demod,130,demod,987')] ).
cnf(1098,plain,
meet(A,complement(meet(B,complement(A)))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1052,77]),32]),
[iquote('para_into,1052.1.1.2,77.1.1,demod,32')] ).
cnf(1110,plain,
meet(A,complement(meet(complement(A),B))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1052,54]),32]),
[iquote('para_into,1052.1.1.2,54.1.1,demod,32')] ).
cnf(1114,plain,
join(meet(A,complement(B)),meet(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[1052,11]),
[iquote('para_into,1052.1.1.2,11.1.1')] ).
cnf(1133,plain,
meet(complement(meet(A,complement(B))),B) = B,
inference(para_into,[status(thm),theory(equality)],[1098,11]),
[iquote('para_into,1098.1.1,11.1.1')] ).
cnf(1166,plain,
meet(complement(meet(complement(A),B)),A) = A,
inference(para_into,[status(thm),theory(equality)],[1110,11]),
[iquote('para_into,1110.1.1,11.1.1')] ).
cnf(1195,plain,
meet(complement(meet(A,B)),complement(B)) = complement(B),
inference(para_into,[status(thm),theory(equality)],[1133,23]),
[iquote('para_into,1133.1.1.1.1.2,23.1.1')] ).
cnf(1241,plain,
meet(complement(meet(A,B)),complement(A)) = complement(A),
inference(para_into,[status(thm),theory(equality)],[1166,23]),
[iquote('para_into,1166.1.1.1.1.1,23.1.1')] ).
cnf(1301,plain,
meet(A,complement(meet(B,A))) = meet(A,complement(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1114,61]),14,1241,32])]),
[iquote('para_into,1114.1.1.2,61.1.1,demod,14,1241,32,flip.1')] ).
cnf(1303,plain,
join(complement(A),meet(A,B)) = join(complement(A),B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1114,87])]),
[iquote('para_from,1114.1.1,87.1.1.2,flip.1')] ).
cnf(1306,plain,
complement(meet(A,B)) = join(complement(B),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1195,1114]),1301,1303])]),
[iquote('para_from,1195.1.1,1114.1.1.1,demod,1301,1303,flip.1')] ).
cnf(1421,plain,
complement(join(complement(A),complement(B))) = meet(B,A),
inference(para_from,[status(thm),theory(equality)],[1306,23]),
[iquote('para_from,1306.1.1,23.1.1.1')] ).
cnf(1423,plain,
complement(join(A,complement(B))) = meet(B,complement(A)),
inference(para_into,[status(thm),theory(equality)],[1421,23]),
[iquote('para_into,1421.1.1.1.1,23.1.1')] ).
cnf(1427,plain,
complement(join(A,B)) = meet(complement(B),complement(A)),
inference(para_into,[status(thm),theory(equality)],[1423,23]),
[iquote('para_into,1423.1.1.1.2,23.1.1')] ).
cnf(1429,plain,
$false,
inference(binary,[status(thm)],[1427,49]),
[iquote('binary,1427.1,49.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT043-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n018.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 08:13:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.82/2.02 ----- Otter 3.3f, August 2004 -----
% 1.82/2.02 The process was started by sandbox2 on n018.cluster.edu,
% 1.82/2.02 Wed Jul 27 08:13:16 2022
% 1.82/2.02 The command was "./otter". The process ID is 30406.
% 1.82/2.02
% 1.82/2.02 set(prolog_style_variables).
% 1.82/2.02 set(auto).
% 1.82/2.02 dependent: set(auto1).
% 1.82/2.02 dependent: set(process_input).
% 1.82/2.02 dependent: clear(print_kept).
% 1.82/2.02 dependent: clear(print_new_demod).
% 1.82/2.02 dependent: clear(print_back_demod).
% 1.82/2.02 dependent: clear(print_back_sub).
% 1.82/2.02 dependent: set(control_memory).
% 1.82/2.02 dependent: assign(max_mem, 12000).
% 1.82/2.02 dependent: assign(pick_given_ratio, 4).
% 1.82/2.02 dependent: assign(stats_level, 1).
% 1.82/2.02 dependent: assign(max_seconds, 10800).
% 1.82/2.02 clear(print_given).
% 1.82/2.02
% 1.82/2.02 list(usable).
% 1.82/2.02 0 [] A=A.
% 1.82/2.02 0 [] meet(X,X)=X.
% 1.82/2.02 0 [] join(X,X)=X.
% 1.82/2.02 0 [] meet(X,join(X,Y))=X.
% 1.82/2.02 0 [] join(X,meet(X,Y))=X.
% 1.82/2.02 0 [] meet(X,Y)=meet(Y,X).
% 1.82/2.02 0 [] join(X,Y)=join(Y,X).
% 1.82/2.02 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 1.82/2.02 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 1.82/2.02 0 [] meet(X,join(Y,Z))=join(meet(X,Y),meet(X,Z)).
% 1.82/2.02 0 [] join(complement(X),X)=n1.
% 1.82/2.02 0 [] meet(complement(X),X)=n0.
% 1.82/2.02 0 [] complement(complement(X))=X.
% 1.82/2.02 0 [] complement(join(c,d))!=meet(complement(c),complement(d)).
% 1.82/2.02 end_of_list.
% 1.82/2.02
% 1.82/2.02 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.82/2.02
% 1.82/2.02 All clauses are units, and equality is present; the
% 1.82/2.02 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.82/2.02
% 1.82/2.02 dependent: set(knuth_bendix).
% 1.82/2.02 dependent: set(anl_eq).
% 1.82/2.02 dependent: set(para_from).
% 1.82/2.02 dependent: set(para_into).
% 1.82/2.02 dependent: clear(para_from_right).
% 1.82/2.02 dependent: clear(para_into_right).
% 1.82/2.02 dependent: set(para_from_vars).
% 1.82/2.02 dependent: set(eq_units_both_ways).
% 1.82/2.02 dependent: set(dynamic_demod_all).
% 1.82/2.02 dependent: set(dynamic_demod).
% 1.82/2.02 dependent: set(order_eq).
% 1.82/2.02 dependent: set(back_demod).
% 1.82/2.02 dependent: set(lrpo).
% 1.82/2.02
% 1.82/2.02 ------------> process usable:
% 1.82/2.02 ** KEPT (pick-wt=10): 1 [] complement(join(c,d))!=meet(complement(c),complement(d)).
% 1.82/2.02
% 1.82/2.02 ------------> process sos:
% 1.82/2.02 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.82/2.02 ** KEPT (pick-wt=5): 3 [] meet(A,A)=A.
% 1.82/2.02 ---> New Demodulator: 4 [new_demod,3] meet(A,A)=A.
% 1.82/2.02 ** KEPT (pick-wt=5): 5 [] join(A,A)=A.
% 1.82/2.02 ---> New Demodulator: 6 [new_demod,5] join(A,A)=A.
% 1.82/2.02 ** KEPT (pick-wt=7): 7 [] meet(A,join(A,B))=A.
% 1.82/2.02 ---> New Demodulator: 8 [new_demod,7] meet(A,join(A,B))=A.
% 1.82/2.02 ** KEPT (pick-wt=7): 9 [] join(A,meet(A,B))=A.
% 1.82/2.02 ---> New Demodulator: 10 [new_demod,9] join(A,meet(A,B))=A.
% 1.82/2.02 ** KEPT (pick-wt=7): 11 [] meet(A,B)=meet(B,A).
% 1.82/2.02 ** KEPT (pick-wt=7): 12 [] join(A,B)=join(B,A).
% 1.82/2.02 ** KEPT (pick-wt=11): 13 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.82/2.02 ---> New Demodulator: 14 [new_demod,13] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.82/2.02 ** KEPT (pick-wt=11): 15 [] join(join(A,B),C)=join(A,join(B,C)).
% 1.82/2.02 ---> New Demodulator: 16 [new_demod,15] join(join(A,B),C)=join(A,join(B,C)).
% 1.82/2.02 ** KEPT (pick-wt=13): 17 [] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.82/2.02 ---> New Demodulator: 18 [new_demod,17] meet(A,join(B,C))=join(meet(A,B),meet(A,C)).
% 1.82/2.02 ** KEPT (pick-wt=6): 19 [] join(complement(A),A)=n1.
% 1.82/2.02 ---> New Demodulator: 20 [new_demod,19] join(complement(A),A)=n1.
% 1.82/2.02 ** KEPT (pick-wt=6): 21 [] meet(complement(A),A)=n0.
% 1.82/2.02 ---> New Demodulator: 22 [new_demod,21] meet(complement(A),A)=n0.
% 1.82/2.02 ** KEPT (pick-wt=5): 23 [] complement(complement(A))=A.
% 1.82/2.02 ---> New Demodulator: 24 [new_demod,23] complement(complement(A))=A.
% 1.82/2.02 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.82/2.02 >>>> Starting back demodulation with 4.
% 1.82/2.02 >>>> Starting back demodulation with 6.
% 1.82/2.02 >>>> Starting back demodulation with 8.
% 1.82/2.02 >>>> Starting back demodulation with 10.
% 1.82/2.02 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] meet(A,B)=meet(B,A).
% 1.82/2.02 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] join(A,B)=join(B,A).
% 1.82/2.02 >>>> Starting back demodulation with 14.
% 1.82/2.02 >>>> Starting back demodulation with 16.
% 1.82/2.02 >>>> Starting back demodulation with 18.
% 1.82/2.02 >> back demodulating 7 with 18.
% 1.82/2.02 >>>> Starting back demodulation with 20.
% 1.82/2.02 >>>> Starting back demodulation with 22.
% 1.82/2.02 >>>> Starting back demodulation with 24.
% 1.82/2.02
% 1.82/2.02 ======= end of input processing =======
% 1.82/2.02
% 1.82/2.02 =========== start of search ===========
% 1.82/2.02
% 1.82/2.02
% 1.82/2.02 Resetting weight limit to 11.
% 1.82/2.02
% 1.82/2.02
% 1.82/2.02 Resetting weight limit to 11.
% 1.82/2.02
% 1.82/2.02 sos_size=480
% 1.82/2.02
% 1.82/2.02
% 1.82/2.02 Resetting weight limit to 10.
% 1.82/2.05
% 1.82/2.05
% 1.82/2.05 Resetting weight limit to 10.
% 1.82/2.05
% 1.82/2.05 sos_size=284
% 1.82/2.05
% 1.82/2.05 -------- PROOF --------
% 1.82/2.05
% 1.82/2.05 ----> UNIT CONFLICT at 0.12 sec ----> 1429 [binary,1427.1,49.1] $F.
% 1.82/2.05
% 1.82/2.05 Length of proof is 30. Level of proof is 13.
% 1.82/2.05
% 1.82/2.05 ---------------- PROOF ----------------
% 1.82/2.05 % SZS status Unsatisfiable
% 1.82/2.05 % SZS output start Refutation
% See solution above
% 1.82/2.05 ------------ end of proof -------------
% 1.82/2.05
% 1.82/2.05
% 1.82/2.05 Search stopped by max_proofs option.
% 1.82/2.05
% 1.82/2.05
% 1.82/2.05 Search stopped by max_proofs option.
% 1.82/2.05
% 1.82/2.05 ============ end of search ============
% 1.82/2.05
% 1.82/2.05 -------------- statistics -------------
% 1.82/2.05 clauses given 169
% 1.82/2.05 clauses generated 15713
% 1.82/2.05 clauses kept 745
% 1.82/2.05 clauses forward subsumed 12867
% 1.82/2.05 clauses back subsumed 0
% 1.82/2.05 Kbytes malloced 4882
% 1.82/2.05
% 1.82/2.05 ----------- times (seconds) -----------
% 1.82/2.05 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 1.82/2.05 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.05 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.82/2.05
% 1.82/2.05 That finishes the proof of the theorem.
% 1.82/2.05
% 1.82/2.05 Process 30406 finished Wed Jul 27 08:13:18 2022
% 1.82/2.05 Otter interrupted
% 1.82/2.05 PROOF FOUND
%------------------------------------------------------------------------------