TSTP Solution File: LAT011-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT011-1 : TPTP v8.1.0. Released v2.2.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:46 EDT 2022
% Result : Unsatisfiable 2.15s 2.31s
% Output : Refutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 3 RR)
% Number of literals : 30 ( 29 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(a,b) != meet2(a,b),
file('LAT011-1.p',unknown),
[] ).
cnf(2,plain,
meet2(a,b) != meet(a,b),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(8,axiom,
meet(A,join(A,B)) = A,
file('LAT011-1.p',unknown),
[] ).
cnf(10,axiom,
join(A,meet(A,B)) = A,
file('LAT011-1.p',unknown),
[] ).
cnf(12,axiom,
meet(A,B) = meet(B,A),
file('LAT011-1.p',unknown),
[] ).
cnf(13,axiom,
join(A,B) = join(B,A),
file('LAT011-1.p',unknown),
[] ).
cnf(14,axiom,
meet(meet(A,B),C) = meet(A,meet(B,C)),
file('LAT011-1.p',unknown),
[] ).
cnf(20,axiom,
meet2(A,B) = meet2(B,A),
file('LAT011-1.p',unknown),
[] ).
cnf(21,axiom,
meet2(A,join(A,B)) = A,
file('LAT011-1.p',unknown),
[] ).
cnf(23,axiom,
join(A,meet2(A,B)) = A,
file('LAT011-1.p',unknown),
[] ).
cnf(25,axiom,
meet2(meet2(A,B),C) = meet2(A,meet2(B,C)),
file('LAT011-1.p',unknown),
[] ).
cnf(27,plain,
meet(join(A,B),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,8])]),
[iquote('para_into,12.1.1,8.1.1,flip.1')] ).
cnf(29,plain,
join(A,meet(B,A)) = A,
inference(para_from,[status(thm),theory(equality)],[12,10]),
[iquote('para_from,12.1.1,10.1.1.2')] ).
cnf(31,plain,
join(meet(A,B),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,10])]),
[iquote('para_into,13.1.1,10.1.1,flip.1')] ).
cnf(36,plain,
meet2(A,join(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[21,13]),
[iquote('para_into,21.1.1.2,13.1.1')] ).
cnf(38,plain,
meet2(join(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[21,20]),
[iquote('para_into,21.1.1,20.1.1')] ).
cnf(51,plain,
join(meet(A,B),meet(A,meet(B,C))) = meet(A,B),
inference(para_from,[status(thm),theory(equality)],[14,10]),
[iquote('para_from,14.1.1,10.1.1.2')] ).
cnf(53,plain,
join(A,meet2(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[23,20]),
[iquote('para_into,23.1.1.2,20.1.1')] ).
cnf(55,plain,
join(meet2(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[23,13]),
[iquote('para_into,23.1.1,13.1.1')] ).
cnf(57,plain,
meet(join(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[27,13]),
[iquote('para_into,27.1.1.1,13.1.1')] ).
cnf(65,plain,
join(meet(A,B),B) = B,
inference(para_into,[status(thm),theory(equality)],[29,13]),
[iquote('para_into,29.1.1,13.1.1')] ).
cnf(115,plain,
meet2(A,meet(A,B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[38,31]),
[iquote('para_into,38.1.1.1,31.1.1')] ).
cnf(127,plain,
meet2(A,meet2(B,join(C,meet2(A,B)))) = meet2(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[25,36])]),
[iquote('para_into,25.1.1,36.1.1,flip.1')] ).
cnf(147,plain,
meet(A,meet2(A,B)) = meet2(A,B),
inference(para_from,[status(thm),theory(equality)],[55,27]),
[iquote('para_from,55.1.1,27.1.1.1')] ).
cnf(151,plain,
meet(A,meet2(B,A)) = meet2(B,A),
inference(para_into,[status(thm),theory(equality)],[57,53]),
[iquote('para_into,57.1.1.1,53.1.1')] ).
cnf(160,plain,
meet2(A,meet(B,A)) = meet(B,A),
inference(para_from,[status(thm),theory(equality)],[65,38]),
[iquote('para_from,65.1.1,38.1.1.1')] ).
cnf(455,plain,
join(meet(A,B),meet(A,meet2(C,B))) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[51,151]),
[iquote('para_into,51.1.1.2.2,151.1.1')] ).
cnf(1469,plain,
join(meet(A,B),meet2(A,B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[455,147]),
[iquote('para_into,455.1.1.2,147.1.1')] ).
cnf(1477,plain,
meet2(A,B) = meet(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1469,127]),160,115])]),
[iquote('para_from,1469.1.1,127.1.1.2.2,demod,160,115,flip.1')] ).
cnf(1479,plain,
$false,
inference(binary,[status(thm)],[1477,2]),
[iquote('binary,1477.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT011-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n009.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:09:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.15/2.31 ----- Otter 3.3f, August 2004 -----
% 2.15/2.31 The process was started by sandbox on n009.cluster.edu,
% 2.15/2.31 Wed Jul 27 08:09:21 2022
% 2.15/2.31 The command was "./otter". The process ID is 7198.
% 2.15/2.31
% 2.15/2.31 set(prolog_style_variables).
% 2.15/2.31 set(auto).
% 2.15/2.31 dependent: set(auto1).
% 2.15/2.31 dependent: set(process_input).
% 2.15/2.31 dependent: clear(print_kept).
% 2.15/2.31 dependent: clear(print_new_demod).
% 2.15/2.31 dependent: clear(print_back_demod).
% 2.15/2.31 dependent: clear(print_back_sub).
% 2.15/2.31 dependent: set(control_memory).
% 2.15/2.31 dependent: assign(max_mem, 12000).
% 2.15/2.31 dependent: assign(pick_given_ratio, 4).
% 2.15/2.31 dependent: assign(stats_level, 1).
% 2.15/2.31 dependent: assign(max_seconds, 10800).
% 2.15/2.31 clear(print_given).
% 2.15/2.31
% 2.15/2.31 list(usable).
% 2.15/2.31 0 [] A=A.
% 2.15/2.31 0 [] meet(X,X)=X.
% 2.15/2.31 0 [] join(X,X)=X.
% 2.15/2.31 0 [] meet(X,join(X,Y))=X.
% 2.15/2.31 0 [] join(X,meet(X,Y))=X.
% 2.15/2.31 0 [] meet(X,Y)=meet(Y,X).
% 2.15/2.31 0 [] join(X,Y)=join(Y,X).
% 2.15/2.31 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 2.15/2.31 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 2.15/2.31 0 [] meet2(X,X)=X.
% 2.15/2.31 0 [] meet2(X,Y)=meet2(Y,X).
% 2.15/2.31 0 [] meet2(X,join(X,Y))=X.
% 2.15/2.31 0 [] join(X,meet2(X,Y))=X.
% 2.15/2.31 0 [] meet2(meet2(X,Y),Z)=meet2(X,meet2(Y,Z)).
% 2.15/2.31 0 [] meet(a,b)!=meet2(a,b).
% 2.15/2.31 end_of_list.
% 2.15/2.31
% 2.15/2.31 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.15/2.31
% 2.15/2.31 All clauses are units, and equality is present; the
% 2.15/2.31 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.15/2.31
% 2.15/2.31 dependent: set(knuth_bendix).
% 2.15/2.31 dependent: set(anl_eq).
% 2.15/2.31 dependent: set(para_from).
% 2.15/2.31 dependent: set(para_into).
% 2.15/2.31 dependent: clear(para_from_right).
% 2.15/2.31 dependent: clear(para_into_right).
% 2.15/2.31 dependent: set(para_from_vars).
% 2.15/2.31 dependent: set(eq_units_both_ways).
% 2.15/2.31 dependent: set(dynamic_demod_all).
% 2.15/2.31 dependent: set(dynamic_demod).
% 2.15/2.31 dependent: set(order_eq).
% 2.15/2.31 dependent: set(back_demod).
% 2.15/2.31 dependent: set(lrpo).
% 2.15/2.31
% 2.15/2.31 ------------> process usable:
% 2.15/2.31 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] meet2(a,b)!=meet(a,b).
% 2.15/2.31
% 2.15/2.31 ------------> process sos:
% 2.15/2.31 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.15/2.31 ** KEPT (pick-wt=5): 4 [] meet(A,A)=A.
% 2.15/2.31 ---> New Demodulator: 5 [new_demod,4] meet(A,A)=A.
% 2.15/2.31 ** KEPT (pick-wt=5): 6 [] join(A,A)=A.
% 2.15/2.31 ---> New Demodulator: 7 [new_demod,6] join(A,A)=A.
% 2.15/2.31 ** KEPT (pick-wt=7): 8 [] meet(A,join(A,B))=A.
% 2.15/2.31 ---> New Demodulator: 9 [new_demod,8] meet(A,join(A,B))=A.
% 2.15/2.31 ** KEPT (pick-wt=7): 10 [] join(A,meet(A,B))=A.
% 2.15/2.31 ---> New Demodulator: 11 [new_demod,10] join(A,meet(A,B))=A.
% 2.15/2.31 ** KEPT (pick-wt=7): 12 [] meet(A,B)=meet(B,A).
% 2.15/2.31 ** KEPT (pick-wt=7): 13 [] join(A,B)=join(B,A).
% 2.15/2.31 ** KEPT (pick-wt=11): 14 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 2.15/2.31 ---> New Demodulator: 15 [new_demod,14] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 2.15/2.31 ** KEPT (pick-wt=11): 16 [] join(join(A,B),C)=join(A,join(B,C)).
% 2.15/2.31 ---> New Demodulator: 17 [new_demod,16] join(join(A,B),C)=join(A,join(B,C)).
% 2.15/2.31 ** KEPT (pick-wt=5): 18 [] meet2(A,A)=A.
% 2.15/2.31 ---> New Demodulator: 19 [new_demod,18] meet2(A,A)=A.
% 2.15/2.31 ** KEPT (pick-wt=7): 20 [] meet2(A,B)=meet2(B,A).
% 2.15/2.31 ** KEPT (pick-wt=7): 21 [] meet2(A,join(A,B))=A.
% 2.15/2.31 ---> New Demodulator: 22 [new_demod,21] meet2(A,join(A,B))=A.
% 2.15/2.31 ** KEPT (pick-wt=7): 23 [] join(A,meet2(A,B))=A.
% 2.15/2.31 ---> New Demodulator: 24 [new_demod,23] join(A,meet2(A,B))=A.
% 2.15/2.31 ** KEPT (pick-wt=11): 25 [] meet2(meet2(A,B),C)=meet2(A,meet2(B,C)).
% 2.15/2.31 ---> New Demodulator: 26 [new_demod,25] meet2(meet2(A,B),C)=meet2(A,meet2(B,C)).
% 2.15/2.31 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.15/2.31 >>>> Starting back demodulation with 5.
% 2.15/2.31 >>>> Starting back demodulation with 7.
% 2.15/2.31 >>>> Starting back demodulation with 9.
% 2.15/2.31 >>>> Starting back demodulation with 11.
% 2.15/2.31 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] meet(A,B)=meet(B,A).
% 2.15/2.31 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] join(A,B)=join(B,A).
% 2.15/2.31 >>>> Starting back demodulation with 15.
% 2.15/2.31 >>>> Starting back demodulation with 17.
% 2.15/2.31 >>>> Starting back demodulation with 19.
% 2.15/2.31 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] meet2(A,B)=meet2(B,A).
% 2.15/2.31 >>>> Starting back demodulation with 22.
% 2.15/2.31 >>>> Starting back demodulation with 24.
% 2.15/2.31 >>>> Starting back demodulation with 26.
% 2.15/2.31
% 2.15/2.31 ======= end of input processing =======
% 2.15/2.31
% 2.15/2.31 =========== start of search ===========
% 2.15/2.31
% 2.15/2.31
% 2.15/2.31 Resetting weight limit to 11.
% 2.15/2.31
% 2.15/2.31
% 2.15/2.31 Resetting weight limit to 11.
% 2.15/2.31
% 2.15/2.31 sos_size=607
% 2.15/2.31
% 2.15/2.31 -------- PROOF --------
% 2.15/2.31
% 2.15/2.31 ----> UNIT CONFLICT at 0.37 sec ----> 1479 [binary,1477.1,2.1] $F.
% 2.15/2.31
% 2.15/2.31 Length of proof is 19. Level of proof is 6.
% 2.15/2.31
% 2.15/2.31 ---------------- PROOF ----------------
% 2.15/2.31 % SZS status Unsatisfiable
% 2.15/2.31 % SZS output start Refutation
% See solution above
% 2.15/2.31 ------------ end of proof -------------
% 2.15/2.31
% 2.15/2.31
% 2.15/2.31 Search stopped by max_proofs option.
% 2.15/2.31
% 2.15/2.31
% 2.15/2.31 Search stopped by max_proofs option.
% 2.15/2.31
% 2.15/2.31 ============ end of search ============
% 2.15/2.31
% 2.15/2.31 -------------- statistics -------------
% 2.15/2.31 clauses given 337
% 2.15/2.31 clauses generated 74944
% 2.15/2.31 clauses kept 781
% 2.15/2.31 clauses forward subsumed 48186
% 2.15/2.31 clauses back subsumed 0
% 2.15/2.31 Kbytes malloced 5859
% 2.15/2.31
% 2.15/2.31 ----------- times (seconds) -----------
% 2.15/2.31 user CPU time 0.37 (0 hr, 0 min, 0 sec)
% 2.15/2.31 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.15/2.31 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.15/2.31
% 2.15/2.31 That finishes the proof of the theorem.
% 2.15/2.31
% 2.15/2.31 Process 7198 finished Wed Jul 27 08:09:23 2022
% 2.15/2.31 Otter interrupted
% 2.15/2.31 PROOF FOUND
%------------------------------------------------------------------------------